Sciweavers

146 search results - page 4 / 30
» Homomorphic encryption from codes
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
An Efficient Privacy-Preserving Scheme against Traffic Analysis Attacks in Network Coding
— Privacy threat is one of the critical issues in network coding, where attacks such as traffic analysis can be easily launched by a malicious adversary once enough encoded packe...
Yanfei Fan, Yixin Jiang, Haojin Zhu, Xuemin Shen
EUROCRYPT
2012
Springer
11 years 10 months ago
Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
We describe a compression technique that reduces the public key size of van Dijk, Gentry, Halevi and Vaikuntanathan’s (DGHV) fully homomorphic scheme over the integers from ˜O(...
Jean-Sébastien Coron, David Naccache, Mehdi...
ICMCS
2007
IEEE
164views Multimedia» more  ICMCS 2007»
14 years 1 months ago
Constructing Secure Content-Dependent Watermarking Scheme using Homomorphic Encryption
Content-dependent watermarking (CDWM) has been proposed as a solution to overcome the potential estimation attack aiming to recover and remove the watermark from the host signal. ...
Zhi Li, Xinglei Zhu, Yong Lian, Qibin Sun
EUROCRYPT
2000
Springer
13 years 11 months ago
Efficient Receipt-Free Voting Based on Homomorphic Encryption
Voting schemes that provide receipt-freeness prevent voters from proving their cast vote, and hence thwart vote-buying and coercion. We analyze the security of the multi-authority ...
Martin Hirt, Kazue Sako
PKC
2012
Springer
255views Cryptology» more  PKC 2012»
11 years 10 months ago
Better Bootstrapping in Fully Homomorphic Encryption
Gentry’s bootstrapping technique is currently the only known method of obtaining a “pure” fully homomorphic encryption (FHE) schemes, and it may offers performance advantage...
Craig Gentry, Shai Halevi, Nigel P. Smart