Compact routing discovery protocol with lower communication complexity

IEEE Wireless Communications and Networking Conference, WCNC

Volumn 1, Issue , 2006, Pages 307-310

  Zhu, Huafei ^a   Bao, Feng ^a   Chigan, Chunxiao Tricia ^b  

^a INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

^b Michigan Technological University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION COMPLEXITY;

COMPUTER SIMULATION; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; TELECOMMUNICATION;

ROUTING PROTOCOLS;

EID: 34250322750     PISSN: 15253511     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. A. Boldyreva. Efficient threshold signature, multisignature and blind signature schemes based on the gap-Diffie-Hellman-group signature scheme. In Y. Desmedt, editor, Proceedings of PKC 2003, volume 2567 of LNCS, pages 31C46. Springer-Verlag, 2003.
2. Dan Boneh, Craig Gentry, Ben Lynn, Hovav Shacham: Aggregate and Verifiably Encrypted Signatures from Bilinear Maps. EUROCRYPT 2003: 416-432.
3. Dan Boneh, Craig Gentry, Ben Lynn, Hovav Shacham: A Survey of Two Signature Aggregation Techniques. In CryptoBytes Vol. 6, No. 2, 2003.
4. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In D. Denning, R. Pyle, R. Ganesan, R. Sandhu, and V. Ashby, editors, Proceedings of CCS 1993, pages 62-73. ACM Press, 1993.
5. L.Buttyán and I. Vajda, Towards Provable Security for Ad Hoc Routing Protocols, 2nd ACM Workshop on Security in Ad Hoc and Sensor Networks (SASN 2004) Washington DC, USA, October 25, 2004, 94-105.
6. R. Canetti: Universally Composable Security: A New Paradigm for Cryptographic Protocols. FOCS 2001: 136-145
7. R. Canetti. Universally Composable Signatures, Certification, and Authentication. Proceedings of the 17th Computer Security Foundations Workshop (CSFW), June 2004.
8. S. Goldwasser, S. Micali, R. Rivest: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM J. Comput. 17(2): 281-308, 1988.
9. S. Kent, C. Lynn and K. Seo: Secure Border Gateway Protocol (S-BGP). IEEE Journal on Selected Areas in Communicaitons, Vol. 18, No. 4, Apr. 2000.
10. K. Kawauchi, Y. Komano, K. Ohta and M. Tada: Probabilistic multi-signature schemes using a one-way trap-door permutation, IEICE transactions on fundamentals, vol.E87-A, no5, pp.1141 -1153, 2004. Previous version: Kei Kawauchi, Mitsuru Tada: On the Extract Security of Multi-signature Schemes Based on RSA. ACISP 2003: 336-349
11. Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Hovav Shacham: Sequential Aggregate Signatures from trapdoor one-way permutations. EUROCRYPT 2004: 74-90.
12. S. Micali, K. Ohta, and L. Reyzin. Accountable-subgroup multisignatures (extended abstract). In Proceedings of CCS 2001, pages 245 -254. ACM Press, 2001.
13. K. Ohta and T. Okamoto. Multisignature schemes secure against active insider attacks. IEICE Trans. Fundamentals, E82 -A(1):21-31, 1999.
14. M. Tada: A secure multisignature scheme with signing order Verifiability, IEICE transactions on fundamentals, vol.E86-A, no.1, pp.73-88, 2003. Previous version: M. Tada: An Order-Specified Multisignature Scheme Secure against Active Insider Attacks. ACISP 2002: 328-345.
15. Huafei Zhu, Feng Bao, Tieyan Li, Yongdong Wu: Constructing Sequential Aggregate Signatures for Secure Wireless Routing Protocols, IEEE Wireless Communications and Networking Conference 2005 (WCNC'05), New Orleans, 13 - 17 March, 2005.