Ronald Cramer, Victor Shoup

We present several new and fairly practical public-key encryption

schemes and prove them secure against

adaptive chosen ciphertext attack. One scheme is based on Paillier's

Decision Composite Residuosity (DCR) assumption,

while another is based in the classical Quadratic Residuosity (QR)

assumption. The analysis is in the standard ...
more >>>

Mohammad Mahmoody, Hemanta Maji, Manoj Prabhakaran

We qualitatively separate semi-honest secure computation of non-trivial secure-function evaluation (SFE) functionalities from existence of key-agreement protocols.

Technically, we show the existence of an oracle (namely, PKE-oracle) relative to which key-agreement protocols exist; but it is useless for semi-honest secure realization of symmetric 2-party (deterministic finite) SFE functionalities, i.e. any ...
more >>>

Benny Applebaum

Constant parallel-time cryptography allows to perform complex cryptographic tasks at an ultimate level of parallelism, namely, by local functions that each of their output bits depend on a constant number of input bits. A natural way to obtain local cryptographic constructions is to use \emph{random local functions} in which each ... more >>>