Skip to main content
SpringerLink
Log in

Protocols useful on the Internet from distributed signature schemes

  • Regular contribution
  • Published:
International Journal of Information Security Aims and scope Submit manuscript

Abstract

Distributed cryptography deals with scenarios where a cryptographic operation is performed by a collective of persons. In a distributed signature scheme, a group of players share some secret information in such a way that only authorized subsets of players can compute valid signatures. We propose methods to construct some computationally secure protocols from distributed signature schemes, namely, we construct metering schemes from distributed noninteractive signature schemes. We also show that distributed deterministic signature schemes can be used to design distributed key distribution schemes. In particular, we construct the first metering and distributed key distribution schemes based on the RSA primitive.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bellare M, Rogaway P (1993) Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of the 1st ACM conference on computer and communications security (CCS’93), pp 62–73

  2. Blundo C, Cimato S, Masucci B (2002) A note on optimal metering schemes. Inf Process Lett 84(6):319–326

    Article  MathSciNet  Google Scholar 

  3. Blundo C, D’Arco P, Daza V, Padró C (2001) Bounds and constructions for unconditionally secure distributed key distribution schemes with general access structures. In: Davida GI, Frankel Y (eds) Proceedings of the conference on information security (ISC’01). Lecture notes in computer science, vol 2200. Springer, Berlin Heidelberg New York, pp 1–17

  4. Boldyreva A (2003) Threshold signatures, multisignatures and blind signatures based on the Gap-Diffie-Hellman-group signature scheme. In: Desmedt YG (ed) Proceedings of the workshop on public key cryptography (PKC’03). Lecture notes in computer science, vol 2567. Springer, Berlin Heidelberg New York, pp 31–46

  5. Boneh D, Franklin M (1997) Efficient generation of shared RSA keys. In: Kaliski B (ed) Advances in Cryptology-Crypto’97. Lecture notes in computer science, vol 1294. Springer, Berlin Heidelberg New York, pp 425–439

  6. Catalano D, Gennaro R, Halevi S (2000) Computing inverses over a shared secret modulus. In: Preneel B (ed) Advances in Cryptology-Eurocrypt’00. Lecture notes in computer science, vol 1807. Springer, Berlin Heidelberg New York, pp 190–206

  7. Damgård I, Koprowski M (2001) Practical threshold RSA signatures without a trusted dealer. In: Pfitzmann B (ed) Advances in Cryptology-Eurocrypt’01. Lecture notes in computer science, vol 2045. Springer, Berlin Heidelberg New York, pp 152–165

  8. D’Arco P, Stinson DR (2002) On unconditionally secure robust distributed key distribution centers. In: Zheng Y (ed) Advances in Cryptology-Asiacrypt’02. Lecture notes in computer science, vol 2501. Springer, Berlin Heidelberg New York, pp 346–363

  9. Daza V, Herranz J, Padró C, Sáez G (2002) A distributed and computationally secure key distribution scheme. In: Chan A, Gligor V (eds) Proceedings of the conference on information security (ISC’02). Lecture notes in computer science, vol 2433. Springer, Berlin Heidelberg New York, pp 342–356

  10. Daza V, Herranz J, Sáez G (2003) Some protocols useful on the Internet from threshold signature schemes. In: Proceedings of the workshop on trust and privacy in digital business (TrustBus’03). IEEE Press, New York, pp 359–363

  11. Fouque PA, Stern J (2001) Fully distributed threshold RSA under standard assumptions. In: Boyd C (ed) Advances in Cryptology-Asiacrypt’01. Lecture notes in computer science, vol 2248. Springer, Berlin Heidelberg New York, pp 310–330

  12. Frankel Y, Gemmell P, MacKenzie P, Yung M (1997) Proactive RSA. In: Kaliski B (ed) Advances in Cryptology-Crypto’97. Lecture notes in computer science, vol 1294. Springer, Berlin Heidelberg New York, pp 440–454

  13. Gennaro R, Jarecki S, Krawczyk H, Rabin T (1996) Robust threshold DSS signatures. In: Maurer U (ed) Advances in Cryptology-Eurocrypt’96. Lecture notes in computer science, vol 1070. Springer, Berlin Heidelberg New York, pp 354–371

  14. Gennaro R, Jarecki S, Krawczyk H, Rabin T (1999) Secure distributed key generation for discrete-log based cryptosystems. In: Stern J (ed) Advances in Cryptology-Eurocrypt’99. Lecture notes in computer science, vol 1592. Springer, Berlin Heidelberg New York, pp 295–310

  15. Gennaro R, Halevi S, Rabin T (1999) Secure hash-and-sign signature without the random oracle. In: Stern J (ed) Advances in Cryptology-Eurocrypt’99. Lecture notes in computer science, vol 1592. Springer, Berlin Heidelberg New York, pp 123–139

  16. Goldwasser S, Micali S (1984) Probabilistic encryption. J Comput Sys Sci 28:270–299

    Article  MathSciNet  Google Scholar 

  17. Goldwasser S, Micali S, Rivest R (1988) A digital signature scheme secure against adaptative chosen-message attacks. SIAM J Comput 17(2):281–308

    Article  MathSciNet  Google Scholar 

  18. Herranz J, Padró C, Sáez G (2003) Distributed RSA signature schemes for general access structures. In: Boyd C, Mao W (eds) Proceedings of the conference on information security (ISC’03). Lecture notes in computer science, vol 2851. Springer, Berlin Heidelberg New York, pp 122–136

  19. Masucci B, Stinson DR (2000) Metering schemes for general access structures. In: Cuppens F, Deswarte Y, Gollmann D, Waidner M (eds) Proceedings of ESORICS’00. Lecture notes in computer science, vol 1895. Springer, Berlin Heidelberg New York, pp 72–87

  20. Naor M, Pinkas B (1998) Secure and efficient metering. In: Nyberg K (ed) Advances in Cryptology-Eurocrypt’98. Lecture notes in computer science, vol 1403. Springer, Berlin Heidelberg New York, pp 576–590

  21. Naor M, Pinkas B, Reingold O (1999) Distributed pseudo-random functions and KDCs. In: Stern J (ed) Advances in Cryptology-Eurocrypt’99. Lecture notes in computer science, vol 1592. Springer, Berlin Heidelberg New York, pp 327–346

  22. Needham RM, Schroeder MD (1978) Using encryption for authentication in large networks of computers. Commun ACM 21:993–999

    Article  Google Scholar 

  23. Ogata W, Kurosawa K (2000) Provably secure metering scheme. In: Okamoto T (ed) Advances in Cryptology-Asiacrypt’00. Lecture notes in computer science, vol 1976. Springer, Berlin Heidelberg New York, pp 388–398

  24. Rivest RL, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public key cryptosystems. Commun ACM 21:120–126

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  26. Shoup V (2000) Practical threshold signatures. In: Preneel B (ed) Advances in Cryptology-Eurocrypt’00. Lecture notes in computer science, vol 1807. Springer, Berlin Heidelberg New York, pp 207–220

  27. Simmons GJ, Jackson W, Martin K (1991) The geometry of secret sharing schemes. Bull ICA 1:71–88

    MathSciNet  Google Scholar 

  28. Stinson DR, Strobl R (2001) Provably secure distributed Schnorr signatures and a (t,n) threshold scheme for implicit certificates. In: Varadharajan V, Mu Y (eds) Proceedings of the Australasian conference on information security and privacy (ACISP’01). Lecture notes in computer science, vol 2119. Springer, Berlin Heidelberg New York, pp 417–434

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

    Vanesa Daza, Javier Herranz & Germán Sáez

Authors
  1. Vanesa Daza
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Javier Herranz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Germán Sáez
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vanesa Daza.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Daza, V., Herranz, J. & Sáez, G. Protocols useful on the Internet from distributed signature schemes. IJIS 3, 61–69 (2004). https://doi.org/10.1007/s10207-004-0043-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10207-004-0043-y

Keywords

Search

Navigation