Sciweavers

2601 search results - page 329 / 521
» Secure Rewarding Schemes
Sort
View
IACR
2011
132views more  IACR 2011»
14 years 4 months ago
Homomorphic encryption from codes
We propose a new homomorphic encryption scheme based on the hardness of decoding under independent random noise from certain affine families of codes. Unlike in previous latticeba...
Andrej Bogdanov, Chin Ho Lee
IACR
2011
80views more  IACR 2011»
14 years 4 months ago
History-Free Sequential Aggregate Signatures
Aggregation schemes allow to combine several cryptographic values like message authentication codes or signatures into a shorter value such that, despite compression, some notion o...
Marc Fischlin, Anja Lehmann, Dominique Schröd...
ICC
2011
IEEE
257views Communications» more  ICC 2011»
14 years 4 months ago
Increasing the Lifetime of Roadside Sensor Networks Using Edge-Betweenness Clustering
Abstract—Wireless Sensor Networks are proven highly successful in many areas, including military and security monitoring. In this paper, we propose a method to use the edge–bet...
Joakim Flathagen, Ovidiu Valentin Drugan, Paal E. ...
EUROCRYPT
2012
Springer
13 years 6 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...
VTS
2007
IEEE
105views Hardware» more  VTS 2007»
15 years 10 months ago
Effects of Embedded Decompression and Compaction Architectures on Side-Channel Attack Resistance
Attack resistance has been a critical concern for security-related applications. Various side-channel attacks can be launched to retrieve security information such as encryption k...
Chunsheng Liu, Yu Huang