Advertisement

A Strong PVSS Scheme

  • Fuyou Miao
  • Xianchang Du
  • Wenjing Ruan
  • Suwan Wang
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 131)

Abstract

A verifiable secret sharing allows the dealer to share a share with some participants and can be verified the correctness. Stadler extended the idea and presented a notion of Public Verifiable Secret Scheme (PVSS), which has the property that any one can verify the validity of the share from the sender, but neglects the deceit of receiver. In this paper, we first give a formal definition of strong PVSS (SPVSS) based on PVSS and propose a specific SPVSS scheme. The scheme solves the cheating problems on both sides, which has strong verification requirements. Finally, we show our scheme satisfies the definition of strong PVSS.

Keywords

Secret sharing Secret security Publicly verifiable Diffie-Hellman 

Notes

Acknowledgments

The paper is supported by NSF of China (granted no. 60970128, No. 61170233, No. 61272472), Youth Innovation Foundation of USTC of 2010 and China Postdoctoral Science Foundation (No. 2011M501397).

References

  1. 1.
    Blakley GR (1979) Safeguarding cryptographic keys. In: Proceedings of the national computer conference 1979, vol 48. American Federation of Information Processing Societies, pp 313–317Google Scholar
  2. 2.
    Shamir A (1979) How to share a secret. Commun ACM 22(11):612–613MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Chor B, Goldwasser S, Micali S, Awerbuch B (1985) Verifiable secret sharing and achieving simultaneity in the presence of faults. In: 26th annual symposium on foundation of computer, science, pp 383–395Google Scholar
  4. 4.
    Feldman P (1987) A practical scheme for non-interactive verifiable secret sharing. In: Proceedings of the 28th IEEE symposium on foundations of computer science, pp 427–437Google Scholar
  5. 5.
    Pederson TP (1992) Non-interactive and information-theotetic secure verifiable secret sharing. In: Advances in cryptology-CRYPTO’91, LNVS576, pp 129–140Google Scholar
  6. 6.
    Stadler M (1996) Publicly verifiable secret sharing. In: Advance in cryptology-EUROCRYPT’96. LNCS 1070:190–199Google Scholar
  7. 7.
    Schoenmakers B (1999) A simple publicly verifiable secret sharing scheme and its application to electronic voting. In: CRYPTO’99. LNCS 1666:148–164MathSciNetGoogle Scholar
  8. 8.
    Young A, Yung M (2001) A PVSS as hard as discrete log and shareholder separability. In: PKC 2001, LNCS 1992, 2001, pp 287–299Google Scholar
  9. 9.
    Behnad A, Eghlidos T (2008) A new publicly verifiable secret sharing scheme. Scientia Iranica 15(2):246–251MathSciNetMATHGoogle Scholar
  10. 10.
    Fujisaki E, Okamoto T (1998) A practical and provably secure scheme for publicly verifiable secret sharing and its applications. In: Eurocrypt’98, LNCS 1403, 1998, pp 32–46Google Scholar
  11. 11.
    Chor B, Goldwasser S, Micali S, Awerbuch B (1985) Verifiable secret sharing and achieving simultaneity in the presence of faults. In: Proceedings of 26th annual symposium on foundations of computer science 1985, pp 383–395Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Fuyou Miao
    • 1
  • Xianchang Du
    • 1
  • Wenjing Ruan
    • 1
  • Suwan Wang
    • 2
  1. 1.School of Computer ScienceUniversity of Science and TechnologyHefeiPeople’s Republic of China
  2. 2.School of Computer Science and TechnologyUniversity of AnhuiHefeiChina

Personalised recommendations