TCC
2016
Springer
8 years 17 days ago
2016
Springer
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...
TCC
2016
Springer
8 years 17 days ago
2016
Springer
TCC
2016
Springer
8 years 17 days ago
2016
Springer
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 ...
TCC
2016
Springer
8 years 17 days ago
2016
Springer
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 ...