-
Article
How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction
This paper provides the first provably secure construction of an invertible random permutation (and of an ideal cipher) from a public random function that can be evaluated by all parties in the system, including ...
-
Chapter and Conference Paper
A Protocol for Generating Random Elements with Their Probabilities
We give an AM protocol that allows the verifier to sample elements x from a probability distribution P, which is held by the prover. If the prover is honest, the verifier outputs (x,P(x)) with probability close t...
-
Chapter and Conference Paper
A New View on Worst-Case to Average-Case Reductions for NP Problems
We study the result by Bogdanov and Trevisan (FOCS, 2003), who show that under reasonable assumptions, there is no non-adaptive reduction that bases the average-case hardness of an NP-problem on the worst-case co...
-
Chapter and Conference Paper
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
While general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model, there are SFE protocols (Goldreich et al. [STO...
