Impact of Network Topology on Delay Anonymity Tradeoff using Optimal Routing

Authors

  • G. Renukapravallika  PG Scholar, Department of MCA, St. Anns College of Engineering & Technology, Chirala, Andhra Pradesh, India
  • P. S. Naveen Kumar  Assistant Professor, Department of MCA, , St. Ann’s College of Engineering & Technology, Chirala, Andhra Pradesh, India

Keywords:

Routing, non-repudiation, Byzantine failure, MANET, Security, Authentication, Integrity, Non-repudiation, Confidentiality, Key and Trust Management(KTM).

Abstract

Providing anonymity to routes in a wireless ad hoc network system from inactive spies is considered. Utilizing Shannon's evasion as a data theoretic measure of namelessness, planning methodologies are intended for remote hubs utilizing recipient coordinated flagging. The achievable rate district for multi access transfers is described under requirements by and large parcel dormancy. The connection between general system throughput and the course secrecy is acquired by attracting an association with the rate-twisting tradeoff in data hypothesis. A decentralized usage of the transferring procedure is proposed, and the comparing execution investigated.

References

  1. D. Chaum, “Untraceable electronic mail, return addresses and digital pseudonyms,” Communications of the ACM, vol. 24, pp. 84-88, February 1981.
  2. L. Cottrell, “Mixmaster and Remailer Attacks,” tech. rep., 1994.
  3. C. D'?az and A. Serjantov, “Generalizing mixes,” in Proceedings of Privacy Enhancing Technologies Workshop (PET 2003), Springer-Verlag, LNCS 2760, April 2003.
  4. Y. Zhu, X. Fu, B. Graham, R.Bettati, and W. Zhao, “On flow correlation attacks and countermeasures in mix networks,” in Proceedings of Privacy Enhancing Technologies workshop, May 26-28 2004.
  5. A. Pfitzmann, B. Pfitzmann, and M. Waidner, “ISDNMIXes: Untraceable communication with very small bandwidth overhead,” in Proceedings of the GI/ITG Conference: Communication in Distributed Systems, Informatics Fachberichte, vol. 267, (Mannheim, Germany), pp. 451- 463, February 1991.
  6. O. Berthold, H. Federrath, and S. Kopsell, “Web MIXes: A system for anonymous and unobservable Internet access,” in Proceedings of the Workshop on Design Issues in Anonymity and Unobservability, Lecture Notes in Computer Science, vol. 2009, (Berkeley, CA), pp. 115-129, July 2000.
  7. B. Radosavljevic and B. Hajek, “Hiding traffic flow in communication networks,” in Military Communications Conference, 1992.
  8. C. D'?az, S. Seys, J. Claessens, and B. Preneel, “Towards measuring anonymity,” in Proceedings of Privacy Enhancing Technologies Workshop (PET 2002) (R. Dingledine and P. Syverson, eds.), Springer-Verlag, LNCS 2482, April 2002.
  9. A. Serjantov and G. Danezis, “Towards an information theoretic metric for anonymity,” in Proceedings of Privacy Enhancing Technologies Workshop (PET 2002) (R. Dingledine and P. Syverson, eds.), Springer-Verlag, LNCS 2482, April 2002.
  10. C. E. Shannon, “Communication theory of secrecy systems,” Bell System Technical Journal, 1949.
  11. A. Wyner, “The wiretap channel,” Bell Syst. Tech. J., vol. 54, pp. 1355-1387, 1975.
  12. I. Csiszar' and J. Korner, “Broadcast channels with confidential messages,” IEEE Trans. on Information Theory, vol. 24, pp. 339-348, May 1978.
  13. P. Venkitasubramaniam, T. He, and L. Tong, “Anonymous Networking amidst Eavesdroppers,” to appear IEEE Transactions on Information Theory: Special Issue on Information-Thoeretic Security, 2008.
  14. G. Danezis, R. Dingledine, and N. Mathewson, “Mixminion: design of a type iii anonymous remailer protocol,” in Proceedings of 2003 Symposium on Security and Privacy, pp. 2-15, May 2003.
  15. R. Dingledine, N. Mathewson, and P. Syverson, “Tor: The Second-generation Onion Router,” in Proc. USENIX Security Symposium., (San Diego, CA), 2004.
  16. R. Dingledine and P. Syverson, “Reliable MIX Cascade Networks through Reputation,” Financial Cryptography. Springer-Verlag, LNCS, vol. 2357, 2002.
  17. I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong, “Freenet: A distributed anonymous information storage and retrieval system” in Privacy Enhancing Technologies: International Workshop on Design Issues in Anonymity and Unobservability (2001), pp. 46-66. http://freenet.sourceforge.net.
  18. M. J. Freedman and R. Morris, “Tarzan: A peer-toper anonymizing network layer,” in Proceedings of 9th ACM Conference on Computer and Communications Security, (Washington, DC), Nov. 2002.
  19. R. Bohme, G. Danezis, C. Diaz, S. Kopsell, and A. Pfitzmann, “Mix cascades vs. peer-to-peer: Is one concept superior?,” in Privacy Enhancing Technologies (PET 2004), (Toronto, Canada), May 2004.
  20. D. Chaum, “The dining cryptographers problem: Unconditional sender and recipient untraceability,” Journal of Cryptography, vol. 1, no. 1, pp. 65-75, 1988.
  21. M. K. Reiter and A. D. Rubin, “Crowds: anonymity for Web transactions,” ACM Transactions on Information and System Security, vol. 1, no. 1, pp. 66-92, 1998.

International Journal of Scientific Research in Science, Engineering and Technology

Downloads

Published

2018-04-30

Issue

Volume 4, Issue 4, March-April-2018

Section

Research Articles

License

Copyright (c) IJSRSET

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
G. Renukapravallika, P. S. Naveen Kumar, " Impact of Network Topology on Delay Anonymity Tradeoff using Optimal Routing, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 4, Issue 4, pp.01-08, March-April-2018.