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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
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)
De Santis, A., Desmedt, Y., Frankel, Y., Yung, M.: How to Share a Function Securely. In: Proc. of STOC (1994)
Desmedt, Y., Di Crescenzo, G., Burmester, M.: Multiplicative Non-Abelian Sharing Schemes and their Application to Threshold Cryptography. In: Proc. of Asiacrypt (1994)
Desmedt, Y., Frankel, Y.: Threshold Cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307–315. Springer, Heidelberg (1989)
Desmedt, Y., Frankel, Y.: Shared Authentication of Authenticators and Signatures. In: Proc. of CRYPTO (1991)
Desmedt, Y.: Threshold Cryptography. European Transaction of Telecommunications, 5(4) (1994)
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)
Feldman, P.: A Practical Scheme for Non-Interactive Verifiable Secret Sharing. In: Proc. of FOCS (1987)
Fouque, A., Stern, J.: One Round Threshold Discrete-Log Key Generation without Private Channels. In: Proc. of Public Key Cryptography (2001)
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)
Frankel, Y., MacKenzie, P., Yung, M.: Robust Efficient Distributed RSA Key Generation. In: Proc. of STOC (1998)
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)
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)
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)
Katz, J., Yung, M.: Threshold Cryptosystems based on Factoring. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 192–205. Springer, Heidelberg (2002)
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)
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)
Shoup, V.: Practical Threshold Signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, p. 207. Springer, Heidelberg (2000)
Zhou, L., Haas, Z.J.: Securing Ad Hoc Networks. IEEE Network Magazine 13(6) (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
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
DOI: https://doi.org/10.1007/978-3-540-30598-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24301-4
Online ISBN: 978-3-540-30598-9
eBook Packages: Computer ScienceComputer Science (R0)