Abstract
In mobile adhoc networks, generating and maintaining anonymity for any adhoc node is challenging because of the node mobility, dynamic network topology, cooperative nature of the network and broadcast nature of the communication media. Anonymity is provided to protect the communication, by hiding the participants as well as the message contents. Existing techniques based on cryptosystem and broadcasting cannot be easily adapted to MANET because of their extensive cryptographic computation and/or large communication overhead. In this paper, we first propose an unconditionally secure privacy preserving message authentication scheme (PPMAS) which uses Modified New variant ElGamal signature Scheme (MNES). Secondly we proposed privacy preserving communication protocol for MANET based on dynamic generation of pseudonyms, which are used in place of real nodes to provide anonymity.
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
Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM 24, 84–88 (1981)
Khadir, O.: New Variant of ElGamal Signature Scheme. J. Contemp. Math. Sciences 5(34), 1653–1662 (2010)
Chaum, D.: The dining Cryptographer’s problemml: unconditional sender and recipient untraceability. J. Cryptology 1(1), 65–75 (1988)
Reiter, M.K., Rubin, A.D.: Crowds: Anonymity for Web Transactions. ACM Transactions on Information and System Security 1(1), 66–92 (1998); Symposium on Security & Privacy, Oakland, Calif, USA (May 2003)
Ren, J., Li, Y., Li, T.: SPM: Source Privacy for Mobile Ad Hock Networks. EURASIP J. on Wireless Communications and Networking 2010, article ID534712, 10 Pages (2010)
Reed, M.G., Syverson, P.F., Goldschlag, D.M.: Anonymous Connections and Onion Routing. J. Selected Areas in Communication Special Issue on Copyright and Privacy Protection (1998)
Danezis, G., Dingledine, R., Mathewson: Mixminion: design of a type III anonymous remailer protocol. In: Proc. of the IEEE Computer Society Symposium on Research in Security and Privacy, Oakland, Calif, USA, pp. 2–15 (May 2003)
Möller, B.: Provably secure public-key encryptionfor length-preserving chaumian mixes. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 244–262. Springer, Heidelberg (2003)
Pointcheval, D., Stern, J.: Security proofs for signature schemes. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 387–398. Springer, Heidelberg (1996)
Rivest, R., Shamir, A., Tauman, Y.: How to leak a secret. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 552–565. Springer, Heidelberg (2001)
Goldwasser, S., Micali, S., Rivest, R.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing 17, 281–308 (1988)
ElGamal, T.A.: A public-key cryptosystem and a signature scheme based on discrete Logarithms. IEEE Transactions on Information Theory 31(4), 469–472 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jhansi Vazram, B., Valli Kumari, V., Murthy, J.V.R. (2011). Privacy in Mobile Ad Hoc Networks. In: Nagamalai, D., Renault, E., Dhanuskodi, M. (eds) Advances in Digital Image Processing and Information Technology. DPPR 2011. Communications in Computer and Information Science, vol 205. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24055-3_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-24055-3_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24054-6
Online ISBN: 978-3-642-24055-3
eBook Packages: Computer ScienceComputer Science (R0)