Skip to main content
Springer Nature Link
Log in

Verifiable Secret Sharing for General Access Structures, with Application to Fully Distributed Proxy Signatures

  • Conference paper
Financial Cryptography (FC 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2742))

Included in the following conference series:

  • 1214 Accesses

Abstract

Secret sharing schemes are an essential part of distributed cryptographic systems. When dishonest participants are considered, then an appropriate tool are verifiable secret sharing schemes. Such schemes have been traditionally considered for a threshold scenario, in which all the participants play an equivalent role. In this work, we generalize some protocols dealing with verifiable secret sharing, in such a way that they run in a general distributed scenario for both the tolerated subsets of dishonest players and the subsets of honest players authorized to execute the different phases of the protocols.

As an application of these protocols, we propose a fully distributed proxy signature scheme. In this scheme, a distributed entity delegates its signing capability to a distributed proxy entity, which signs messages on behalf of the original one. We consider in both entities the aforementioned general distributed scenario.

This work was partially supported by Spanish Ministerio de Ciencia y Tecnología under project TIC 2000-1044.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference, AFIPS 1979, pp. 313–317 (1979)

    Google Scholar 

  2. Brickell, E.F.: Some ideal secret sharing schemes. Journal of Combinatorial Mathematics and Combinatorial Computing 9, 105–113 (1989)

    MathSciNet  Google Scholar 

  3. Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: Proceedings of FOCS 1987, pp. 427–437. IEEE Press, Los Alamitos (1987)

    Google Scholar 

  4. Fouque, P.A., Stern, J.: One round threshold discrete-log key generation without private channels. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol. 1992, pp. 190–206. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust threshold DSS signatures. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 354–371. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  6. Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 295–310. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  7. Hirt, M., Maurer, U.: Complete characterization of adversaries tolerable in secure multi-party computation. In: Proceedings of PODC 1997, pp. 25–34 (1997)

    Google Scholar 

  8. Hwang, M., Lin, I., Lu, E.J.: A secure nonrepudiable threshold proxy signature scheme with known signers. International Journal of Informatica 11(2), 1–8 (2000)

    Google Scholar 

  9. Kim, S., Park, S., Won, D.: Proxy signatures, revisited. In: Proceedings of ICISC 1997, pp. 223–232 (1997)

    Google Scholar 

  10. Lee, B., Kim, H., Kim, K.: Strong proxy signature and its applications. In: Proceedings of SCIS 2001, vol. 2/2, pp. 603–608 (2001)

    Google Scholar 

  11. Mambo, M., Usuda, K., Okamoto, E.: Proxy signatures: Delegation of the power to sign messages. IEICE Transactions Fundamentals E79-A(9), 1338–1353 (1996)

    Google Scholar 

  12. Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129–140. Springer, Heidelberg (1992)

    Google Scholar 

  13. Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. Journal of Cryptology 13(3), 361–396 (2000)

    Article  MATH  Google Scholar 

  14. Schnorr, C.P.: Efficient signature generation by smart cards. Journal of Cryptology 4, 161–174 (1991)

    Article  MATH  Google Scholar 

  15. Schoenmakers, B.: A simple publicly verifiable secret sharing scheme and its applications to electronic voting. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 148–164. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  16. Shamir, A.: How to share a secret. Communications of the ACM (22), 612–613 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  17. Shao, Z.: Proxy signature schemes based on factoring. Information Processing Letters (85), 137–143 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  18. Shoup, V.: Practical Threshold Signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 207–220. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  19. Simmons, G.J., Jackson, W., Martin, K.: The geometry of secret sharing schemes. Bulletin of the ICA 1, 71–88 (1991)

    MathSciNet  MATH  Google Scholar 

  20. Stinson, D.R., Strobl, R.: Provably secure distributed Schnorr signatures and a (t, n) threshold scheme for implicit certificates. In: Varadharajan, V., Mu, Y. (eds.) ACISP 2001. LNCS, vol. 2119, pp. 417–434. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  21. Zhang, K.: Threshold proxy signature scheme. In: Proceedings of the 1997 Information Security Workshop, Japan, pp. 191–197 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Matemàtica Aplicada IV, Universitat Politècnica de Catalunya, C. Jordi Girona, 1-3, Mòdul C3, Campus Nord, 08034, Barcelona, Spain

    Javier Herranz & Germán Sáez

Authors
  1. Javier Herranz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Germán Sáez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and DIMACS, Rutgers University, 08854, Piscataway, NJ, USA

    Rebecca N. Wright

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Herranz, J., Sáez, G. (2003). Verifiable Secret Sharing for General Access Structures, with Application to Fully Distributed Proxy Signatures. In: Wright, R.N. (eds) Financial Cryptography. FC 2003. Lecture Notes in Computer Science, vol 2742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45126-6_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45126-6_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40663-1

  • Online ISBN: 978-3-540-45126-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics