An Efficient Secure Message Transmission in Mobile Ad Hoc Networks using Enhanced Homomorphic Encryption Scheme

Gorti VNKV Subba Rao
Gorti VNKV Subba Rao * §
Contact
§ Sree Dattha Institute of engineering and Science

Send Message

To: Author

An Efficient Secure Message Transmission in Mobile Ad Hoc Networks using Enhanced Homomorphic Encryption Scheme

Article Fingerprint

ReserarchID

CSTWB38U

An Efficient Secure Message Transmission in Mobile Ad Hoc Networks using Enhanced Homomorphic Encryption Scheme Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant
Access Review Comments
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu
Reading Preferences
Font Size
Line Spacing
Background

Abstract

In MANETs the nodes are capable of roaming independently. The node with inadequate physical protection can be easily captured, compromised and hijacked. Due to this huge dependency’s on the nodes, there are more security problems. Therefore the nodes in the network must be prepared to work in a mode that trusts no peer. In this paper we look at the current scheme to transmit the data in MANETs. We then propose a new scheme for secure transmission of message in MANETs as Alternative scheme for DF’s new Ph and DF’s additive and multiplicative PH. Here we also provide the computational cost of the homomorphic encryption schemes. We also provide the implementation issues of our new scheme in MANETs. For the entire message to be recoverd by the attacker, the attacker needs to compromise atleast g nodes, one node from each group g and know the encryption keys to decrypt the message. The success rate of our proposed new scheme is 100% if there are more number of active paths in each group of the network.

References

89 Cites in Article
  1. Josep Domingo-Ferrer (2002). A Provably Secure Additive and Multiplicative Privacy Homomorphism*.
  2. J Domingo-Ferrer (1996). A new Privacy Homomorphism and Applications.
  3. J Domingo-Ferrer,J Herrera-Joancomarti (1998). A privacy homomorphism allowing field operations on encrypted data.
  4. Hyungjick Lee,Jim Alves-Foss,Scott Harrison (2004). The use of Encrypted Functions for Mobile Agent Security.
  5. J Girao,D Westhoff,M Schneider (2004). Concealed data aggregation in wireless sensor networks.
  6. J Girao,D Westhoff,M Schneider (2005). CDA: concealed data aggregation for reverse multicast traffic in wireless sensor networks.
  7. T (1986). A public key cryptosystem and a signature scheme based on discrete logarithm.
  8. William Stallings (2006). Network Security Assessment Workplan.
  9. Panagiotis Papadimitratos,Zygmunt Haas (2003). Secure data transmission in mobile ad hoc networks.
  10. Mithun Acharya,Joao Girao,Dirk Westhoff (2005). Secure comparison of encrypted data in wireless sensor networks.
  11. P Papadimitratos,Z Haas (2002). Secure Routing for Mobile Ad Hoc Networks.
  12. P Papadimitratos,Z Haas,P Samar (2002). The Secure Routing Protocol (SRP) for Ad Hoc Networks.
  13. P Papadimitratos,Z Haas (2003). Secure link state routing for mobile ad hoc networks.
  14. L Ertaul,N Chavan (2005). Security of Ad Hoc Networks and Threshold Cryptography.
  15. L Ertaul,N Chavan (Apri). Security of Ad Hoc Networks and Threshold Cryptography.
  16. Levent Ertaul,Weimin Lu (2005). ECC Based Threshold Cryptography for Secure Data Forwarding and Secure Key Exchange in MANET (I).
  17. Makoto Yokoo,Koutarou Suzuki (2002). Secure multi-agent dynamic programming based on homomorphic encryption and its application to combinatorial auctions.
  18. Neal Koblitz (1987). Elliptic curve cryptosystems.
  19. A Menezes,D Johnson (1998). ECDSA: An Enhanced DSA.
  20. Certicom Corp Certicom ECC Tutorials.
  21. Certicom Corp (2000). Remarks on the Security of the ECC systems.
  22. K Lauter (2004). The advantages of elliptic curve cryptography for wireless security.
  23. Levent Ertaul,Weimin Lu (2005). ECC Based Threshold Cryptography for Secure Data Forwarding and Secure Key Exchange in MANET (I).
  24. Jung Hee Cheon,Hyun Soon,Nam A Cryptanalysis of the Original Domingo-Ferrer's Algebraic Privacy Homorphism.
  25. William Stallings Cryptography and Network Security.
  26. W Diffie,M Hellman (1976). New directions in cryptography.
  27. R Rivest,A Shamir,L Adleman (1978). A method for obtaining digital signatures and public-key cryptosystems.
  28. Yang Xiao (2007). Security in Sensor Networks.
  29. Dirk Westhoff,Joao Girao,Mithun Acharya (2006). Concealed data aggregation for reverse multicast traffic in sensor networks: Encryption, key distribution and routing adaptation.
  30. R Rivest,L Adleman,M Dertouzos (1978). Preserving Confidential Data Using Improved Rivest-Shamir Adleman to Secure Multi-Cloud.
  31. Jerry Rakesh Agrawal,Ramakrishnan Kiernan,Yirong Srikant,Xu (2004). Order-Preserving Encryption for Numeric Data.
  32. J Rissanen (1989). Stochastic Complexity in Statistical Inquiry.
  33. L Ertaul,Vaidehi (June). Finding Minimum Optimal Path Securely Using Homomorphic Encryption Schemes in Computer Networks.
  34. P Paillier (2000). Trapdooring Discrete Logarithms on Elliptic Curves over Rings.
  35. Willian Stallings (2006). Cryptography and Network Security, Principles and Practices.
  36. Tatsuaki Okamoto,Shigenori Uchiyama (1998). A new public-key cryptosystem as secure as factoring.
  37. W Stevens (1999). ◾ System Programming III: Interprocess Communication.
  38. Jeff Broberg (2016). Early manual rotation (EMR).
  39. Sheldon Cohen (1988). Psychosocial models of the role of social support in the etiology of physical disease..
  40. The Health Insurance Portability and Accountability Act of 1996.
  41. R Agrawal,D Asonov,M Kantarcioglu,Yaping Li (2006). Sovereign Joins.
  42. F Emekci,D Agrawal,A Abbadi,A Gulbeden (2006). Privacy Preserving Query Processing Using Third Parties.
  43. Dan Boneh,Ran Canetti,Shai Halevi,Jonathan Katz (2007). Chosenciphertext security from identity-based encryption.
  44. Moni Naor,Benny Pinkas,Reuban Sumner (1999). Privacy preserving auctions and mechanism design.
  45. Bruce Schneier Applied cryptography -Protocols, Algorithms and Source Code in C.
  46. Levent Ertaul,Weimin Lu (2005). ECC Based Threshold Cryptography for Secure Data Forwarding and Secure Key Exchange in MANET (I).
  47. Mikhail Atallah,Keith Frikken,Marina Blanton,Younsun Cho (2008). Private combinatorial group testing.
  48. Colin Collins (2002). A Genomics Approach to Tumor Gemome Analysis.
  49. Ivan Damgård,Matthias Fitzi,Eike Kiltz,Jesper Nielsen,Tomas Toft (2007). Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation.
  50. Zhiqiang Yang,Sheng Zhong,Rebecca Wright (2007). Towards Privacy Preserving Model Selection" Preproceedings version.
  51. Rakesh Agrawal,Ramakrishnan Srikant (2000). Privacy-preserving data mining.
  52. J Prins,Z Erkin,R Lagendijk (2007). Anonymous Fingerprinting with Robust QIM Watermarking Techniques.
  53. C Orlandi,A Piva,M Barni (2007). Oblivious Neural Network Computing via Homomorphic Encryption.
  54. Bart Goethals1,Sven Laur2,Helger Lipmaa2,Taneli Mielik¨ainen1 On Private Scalar Product Computation for Privacy-Preserving Data Mining.
  55. B Thomas,Erkay Pedersen,Yucel Savas,Saygin (2007). ENCRYPTION-BASED TECHNIQUES FOR PRIVACYPRESERVING DATA MINING" Joint UNECE/Eurostat work session on statistical data confidentiality.
  56. Mikhail Atallah,Florian Kerschbaum,Wenliang Du (2003). Secure and private sequence comparisons.
  57. R Rivest,L Adleman,M Dertouzos (1978). Preserving Confidential Data Using Improved Rivest-Shamir Adleman to Secure Multi-Cloud.
  58. Ernest Brickell,Yacov Yacobi (1988). On Privacy Homomorphisms (Extended Abstract).
  59. Abu Dr,Latiful Sayed Md,Gahangir Hoque,Hossain (2008). PIR WITH PCACHE: ANEWPRIVATE INFORMATION RETRIEVAL PROTOCOL WITH IMPROVED PERFORMANCE.
  60. Juan Ramón Troncoso-Pastoriza,Stefan Katzenbeisser,Mehmet Celik (2007). Privacy Preserving Error Resilient DNA Searching through Oblivious Automata.
  61. J Domingo-Ferrer (1996). A new privacy homomorphism and applications.
  62. Niv Ahituv,Yeheskel Lapid,Seev Neumann (1987). Processing encrypted data.
  63. C Ding,D Pei,A Salomaa (1996). Chinese remainder theorem.
  64. J Domingo-Ferrer,J Herrera-Joancomarti (1998). A privacy homomorphism allowing field operations on encrypted data.
  65. C Negus (2006). Linux Bible: Boot Up to Fedora, KNOPPIX, Debian.
  66. D Westhoff,J Girao,A Sarma (2006). Security Solutions for Wireless Sensor Networks.
  67. J Girao,D Westhoff,M Schneider (2005). CDA: concealed data aggregation for reverse multicast traffic in wireless sensor networks.
  68. D Integrity,P Sakarindr,N Ansari (2007). Security Services IN Group Communications OVER Wireless Infrastructure, Mobile Ad Hoc AND Wireless Sensor Networks.
  69. Westhoff Dirk,Girao Joao,Sarma Amardeo Security Solutions for Wireless Sensor Networks.
  70. I Blake,G Seroussi,N Smart (1999). Elliptic Curves in Cryptography.
  71. Alessandro Sorniotti,Laurent Gomez,Konrad Wrona,Lorenzo Odorico (2007). Secure and Trusted innetwork Data Processing in Wireless Sensor Networks: a Survey.
  72. Sheng Zhiqiang Yang1,Rebecca Zhong2 (2006). Privacy-Preserving Queries on Encrypted Data⋆.
  73. Mufutau Akinwande (2009). Advances in Homomorphic Cryptosystems.
  74. J Ucs Unknown Title.
  75. M Ilyas (2003). The Handbook of Ad Hoc Wireless Networks.
  76. Brett Hemenway,Rafail Ostrovsky (2012). On Homomorphic Encryption and Chosen-Ciphertext Security.
  77. Andrew Yao (1982). Protocols for secure computations.
  78. Shafi Goldwasser,Silvio Micali (1984). Probabilistic encryption.
  79. T (1985). A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms.
  80. P Paillier (1999). Public-key cryptosystems based on composite degree residuosity classes.
  81. C Fontaine,F Galand (2007). A survey of homomorphic encryption for nonspecialists.
  82. Daniele Micciancio,Oded Regev (2008). Lattice-based Cryptography.
  83. Craig Gentry (2009). Fully homomorphic encryption using ideal lattices.
  84. N Smart,F Vercauteren (2010). Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes.
  85. M Van Dijk,C Gentry,S Halevi,V Vaikuntanathan (2010). Fully homomorphic encryption over the integers.
  86. Group Theory (2012). Milne, 3rd Baron, (George Alexander Milne) (born 1 April 1941).
  87. Brett Hemenway,Rafail Ostrovsky (2012). On Homomorphic Encryption and Chosen-Ciphertext Security.
  88. Jibang Liu,Yung-Hsiang Lu,Cheng-Kok Koh,Craig Gentry Performance Analysis of Arithmetic Operations in Homomorphic Encryption.
  89. Liangliang Xiao,Osbert Bastani,I-Ling Yen An Efficient Homomorphic Encryption Protocol for Multi-User Systems.
Show All References
Download References

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Gorti VNKV Subba Rao. 2013. "An Efficient Secure Message Transmission in Mobile Ad Hoc Networks using Enhanced Homomorphic Encryption Scheme". Global Journal of Computer Science and Technology - E: Network, Web & Security GJCST-E Volume 13 (GJCST Volume 13 Issue E9).

More Citation Formats

Download Citation

  • Open Access
  • CC-BY-ND-NC 4.0
Download Article
Access OJS
Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Not Found
Classification
GJCST-E Classification E.3
  • Submission ReceivedDecember 10, 2012
  • Peer Review Double Blind
    Handling Editor
  • Accepted January 2, 2013
  • Published January 15, 2013
Version of record

v1.2

Issue date
June 29, 2013

Language
English
Order Article Reprint
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

View in VR
Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

View in 3D
Article Matrices
Total Views: 3.8K
Total Downloads: 216
All Trends

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

An Efficient Secure Message Transmission in Mobile Ad Hoc Networks using Enhanced Homomorphic Encryption Scheme

Gorti Rao
Gorti Rao Sree Dattha Institute of engineering and Science
  • Submission ReceivedDecember 10, 2012
  • Peer Review Double Blind
    Handling Editor
  • Accepted January 2, 2013
  • Published January 15, 2013