An Encrypted Trust-Based Routing Protocol
TL;DR: A novel trust-based routing protocol based on a fully homomorphic encryption scheme that allows nodes, which collaborate in a dynamic environment, to evaluate their knowledge on the trustworthiness of specific routes and securely share this knowledge.
read more
Abstract: The interest in trust-based routing protocols has grown with the advancements achieved in ad-hoc wireless networks.However, regardless of the many security approaches and trust metrics available, trust-based routing still faces some security challenges, especially with respect to privacy. In this paper, we propose a novel trust-based routing protocol based on a fully homomorphic encryption scheme. The new protocol allows nodes, which collaborate in a dynamic environment, to evaluate their knowledge on the trustworthiness of specific routes and securely share this knowledge.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Homomorphic Data Isolation for Hardware Trojan Protection
M. Tarek Ibn Ziad,Amr Alanwar,Yousra Alkabani,M. Watheq El-Kharashi,Hassan Bedour +4 more
- 08 Jul 2015
TL;DR: This work implements two partial homomorphic designs based on El Gamal encryption/decryption scheme, and introduces a dual-circuit design that combines the two earlier designs using resource sharing in order to have minimum area cost.
8
Trust Based Secure AOMDV with Homomorphic Encryption for Multi Path Mobile ADHOC Network
TL;DR: Simulation results show the improvement of packet delivery ratio and network throughput, and decrement in network packet loss and delay in the presence of black hole nodes and sybil nodes in the proposed method.
References
A public key cryptosystem and a signature scheme based on discrete logarithms
Taher Elgamal
- 23 Aug 1985
TL;DR: A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem that relies on the difficulty of computing discrete logarithms over finite fields.
Public-key cryptosystems based on composite degree residuosity classes
Pascal Paillier
- 02 May 1999
TL;DR: A new trapdoor mechanism is proposed and three encryption schemes are derived : a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA, which are provably secure under appropriate assumptions in the standard model.
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
Taher Elgamal
- 19 Aug 1984
TL;DR: In this article, a new signature scheme is proposed together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem and the security of both systems relies on the difficulty of computing discrete logarithms over finite fields.
Protocols for secure computations
Yao
- 01 Jan 1982
TL;DR: The author gives a precise formulation of this general problem and describes three ways of solving it by use of one-way functions, which have applications to secret voting, private querying of database, oblivious negotiation, playing mental poker, etc.
3.9K
A fully homomorphic encryption scheme
Dan Boneh,Craig Gentry +1 more
- 01 Jan 2009
TL;DR: This work designs a somewhat homomorphic "boostrappable" encryption scheme that works when the function f is the scheme's own decryption function, and shows how, through recursive self-embedding, bootstrappable encryption gives fully homomorphic encryption.
3K
Related Papers (5)
Fei Song,Baohua Zhao +1 more
- 13 Dec 2008
Min-Hua Shao,Shin-Jia Huang +1 more
- 01 Dec 2008
Terence Chen,Olivier Mehani,Roksana Boreli +2 more
- 01 Oct 2009