CRYPTO
2010
Springer
13 years 1 months ago
2010
Springer
We present a general method to compile any cryptographic algorithm into one which resists side channel attacks of the only computation leaks information variety for an unbounded nu...
CRYPTO
2010
Springer
13 years 1 months ago
2010
Springer
We show that the widely deployed RSA-OAEP encryption scheme of Bellare and Rogaway (Eurocrypt 1994), which combines RSA with two rounds of an underlying Feistel network whose hash...
CRYPTO
2010
Springer
13 years 4 months ago
2010
Springer
Coin-tossing protocols are protocols that generate a random bit with uniform distribution. These protocols are used as a building block in many cryptographic protocols. Cleve [STOC...
CRYPTO
2010
Springer
13 years 4 months ago
2010
Springer
The Virtual Black Box (VBB) property for program obfuscators provides a strong guarantee: Anything computable by an efficient adversary given the obfuscated program can also be co...
CRYPTO
2010
Springer
13 years 5 months ago
2010
Springer
CRYPTO
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We provide the first construction of a hash function into ordinary elliptic curves that is indifferentiable from a random oracle, based on Icart's deterministic enco...
CRYPTO
2010
Springer
13 years 5 months ago
2010
Springer
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
CRYPTO
2010
Springer
13 years 5 months ago
2010
Springer
The search for encryption schemes that allow to evaluate functions (or circuits) over encrypted data has attracted a lot of attention since the seminal work on this subject by Rive...
CRYPTO
2010
Springer
13 years 5 months ago
2010
Springer
The main results of this work are new public-key encryption schemes that, under the quadratic residuosity (QR) assumption (or Paillier's decisional composite residuosity (DCR...
CRYPTO
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Let pk = (N , e) be an RSA public key with corresponding secret key sk = (p, q, d, dp, dq , q-1 p ). Assume that we obtain partial error-free information of sk, e.g., ass...