Skip to main content
SpringerLink
Log in
SpringerLink
Log in

A Strong PVSS Scheme

  • Conference paper
  • First Online:
Computer Networks & Communications (NetCom)

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 131))

  • 1759 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 299.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 379.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 379.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  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–317

    Google Scholar 

  2. Shamir A (1979) How to share a secret. Commun ACM 22(11):612–613

    Article  MathSciNet  MATH  Google Scholar 

  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–395

    Google Scholar 

  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–437

    Google Scholar 

  5. Pederson TP (1992) Non-interactive and information-theotetic secure verifiable secret sharing. In: Advances in cryptology-CRYPTO’91, LNVS576, pp 129–140

    Google Scholar 

  6. Stadler M (1996) Publicly verifiable secret sharing. In: Advance in cryptology-EUROCRYPT’96. LNCS 1070:190–199

    Google Scholar 

  7. Schoenmakers B (1999) A simple publicly verifiable secret sharing scheme and its application to electronic voting. In: CRYPTO’99. LNCS 1666:148–164

    MathSciNet  Google Scholar 

  8. Young A, Yung M (2001) A PVSS as hard as discrete log and shareholder separability. In: PKC 2001, LNCS 1992, 2001, pp 287–299

    Google Scholar 

  9. Behnad A, Eghlidos T (2008) A new publicly verifiable secret sharing scheme. Scientia Iranica 15(2):246–251

    MathSciNet  MATH  Google Scholar 

  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–46

    Google Scholar 

  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–395

    Google Scholar 

Download references

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).

Author information

Authors and Affiliations

  1. School of Computer Science, University of Science and Technology, Hefei, People’s Republic of China

    Fuyou Miao, Xianchang Du & Wenjing Ruan

  2. School of Computer Science and Technology, University of Anhui, Hefei, China

    Suwan Wang

Authors
  1. Fuyou Miao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xianchang Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wenjing Ruan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Suwan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fuyou Miao .

Editor information

Editors and Affiliations

  1. Department of Computer Science & Eng., University of Calcutta, Calcutta, 700 073, India

    Nabendu Chaki

  2. , Department of Computer Science, Jackson State University, John R. Lynch Street 1400, Jackson, 39217, USA

    Natarajan Meghanathan

  3. Wireilla Net Solutions PTY Ltd, Merlow Street 10, Albion, 3020, Victoria, Australia

    Dhinaharan Nagamalai

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this paper

Cite this paper

Miao, F., Du, X., Ruan, W., Wang, S. (2013). A Strong PVSS Scheme. In: Chaki, N., Meghanathan, N., Nagamalai, D. (eds) Computer Networks & Communications (NetCom). Lecture Notes in Electrical Engineering, vol 131. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-6154-8_51

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-6154-8_51

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-6153-1

  • Online ISBN: 978-1-4614-6154-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation