Pseudonym-based cryptography for anonymous communications in mobile ad hoc networks

International Journal of Security and Networks

Volumn 2, Issue 3-4, 2007, Pages 272-283

  Huang, Dijiang ^a  

^a Arizona State University   (United States)

Author keywords

anonymity; blind signature; IBE; identity based encryption decryption; pairing

Indexed keywords

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

References (27)

1. Bellare, M., Boldyreva, A., Desai, A. and Pointcheval, D. (2001) ‘Key-privacy in public-key encryption’, Advances in Cryptology - Asiacrypt.
2. Bellare, M. and Rogaway, P. (1995) ‘Optimal asymmetric encryption’, Proceedings of the EUROCRYPT’94, Lecture Notes in Computer Science 950.
3. Berg, O., Berg, T., Haavik, S., Hjelmstad, J. and Skaug, R. (1998) ‘Spread Spectrum in Mobile Communication’, Institution of Electrical Engineers.
4. Blake, I.F., Seroussi, G. and Smart, N. P. (2005) Advances in Elliptic Curve Cryptography, London: Cambridge University Press, Mathematical Society Lecture Note Series 317.
5. Boldyreva, A. (2003) ‘Threshold signatures, multisignatures and blind signatures based on the gap-diffie-hellman-group signature scheme’, Proceedings of International Workshop on Theory and Practice in Public key Cryptography (PKC).
6. Boneh, D. and Franklin, M. (2003) ‘Identity-based encryption from the weil pairing’, SIAM Journal of Computing, Vol. 3, pp.586–615.
7. Boneh, D., Lynn, B. and Shacham, H. (2001) ‘Short signatures from the weil pairing’, Proceedings of the Asiacrypt 2001, Volume 2248 ofLNCS, pp.514–532.
8. Boukerche, A., El-Khatib, K., Xu, L. and Korba, L. (2004) ‘A novel solution for achieving anonymity in wireless ad hoc networks’, Proceedings of the 1st ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks.
9. Camenisch, J. and Lysyanskaya, A. (2001) ‘An efficient system for non-transferable anonymous credentials with optional anonymity revocation’, Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology, Springer-Verlag: pp.93–118.
10. Chen, X., Zhang, F. and Kim, K. (2003) ‘A new id-based group signature scheme from bilinear pairings’, Proceedings of 4th International Workshop on Information Security Applications (WISA), pp.585–592.
11. Díaz, C. and Preneel, B. (2004) ‘Taxonomy of mixes and dummy traffic’, Proceedings of I-NetSec04: 3rd Working Conference on Privacy and Anonymity in Networked and Distributed Systems.
12. Fu, X., Zhu, Y., Graham, B., Bettati, R. and Zhao, W. (2005) ‘On flow marking attacks in wireless anonymous communication networks’, Proceedings of the ICDCS 2005.
13. Fujisaki, E. and Okamoto, T. (1999) ‘Secure integration of asymmetric and symmetric encryption schemes’, Proceedings of the CRYPTO 99, Springer-Verlag, pp.537–554.
14. Huang, D. (2006) ‘Traffic analysis-based unlinkability measure for IEEE 802.11b-based communication systems’, Proceedings of ACM Workshop on Wireless Security (WiSe).
15. Kong, J. and Hong, X. (2003) ‘ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks’, ACM MobiHoc.
16. Mao, W. (1996) ‘Blind certification of public keys and off-line electronic cash’, Technical Report HPL-96–71, HP Laboratories Bristol.
17. Menezes, A., van Oorschot, P. and Vanstone, S. (1997) Handbook of Applied Cryptography, CRC Press.
18. Pfitzmann, A. and Hansen, M. (2005) ‘Anonymity, unlinkability, unobservability, pseudonymity, and identity management - a consolidated proposal for terminology’, Working Draft, Avaliable at: http://dud.inf.tu-dresden.de/literatur/Anon_Terminology_v0.26.doc.
19. Seys, S. and Preneel, B. (2006) ‘ARM: anonymous routing protocol for mobile ad hoc networks’, Proceedings of the 20th IEEE International Conference on Advanced Information Networking and Applications - Workshops (AINA 2006 Workshops).
20. Shamir, A. (1985) ‘Identity-based cryptosystems and signature schemes’, Proceedings of Crypto’84, LNCS Volume 196, pp.47–53.
21. Syverson, P., Tsudik, G., Reed, M., and Landwehr, C. (2000). ‘Towards an analysis of onion routing security’, Proceedings of Designing Privacy Enhancing Technologies: Workshop on Design Issues in Anonymity and Unobservability, pp.96–114.
22. Zhang, Y., Liu, W. and Lou, W. (2005) ‘Anonymous communications in mobile ad hoc networks’, Proceedings of IEEE Information Communications Conference (INFOCOM).
23. Zhu, B., Wan, Z., Kankanhalli, M.S., Bao, F. and Deng, R.H. (2004) ‘Anonymous secure routing in mobile ad-hoc networks’, Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks (LCN’04).
24. In all our following discussions, without special notation, we use the terms ‘pseudonym’ and ‘public key’ interchangeably.
25. To get the admission to the anonymous communication system, the AU may rely on an anonymous credential system such as (Camenisch and Lysyanskaya, 2001) in order to derive a certificate.
26. Pfitzmann and Hansen (2005) referred public pseudonyms to phone numbers, e-mail addresses, mail addresses and so on, which can be used as pseudonyms for the subjects’s identities. Since a public pseudonym can be easily linked to a unique subject, we consider the public pseudonym as another form of the identity.
27. The hash function H is not used in PBE scheme. Its usage will be describe in our certificate scheme in the Section 5.