Sciweavers

TCC
2016
Springer
50views Cryptology» more  TCC 2016»
8 years 8 months ago
Rational Sumchecks
Rational proofs, introduced by Azar and Micali (STOC 2012) are a variant of interactive proofs in which the prover is neither honest nor malicious, but rather rational. The advanta...
Siyao Guo, Pavel Hubácek, Alon Rosen, Marga...
TCC
2016
Springer
46views Cryptology» more  TCC 2016»
8 years 8 months ago
Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits
A Probabilistically Checkable Proof (PCP) allows a randomized verifier, with oracle access to a purported proof, to probabilistically verify an input statement of the form “x ...
Yuval Ishai, Mor Weiss, Guang Yang
TCC
2016
Springer
61views Cryptology» more  TCC 2016»
8 years 8 months ago
Homomorphic Evaluation Requires Depth
We show that homomorphic evaluation of any non-trivial functionality of sufficiently many inputs with respect to any CPA secure homomorphic encryption scheme cannot be implemented ...
Andrej Bogdanov, Chin Ho Lee