216
click to vote
TCC
14 years 1 months ago
2012 Springer 
We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the ...
208
click to vote
TCC
14 years 1 months ago
2012 Springer
In tandem with recent progress on computing on encrypted data via fully homomorphic encryption, we present a framework for computing on authenticated data via the notion of slight...
151
click to vote
TCC
14 years 1 months ago
2012 Springer
We show a hardness-preserving construction of a PRF from any length doubling PRG which improves upon known constructions whenever we can put a non-trivial upper bound q on the numb...
182
click to vote
TCC
14 years 1 months ago
2012 Springer
The hash-and-sign RSA signature is one of the most elegant and well known signatures schemes, extensively used in a wide variety of cryptographic applications. Unfortunately, the o...
166
click to vote
TCC
14 years 1 months ago
2012 Springer 
The (decisional) learning with errors problem (LWE) asks to distinguish “noisy” inner products of a secret vector with random vectors from uniform. In recent years, the LWE pro...
|
Cryptology