Movatterモバイル変換

[0]ホーム
URL:

Skip to main content

Advertisement

Springer Nature Link
Log in

Threshold Cryptography in Mobile Ad Hoc Networks

  • Conference paper

Part of the book series:Lecture Notes in Computer Science ((LNSC,volume 3352))

Included in the following conference series:

Abstract

The area of Threshold Cryptography investigates the design and analysis of protocols that distribute, in wired networks, cryptographic actions usually performed by a single party into multi-party variants, where the original action is successfully performed only if at least a certain threshold of the participants are available and not corrupted. As of today, several examples of threshold cryptographic protocols (e.g., signatures, public-key cryptosystems, zero-knowledge protocols, etc.) are being investigated in the Cryptography literature.

We note that the impact of the Threshold Cryptography paradigm is of even greater importance to study the security of other types of communication networks, such as Mobile Ad Hoc Networks, where the existence and availability of trusted authorities is severely limited by intrinsic network features, and problems such as avoiding a “single point of failure”, or, more generally, “service availability”, become crucial.

In this paper we formalize, investigate and present satisfactory solutions for the general problem of Threshold Cryptography in Mobile Ad Hoc Networks. Although we restrict our study to the cryptographic operation of digital signatures schemes, our definitional approaches can be extended to most other cryptographic actions studied in Threshold Cryptography.

Prepared through collaborative participation in the Communications and Networks Consortium sponsored by the U. S. Army Research Laboratory under the Collaborative Technology Alliance Program, Cooperative Agreement DAAD19-01-2-0011. The U. S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation thereon.

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

Access this chapter

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Algesheimer, J., Camenisch, J., Shoup, V.: Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, p. 417. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Boldyreva, A.: Efficient Threshold Signatures, Multisignature and Blind Signature Schemes based on the Gap-Diffie-Hellman-group Signature Scheme. In: Proc. of Public-Key Cryptography (2003)

    Google Scholar 

  3. Boneh, D., Franklin, M.: Efficient Generation of Shared RSA Keys. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 425–439. Springer, Heidelberg (1997)

    Google Scholar 

  4. Boneh, D., Lynn, B., Shacham, H.: Short Signatures from the Weil Pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, p. 514. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. De Santis, A., Desmedt, Y., Frankel, Y., Yung, M.: How to Share a Function Securely. In: Proc. of STOC (1994)

    Google Scholar 

  6. Desmedt, Y., Di Crescenzo, G., Burmester, M.: Multiplicative Non-Abelian Sharing Schemes and their Application to Threshold Cryptography. In: Proc. of Asiacrypt (1994)

    Google Scholar 

  7. Desmedt, Y., Frankel, Y.: Threshold Cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307–315. Springer, Heidelberg (1989)

    Google Scholar 

  8. Desmedt, Y., Frankel, Y.: Shared Authentication of Authenticators and Signatures. In: Proc. of CRYPTO (1991)

    Google Scholar 

  9. Desmedt, Y.: Threshold Cryptography. European Transaction of Telecommunications, 5(4) (1994)

    Google Scholar 

  10. Di Crescenzo, G., Ge, R., Arce, G.: Secure Service Provision for Reliable Service Pooling in MANET. In: Proc. of 24th Army Science Conference (2004) (to appear)

    Google Scholar 

  11. Feldman, P.: A Practical Scheme for Non-Interactive Verifiable Secret Sharing. In: Proc. of FOCS (1987)

    Google Scholar 

  12. Fouque, A., Stern, J.: One Round Threshold Discrete-Log Key Generation without Private Channels. In: Proc. of Public Key Cryptography (2001)

    Google Scholar 

  13. Fouque, A., Stern, J.: Fully Distributed Threshold RSA under Standard Assumptions. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, p. 310. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  14. Frankel, Y., MacKenzie, P., Yung, M.: Robust Efficient Distributed RSA Key Generation. In: Proc. of STOC (1998)

    Google Scholar 

  15. Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Revisiting the Distributed Key Generation for Discrete Log Based Cryptosystems. In: Proc. of RSA security conference (2003)

    Google Scholar 

  16. Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust and Efficient Sharing of RSA Functions. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 157–172. Springer, Heidelberg (1996)

    Google Scholar 

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

    Google Scholar 

  18. Katz, J., Yung, M.: Threshold Cryptosystems based on Factoring. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 192–205. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  19. Pedersen, T.: 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 

  20. Pedersen, T.: A threshold Cryptosystem without a Trusted Party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 522–526. Springer, Heidelberg (1991)

    Google Scholar 

  21. Shoup, V.: Practical Threshold Signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, p. 207. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  22. Zhou, L., Haas, Z.J.: Securing Ad Hoc Networks. IEEE Network Magazine 13(6) (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Telcordia Technologies, Piscataway, NJ, USA

    Giovanni Di Crescenzo

  2. University of Delaware, Newark, DE, USA

    Gonzalo Arce & Renwei Ge

Authors
  1. Giovanni Di Crescenzo

    You can also search for this author inPubMed Google Scholar

  2. Gonzalo Arce

    You can also search for this author inPubMed Google Scholar

  3. Renwei Ge

    You can also search for this author inPubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica e Applicazioni, Università degli Studi di Salerno, Via Ponte Don Melillo, I-84084, Fisciano, (SA), Italy

    Carlo Blundo

  2. Dipartimento di Tecnologie dell’Informazione, Universitá di Milano, Via Bramante 65, P.O. Box, 26013, Crema, (CR), Italy

    Stelvio Cimato

Rights and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Di Crescenzo, G., Arce, G., Ge, R. (2005). Threshold Cryptography in Mobile Ad Hoc Networks. In: Blundo, C., Cimato, S. (eds) Security in Communication Networks. SCN 2004. Lecture Notes in Computer Science, vol 3352. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30598-9_7

Download citation

Publish with us

[8]ページ先頭
©2009-2025 Movatter.jp