About this Journal Submit a Manuscript Table of Contents
International Journal of Distributed Sensor Networks
Volume 2013 (2013), Article ID 902462, 9 pages
http://dx.doi.org/10.1155/2013/902462
Research Article

Publicly Verifiable Secret Sharing Scheme with Provable Security against Chosen Secret Attacks

1State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
2School of Information, Guangdong Ocean University, Zhanjiang, Guangdong 524088, China
3Network Security Research Institute, National Institute of Information and Communications Technology, 4-2-1 Nukui-Kitamachi, Koganei, Tokyo 184-8795, Japan

Received 29 August 2012; Accepted 8 January 2013

Academic Editor: Wensheng Zhang

Copyright © 2013 Yuanju Gan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. Shamir, “How to share a secret,” Communications of the ACM, vol. 22, no. 11, pp. 612–613, 1979. View at Publisher · View at Google Scholar
  2. T.-Y. Wu and Y.-M. Tseng, “A pairing-based publicly verifiable secret sharing scheme,” Journal of Systems Science and Complexity, vol. 24, no. 1, pp. 186–194, 2011. View at Publisher · View at Google Scholar
  3. S. Heidarvand and J. Villar, “Public verifiability from pairings in secret sharing schemes,” in Selected Areas in Cryptography, R. Avanzi, L. Keliher, and F. Sica, Eds., vol. 5381 of Lecture Notes in Computer Science, pp. 294–310, Springer, Berlin, Germany, 2009. View at Publisher · View at Google Scholar
  4. A. Beimel and M. Franklin, “Weakly-private secret sharing schemes,” in Theory of Cryptography, S. Vadhan, Ed., vol. 4392 of Lecture Notes in Computer Science, pp. 253–269, Springer, Berlin, Germany, 2007. View at Publisher · View at Google Scholar
  5. E. Fujisaki and T. Okamoto, “A practical and provably secure scheme for publicly verifiable secret sharing and its applications,” in Advances in Cryptology-EUROCRYPT '98, K. Nyberg, Ed., vol. 1403 of Lecture Notes in Computer Science, pp. 32–48, Springer, Berlin, Germany, 1998. View at Publisher · View at Google Scholar
  6. R. J. Hwang and C. C. Chang, “An on-line secret sharing scheme for multi-secrets,” Computer Communications, vol. 21, no. 13, pp. 1170–1176, 1998. View at Publisher · View at Google Scholar
  7. A. Patra, A. Choudhary, T. Rabin, and C. Rangan, “The round complexity of verifiable secret sharing revisited,” in Advances in Cryptology-CRYPTO 2009, S. Halevi, Ed., vol. 5677 of Lecture Notes in Computer Science, pp. 487–504, Springer, Berlin, Germany, 2009. View at Publisher · View at Google Scholar
  8. R. Kumaresan, A. Patra, and C. Rangan, “The round complexity of verifiable secret sharing: the statistical case,” in Advances in Cryptology-ASIACRYPT 2010, M. Abe, Ed., vol. 6477 of Lecture Notes in Computer Science, pp. 431–447, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar
  9. Hong Yu, Jingsha He, Ting Zhang, and Peng Xiao, “A group key distribution scheme for wireless sensor networks in the internet of things scenario,” International Journal of Distributed Sensor Networks, vol. 2012, 12 pages, 2012. View at Publisher · View at Google Scholar
  10. G. R. Blakley, “Safeguarding cryptographic keys,” in Proceedings of the National Computer Conference, vol. 1 of Managing Requirements Knowledge, pp. 313–329, 1979. View at Publisher · View at Google Scholar
  11. B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch, “Verifiable secret sharing and achieving simultaneity in the presence of faults,” in Proceedings of the 26th Annual Symposium on Foundations of Computer Science, pp. 383–395, 1985. View at Publisher · View at Google Scholar
  12. P. Feldman, “A practical scheme for non-interactive verifiable secret sharing,” in Proceedings of the 28th Annual Symposium on Foundations of Computer Science, pp. 427–438, Los Angeles, Calif, USA, 1987. View at Publisher · View at Google Scholar
  13. T. Pedersen, “Non-interactive and information-theoretic secure verifiable secret sharing,” in Advances in Cryptology-CRYPTO '91, J. Feigenbaum, Ed., vol. 576 of Lecture Notes in Computer Science, pp. 129–145, Springer, Berlin, Germany, 1992. View at Publisher · View at Google Scholar
  14. B. Schoenmakers, “A simple publicly verifiable secret sharing scheme and its application to electronic voting,” in Advances in Cryptology-CRYPTO '99, M. Wiener, Ed., vol. 1666 of Lecture Notes in Computer Science, pp. 784–799, Springer, Berlin, Germany, 1999. View at Publisher · View at Google Scholar
  15. A. Ruiz and J. L. Villar, “Publicly verifiable secret sharing from paillier's cryptosystems,” in Proceedings of the Western European Workshop on Research in Cryptology (WEWoRC '05), vol. 74 of Lecture Notes in Informatics, pp. 98–108, 2005.
  16. M. Stadler, “Publicly verifiable secret sharing,” in Advances in Cryptology-EUROCRYPT '96, U. Maurer, Ed., vol. 1070 of Lecture Notes in Computer Science, pp. 190–208, Springer, Berlin, Germany, 1996. View at Publisher · View at Google Scholar
  17. A. Fiat and A. Shamir, “How to prove yourself: how to prove yourself: practical solutions to identification and signature problems,” in Advances in Cryptology-CRYPTO '86, A. Odlyzko, Ed., vol. 263 of Lecture Notes in Computer Science, pp. 186–204, Springer, Berlin, Germany, 1987. View at Publisher · View at Google Scholar
  18. M. Bellare and P. Rogaway, “Random oracles are practical: a paradigm for designing efficient protocols,” in Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62–73, ACM, November 1993. View at Publisher · View at Google Scholar · View at Scopus
  19. R. Cramer and V. Shoup, “A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack,” in Advances in Cryptology-CRYPTO '98, H. Krawczyk, Ed., vol. 1462 of Lecture Notes in Computer Science, pp. 13–29, Springer, Berlin, Germany, 1998. View at Publisher · View at Google Scholar
  20. M. Jhanwar, “A practical (non-interactive) publicly verifiable secret sharing scheme,” in Information Security Practice and Experience, F. Bao and J. Weng, Eds., vol. 6672 of Lecture Notes in Computer Science, pp. 273–287, Springer, Berlin, Germany, 2011. View at Publisher · View at Google Scholar
  21. W. Huaxiong and D. S. Wong, “On secret reconstruction in secret sharing schemes,” Information Theory, IEEE Transactions on 2008, vol. 54, no. 1, pp. 473–480, 2008. View at Publisher · View at Google Scholar · View at Scopus
  22. D. Boneh and M. Franklin, “Identity-based encryption from the weil pairing,” in Advances in Cryptology-CRYPTO 2001, J. Kilian, Ed., vol. 2139 of Lecture Notes in Computer Science, pp. 213–230, Springer, Berlin, Germany, 2001. View at Publisher · View at Google Scholar
  23. D. Boneh and X. Boyen, “Efficient selective-ID secure identity-based encryption without random oracles,” in Advances in Cryptology-EUROCRYPT 2004, C. Cachin and J. Camenisch, Eds., vol. 3027 of Lecture Notes in Computer Science, pp. 223–239, Springer, Berlin, Germany, 2004. View at Publisher · View at Google Scholar
  24. B. Waters, “Efficient identity-based encryption without random oracles,” in Advances in Cryptology-EUROCRYPT 2005, R. Cramer, Ed., vol. 3494 of Lecture Notes in Computer Science, pp. 557–557, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar