2967 search results - page 289 / 594 » Cryptology |
170
click to vote
CRYPTO
2012
Springer
13 years 9 months ago
2012
Springer
We present a compiler that converts any circuit into one that remains secure even if a constant fraction of its wires are tampered with. Following the seminal work of Ishai et al. ...
208
click to vote
PKC
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. In the standard setting of broadcast encryption, information about the receivers is transmitted as part of the ciphertext. In several broadcast scenarios, however, the id...
207
click to vote
EUROCRYPT
2012
Springer
13 years 9 months ago
2012
Springer
We present a new approach for creating chosen ciphertext secure encryption. The focal point ork is a new abstraction that we call Detectable Chosen Ciphertext Security (DCCA). Int...
203
click to vote
EUROCRYPT
2012
Springer
13 years 9 months ago
2012
Springer
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
154
click to vote
EUROCRYPT
2009
Springer
16 years 7 months ago
2009
Springer
We show that a generic ring algorithm for breaking RSA in ZN can be converted into an algorithm for factoring the corresponding RSA-modulus N. Our results imply that any attempt at...