• Article
  • | |
  • Metrics
  • |
  • Reference [10]
  • |
  • Related [20]
  • |
  • Cited by [6]
  • | |
  • Comments
    Abstract:

    Verifiable secret sharing (VSS) is a very important tool in cryptography and information security. Many threshold VSS schemes are available in the literature, but only a little attention has been paid to general VSS. In this paper, the problem of general verifiable secret sharing is considered. Based on a general secret sharing scheme, Feldman's VSS scheme is extended to the case of arbitrary monotone access structures. A secure and efficient general VSS protocol is proposed. The newly proposed protocol is non-interactive, and has the best information rate. It may have practical applications in many areas, such as key escrow, group oriented cryptography, and fault-tolerant secure computation etc.

    Reference
    [1] Shamir, A. How to share a secret. Communications of the ACM, 1979,24(11):612~613.
    [2] Blakley, G.R. safeguarding cryptographic keys. In: Proceedings of the National Computer Conference. New York: AFIPS Press, 1979,48:242~268.
    [3] Chor, B., Goldwasser, S., Micali, S., et al. Verifiable secret sharing and achieving simultaneity in the presence of faults. In: Proceedings of the 26th IEEE Symposium on Foundations of Computer Science. Washington: IEEE Computer Society Press, 1985. 251~160.
    [4] Pedersen, T. Non-Interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J., ed. Advances in Cryptology Crypto'91. Berlin: Springer-Verlag, 1991. 129~140.
    [5] Gennaro, R. Theory and practice of verifiable secret sharing . Massachusetts Institute of Technology (MIT), 1996.
    [6] Feldman, P. A practical scheme for non-interactive verifiable secret sharing. In: Proceedings of the 28th IEEE Symposium on Foundations of Computer Science. Washington: IEEE Computer Society Press, 1987. 427~437.
    [7] Gennaro, R., Rabin, M., Rabin, T. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In: Proceedings of the 1998 ACM Symposium on Principles of Distributed Computing, 1998. 101~111. http://www. research.ibm.com/ security/grr.ps.
    [8] Fujisaki, E., Okamoto, T. A practical and provably secure scheme for publicly verifiable secret sharing and its applications, In: Nyberg, K, ed. Advances in Cryptology, EUROCRYPTO'98. Berlin: Springer-Verlag, 1998. 32~47.
    [9] Gennaro, R., Jarecki, S., Krawczyk, H., et al. Robust threshold DSS signatures. Information and Computation, 2001,164:54~84.
    [10] Shoup, V. Practical threshold signature. In: Preneel, B. ed. Advances in Cryptology, EUROCRYPT'2000, Berlin: Springer-Verlag, 2000. 207~220.
    Comments
    Comments
    分享到微博
    Submit
Get Citation

张福泰,张方国,王育民.一个安全、高效的广义可验证秘密分享协议.软件学报,2002,13(7):1187-1192

Copy
Share
Article Metrics
  • Abstract:3355
  • PDF: 5019
  • HTML: 0
  • Cited by: 0
History
  • Received:July 05,2001
  • Revised:January 07,2002
You are the first2032680Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063