Improved topology assumptions for threshold cryptography in mobile ad hoc networks

SASN'05 - Proceedings of the 2005 ACM Workshop on Security of Ad Hoc and Sensor Networks

Volumn 2005, Issue , 2005, Pages 53-62

  Di Crescenzo, Giovanni ^a   Ge, Renwei ^b   Arce, Gonzalo R ^b  

^a TELCORDIA TECHNOLOGIES   (United States)

^b UNIVERSITY OF DELAWARE   (United States)

Author keywords

Distributed Cryptography; Mobile Ad Hoc Networks; Threshold Cryptography; Threshold Signatures

Indexed keywords

DISTRIBUTED CRYPTOGRAPHY; MOBILE AD HOC NETWORKS; THRESHOLD CRYPTOGRAPHY; THRESHOLD SIGNATURES;

NETWORK PROTOCOLS; OPTIMIZATION; RESOURCE ALLOCATION; SECURITY OF DATA; TELECOMMUNICATION NETWORKS; TOPOLOGY;

CRYPTOGRAPHY;

EID: 33144477455     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1102219.1102228     Document Type: Conference Paper

References (20)

1. D. Beaver and S. Haber, Cryptographic Protocols Provably Secure Against Dynamic Adversaries, in Proc. of Eurocrypt 1992.
2. C. Bettstetter, G. Resta, and P. Santi, The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks, IEEE Trans.Mobile Computing, vol. 2, pp. 257-269, Jul.-Sept. 2003.
3. R. B. Bobba, L. Eschenauer, V. Gligor, and W. Arbaugh, Bootstrapping Security Associations for Routing in MANETs, in Institute for Systems Research, ISR Technical Report 2002-44, May 2002
4. D. Boneh and M. Franklin, Efficient Generation of Shared RSA Keys, in Proc. of CRYPTO 97.
5. D. Boneh, B. Lynn, and H. Shacham, Short Signatures from the Weil Pairing, in Proc. of Asiacrypt 2001.
6. Y. Desmedt and Y. Frankel, Threshold Cryptosystems, in Proc. of CRYPTO 89.
7. Y. Desmedt, Threshold Cryptography, in European Transaction of Telecommunications, vol. 5, n, 4, 1994.
8. G. Di Crescenzo, Security of Erasable Memories Against Adaptive Adversaries, in Proc. of ACM Workshop on Storage Security and Survivability 2005.
9. G. Di Crescenzo, N. Ferguson, R. Impagliazzo and M. Jakobsson, How to Forget a Secret, in Proc. of STAGS 2000.
10. G. Di Crescenzo, R. Ge and G. Arce, Threshold Cryptography over Mobile Ad Hoc Networks, in Proc. of SCN 2004.
11. P. Feldman, A Practical Scheme for Non-Interactive Verifiable Secret Sharing, in Proc. of FOCS 87.
12. R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin, Revisiting the Distributed Key Generation for Discrete Log Based Cryptosystems, in Proc. of RSA security conf. 03.
13. A.Herzberg, S.Jarecki, H.Krawczyk, and M.Yung, Proactive Secret Sharing or: How to Cope with Perpetual Leakage, in Proc. of CRYPTO 95.
14. A. Khalili, J. Katz and W. Arbaugh, Toward Secure Key Distribution in Truly Ad-Hoc Networks, in Proc. of SAINT Workshops 2003.
15. G. Montenegro and C. Castelluccia, Statistically Unique and Cryptographically Verifiable (SUCV) Identifier and Addresses, in Proc. of NDSS 2002.
16. J. Newsome, R. Shi, D. Song, and A. Perrig, The Sybil Attack in Sensor Networks: Analysis and Defenses, in Proc. of IPSN 2004.
17. G. O'Shea and M. Roe, Child-Proof Authentication for MIPv6, ACM Compu. Commun. Review, Apr. 2001.
18. T. Pedersen, A Threshold Cryptosystem without a Trusted Party, in Proc. of Eurocrypt 91.
19. R. Zhang and H. Imai. Round Optimal Distributed Key Generation of Threshold Cryptosystem based on Discrete Logarithm Problem, in Proc. of ACNS 2003.
20. L. Zhou and Z. J. Haas. Securing Ad Hoc Networks, in IEEE Network Magazine, vol. 13, no.6, 1999.