Table of Contents Author Guidelines Submit a Manuscript
Security and Communication Networks
Volume 2017, Article ID 5437403, 6 pages
https://doi.org/10.1155/2017/5437403
Research Article

How to Share Secret Efficiently over Networks

1Department of Computer Science Electrical Engineering, University of Missouri-Kansas City, Kansas City, MO 64110, USA
2Computer School, Central China Normal University, Wuhan 430079, China
3Department of Computer Science, Wuhan University of Technology, Wuhan 430071, China
4Hubei Key Laboratory of Transportation Internet of Things, Wuhan University of Technology, Wuhan, China

Correspondence should be addressed to Ching-Fang Hsu; moc.liamg@gnafgnijyrrehc

Received 22 January 2017; Revised 22 July 2017; Accepted 9 August 2017; Published 27 September 2017

Academic Editor: Pedro Peris-Lopez

Copyright © 2017 Lein Harn 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 Association for Computing Machinery, vol. 22, no. 11, pp. 612-613, 1979. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. R. Blakley, “Safeguarding cryptographic keys,” Proceedings of the National Computer Conference, vol. 48, pp. 313–317, 1979. View at Google Scholar
  3. M. Mignotte, “How to share a secret,” in Proceedings of the Advances in Cryptology–EUROCRYPT '82, T. Beth, Ed., Lecture Notes in Computer Science, pp. 371–375, 1982.
  4. C. Asmuth and J. Bloom, “A modular approach to key safeguarding,” Institute of Electrical and Electronics Engineers. Transactions on Information Theory, vol. 29, no. 2, pp. 208–210, 1983. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. Y. Desmedt, “Society and group oriented cryptography: a new concept,” in Proceedings of the Advances in Cryptology–CRYPTO '87, vol. 1987, pp. 120–127.
  6. Y. Desmedt and Y. Frankel, “Threshold cryptosystems,” in Proceedings of the Advances in CRYPTO ’89, vol. 435 of Lecture Notes in Computer Science, pp. 307–315, 1989.
  7. L. Harn, “Group-oriented (t, n) threshold digital signature scheme and digital multisignature,” IEE Proceedings: Computers and Digital Techniques, vol. 141, no. 5, pp. 307–313, 1994. View at Publisher · View at Google Scholar · View at Scopus
  8. Y. Desmedt and Y. Frankel, “Shared generation of authenticators and signatures,” in Proceedings of the Advances in CRYPTO ’91, vol. 576 of Lecture Notes in Computer Science, pp. 457–469, 1991.
  9. A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung, “How to share a function securely,” in Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, pp. 522–533, May 1994. View at Scopus
  10. R. Gennaro, S. a. Jarecki, H. Krawczyk, and T. Rabin, “Robust and efficient sharing of RSA functions,” in Proceedings of the Advances in CRYPTO ’96, vol. 1109 of Lecture Notes in Comput. Sci., pp. 157–172, 1996.
  11. V. Shoup, “Practical threshold signature,” in Proceedings of the Advances in EUROCRYPT ’00, Lecture Notes in Computer Science, pp. 207–220, 2000.
  12. L. Ertaul and W. Lu, “Ecc based threshold cryptography for secure data forwarding and secure key exchange in manet,” in Proceedings of the International Conference on Research in Networking, 2005.
  13. Y. Shang, X. Wang, Y. Li, and Y. Zhang, “A general threshold signature scheme based on elliptic curve,” Advanced Materials Research, 2013. View at Google Scholar
  14. W. Gao, G. Wang, X. Wang, and Z. Yang, “One-round ID-based threshold signature scheme from bilinear pairings,” Informatica, vol. 20, no. 4, pp. 461–476, 2009. View at Google Scholar · View at MathSciNet
  15. M. Fitzi, J. Garay, S. Gollakota, C. P. Rangan, and K. Srinathan, “Round-optimal and efficient verifiable secret sharing,” in Proceedings of the 3rd Theory of Cryptography Conference, TCC ’06, Lecture Notes in Comput. Sci., pp. 329–342, Springer, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  16. R. Kumaresan, A. Patra, and C. P. Rangan, “The round complexity of verifiable secret sharing: The statistical case,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6477, pp. 431–447, 2010. View at Publisher · View at Google Scholar · View at Scopus
  17. A. Patra, A. Choudhary, T. Rabin, and C. Pandu Rangan, “The round complexity of verifiable secret sharing revisited,” in Proceedings of the Advances in Cryptology-CRYPTO '09, Lecture Notes in Comput. Sci., pp. 487–504, Springer, Berlin, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  18. D. Liu, P. Ning, and L. I. Rongfang, “Establishing pairwise keys in distributed sensor networks,” ACM Transactions on Information and System Security, vol. 8, no. 1, pp. 41–77, 2005. View at Publisher · View at Google Scholar · View at Scopus
  19. H. Liang and C. Wang, “An energy efficient dynamic key management scheme based on polynomial and cluster in wireless sensor netwoks,” Journal of Convergence Information Technology, vol. 6, no. 5, pp. 321–328, 2011. View at Publisher · View at Google Scholar · View at Scopus
  20. S. Guo and V. Leung, “A compromise-resilient group rekeying scheme for hierarchical wireless sensor networks,” in Proceedings of the IEEE Wireless Communications and Networking Conference 2010, WCNC '10, 2010.
  21. N. Saxena, G. Tsudik, and J. H. Yi, “Efficient node admission and certificateless secure communication in short-lived MANETs,” IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 2, pp. 158–170, 2009. View at Publisher · View at Google Scholar · View at Scopus
  22. L. Harn and C.-F. Hsu, “Dynamic threshold secret reconstruction and its application to the threshold cryptography,” Information Processing Letters, vol. 115, no. 11, pp. 851–857, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch, “Verifiable secret sharing and achieving simultaneity in the presence of faults,” Foundations of Computer Science, pp. 383–395, 1985. View at Google Scholar
  24. R. Cramer, I. Damgård, S. Dziembowski, M. Hirt, and T. Rabin, “Efficient multiparty computations secure against an adaptive adversary,” in Proceedings of the Conference on the Theory and Applications of Cryptographic Techniques, vol. 1999, pp. 311–326.
  25. R. Gennaro, Y. Ishai, E. Kushilevitz, and T. Rabin, “The round complexity of verifiable secret sharing and secure multicast,” in Proceedings of the Proceedings of the thirty-third annual ACM symposium on Theory of computing, pp. 580–589, 2001.
  26. J. Katz, C.-Y. Koo, and R. Kumaresan, “Improving the round complexity of vss in point-to-point networks,” in International Colloquium on Automata, Languages, and Programming, pp. 499–510, 2008. View at Google Scholar
  27. V. Nikov and S. Nikova, “On proactive secret sharing schemes,” in Proceedings of the International Workshop on Selected Areas in Cryptography, Lecture Notes in Comput. Sci., pp. 308–325, Springer, Berlin, New York, NY, USA. View at Publisher · View at Google Scholar · View at MathSciNet
  28. R. Canetti and H. Krawczyk, “Analysis of key-exchange protocols and their use for building secure channels,” in Advances in cryptology—EUROCRYPT, pp. 453–474, 2001. View at Google Scholar
  29. A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung, “Proactive secret sharing or: how to cope with perpetual leakage,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 963, pp. 339–352, 1995. View at Publisher · View at Google Scholar · View at Scopus
  30. Y. Frankel, P. Gemmell, P. D. MacKenzie, and M. Yung, “Optimal-resilience proactive public-key cryptosystems,” in Proceedings of the 1997 38th IEEE Annual Symposium on Foundations of Computer Science, pp. 384–393, October 1997. View at Scopus
  31. T. Rabin, “A simplified approach to threshold and proactive RSA,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1462, pp. 89–104, 1998. View at Publisher · View at Google Scholar · View at Scopus
  32. T.-Y. Wu and Y.-M. Tseng, “Publicly verifiable multi-secret sharing scheme from bilinear pairings,” IET Information Security, vol. 7, no. 3, pp. 239–246, 2013. View at Publisher · View at Google Scholar · View at Scopus
  33. A. Endurthi, O. B. Chanu, A. N. Tentu, and V. C. Venkaiah, “Reusable multi-stage multi-secret sharing schemes based on CRT,” Journal of Communications Software and Systems, vol. 11, no. 1, pp. 15–24, 2015. View at Publisher · View at Google Scholar · View at Scopus
  34. J. Herranz, A. Ruiz, and G. Sáez, “New results and applications for multi-secret sharing schemes,” Designs, Codes and Cryptography, vol. 73, no. 3, pp. 841–864, 2014. View at Publisher · View at Google Scholar · View at MathSciNet