47 search results - page 5 / 10 » On Constructing Homomorphic Encryption Schemes from Coding T... |
EUROCRYPT
2010
Springer
14 years 11 days ago
2010
Springer
Imagine many small devices send data to a single receiver, encrypted using the receiver’s public key. Assume an adversary that has the power to adaptively corrupt a subset of the...
EUROCRYPT
2001
Springer
14 years 1 days ago
2001
Springer
We formalize the notion of a cryptographic counter, which allows a group of participants to increment and decrement a cryptographic representation of a (hidden) numerical value pri...
PKC
2010
Springer
13 years 9 months ago
2010
Springer
ded abstract of this paper appears in 13th International Conference on Practice and Theory in Public Key Cryptography (PKC) 2010, Lecture Notes in Computer Science Vol. ?, P. Nguye...
NDSS
2008
IEEE
14 years 1 months ago
2008
IEEE
Traditionally, techniques for computing on encrypted data have been proposed with privacy preserving applications in mind. Several current cryptosystems support a homomorphic oper...
CCS
2010
ACM
13 years 7 months ago
2010
ACM
A communication channel from an honest sender A to an honest receiver B can be described as a system with three interfaces labeled A, B, and E (the adversary), respectively, where...