Aggregate designated verifier signatures and application to secure routing

International Journal of Security and Networks

Volumn 2, Issue 3-4, 2007, Pages 192-201

  Bhaskar, Raghav ^a   Herranz, Javier ^b   Laguillaumie, Fabien ^c  

^a INRIA ROCQUENCOURT   (France)

^b CWI   (Netherlands)

^c ECOLE POLYTECHNIQUE   (France)

Author keywords

ad hoc networks; aggregate designated verifier signatures; MAC; Message Authentication Code; routing protocols

Indexed keywords

EID: 57849124555     PISSN: 17478405     EISSN: 17478413     Source Type: Journal    
DOI: 10.1504/ijsn.2007.013173     Document Type: Article

References (28)

1. Bellare, M., Kilian, J. and Rogaway, P. (2000) ‘The security of the cipher block chaining message authentication code’, Journal of Computer and System Sciences, Vol. 61, No. 3, pp.362–399.
2. Bellare, M. and Rogaway, P. (1993) ‘Random oracles are practical: a paradigm for designing efficient protocols’, Proceedings of the ACM First Conference on Computer and Communications Security, pp.62–73.
3. Bhaskar, R., Herranz, J. and Laguillaumie, F. (2006) ‘Efficient authentication for reactive routing protocols’, Proceedings of AINA 2006, IEEE Computer Society, Vol. 2, pp.57–61.
4. Boneh, D. and Franklin, M. (2003) ‘Identity-based encryption from the Weil pairing’, SIAM Journal of Computing, Vol. 32, No. 3, pp.586–615.
5. Boneh, D., Gentry, C., Lynn, B. and Shacham, H. (2003) ‘Aggregate and verifiably encrypted signatures from bilinear maps’, Proceedings of Eurocrypt’03, Springer-Verlag, LNCS 2656, pp.416–432.
6. Boneh, D., Lynn, B. and Shacham, H. (2004) ‘Short signatures from the Weil pairing’, Journal of Cryptology, Vol. 17, No. 4, pp.297–319.
7. Buttyan, L. and Vajda, I. (2004) ‘Towards provable security for ad hoc routing protocols’, Proceedings of SASN ’04, ACM Press, pp.94–105.
8. Chakeres, I., Belding-Royer, E. and Perkins, C. (2005) ‘Dynamic MANET on-demand (DYMO) routing’, IETF Internet Draft.
9. Clausen, T. and Jacquet, P. (2003) ‘Optimized link state routing protocol’, Internet RFC 3626.
10. Huang, X., Susilo, W., Mu, Y. and Zhang, F. (2006) ‘Short (identity-based) strong designated verifier signature schemes’, Proceedings of ISPEC 2006, Springer-Verlag, LNCS 3903, pp.214–225.
11. Hu, Y-C., Johnson, D.B. and Perrig, A. (2003a) ‘SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks’, Ad Hoc Networks, Vol. 1, No. 1, pp.175–192.
12. Hu, Y-C., Perrig, A. and Johnson, D.B. (2003b) ‘ARIADNE: a secure on-demand routing protocol for ad hoc networks’, Proceedings of Mobicom’02, pp.12–23.
13. Jakobsson, M., Sako, K. and Impagliazzo, R. (1996) ‘Designated verifier proofs and their applications’, Proceedings of Eurocrypt’96, Springer-Verlag, LNCS 1070, pp.142–154.
14. Krawczyk, H., Bellare, M. and Canetti, R. (1997) ‘Keyed-hashing for message authentication’, Internet RFC 2104.
15. Laguillaumie, F. and Vergnaud, D. (2005) ‘Designated verifiers signature: anonymity and efficient construction from any bilinear map’, Proceedings of SCN’04, Springer-Verlag, LNCS 3352, pp.107–121.
16. Lipmaa, H., Wang, G. and Bao, F. (2005) ‘Designated verifier signature schemes: attacks, new security notions and a new construction’, Proceedings of ICALP 2005, Springer-Verlag, LNCS 3580, pp.459–471.
17. Lysyanskaya, A., Micali, S., Reyzin, L. and Shacham, H. (2004) ‘Sequential aggregate signatures from trapdoor permutations’, Proceedings of Eurocrypt’04, Springer-Verlag, LNCS 3027, pp.74–90.
18. Papadimitratos, P. and Haas, Z.J. (2002) ‘Secure routing for mobile ad hoc networks’, Proceedings of CNDS 2002.
19. Papadimitratos, P. and Haas, Z.J. (2003) ‘Secure message transmission in mobile ad hoc networks’, Ad Hoc Networks, Vol. 1, No. 1, pp.193–209.
20. Perkins, C.E. and Royer, E.M. (1999) ‘Ad hoc on-demand distance vector routing’, Proceedings of the IEEE Second Workshop on Mobile Computing Systems and Applications, pp.90–100.
21. Perrig, A., Canetti, R., Song, D. and Tygar, J.D. (2000) ‘Efficient authentication and signing of multicast streams over lossy channels’, IEEE Symposium on Security and Privacy, pp.56–73.
22. Sanzgiri, K., Dahill, B., Levine, B.N., Shields, C. and Belding-Royer, E. (2002) ‘A secure routing protocol for ad hoc networks’, Proceedings of the IEEE Conference ICPN’02, IEEE Computer Society, pp.78–89.
23. Shamir, A. (1984) ‘Identity-based cryptosystems and signature schemes’, Proceedings Crypto’84, Springer-Verlag, LNCS 196, pp.47–53.
24. Steinfeld, R., Bull, L., Wang, H. and Pieprzyk, J. (2003) ‘Universal designated-verifier signatures’, Proceedings of Asiacrypt’03, Springer-Verlag, LNCS 2894, pp.523–542.
25. Zapata, M.G. (2003) ‘Secure ad hoc on-demand distance vector routing’, IETF Internet draft.
26. Zhu, H., Bao, F., Li, T. and Wu, Y. (2005) ‘Sequential aggregate signatures for wireless routing protocols’, Proceedings of the IEEE Workshop WCNC’05, pp.2436–2439.
27. We suppose, for simplicity of the notation and w.l.o.g., that each user Aļ has signed only one message mļ.
28. To avoid attacks in the chosen key model (Boneh et al., 2003). If the messages are not all distinct, then the output of this algorithm is a rejection symbol ±.