122
Voted
TCC
2016
Springer
10 years 18 days ago
2016
Springer
We consider interactive proof systems over adversarial communication channels. We show that the seminal result that IP = PSPACE still holds when the communication channel is malic...
119
click to vote
TCC
2016
Springer
10 years 18 days ago
2016
Springer
We present a new constant round additively homomorphic commitment scheme with (amortized) computational and communication complexity linear in the size of the string committed to. ...
122
click to vote
TCC
2016
Springer
10 years 18 days ago
2016
Springer
We provide constructions of multilinear groups equipped with natural hard problems from indistinguishability obfuscation, homomorphic encryption, and NIZKs. This complements known...
102
click to vote
TCC
2016
Springer
10 years 18 days ago
2016
Springer
An order-revealing encryption scheme gives a public procedure by which two ciphertexts can be compared to reveal the ordering of their underlying plaintexts. We show how to use or...
111
Voted
TCC
2016
Springer
10 years 18 days ago
2016
Springer
124
click to vote
TCC
2016
Springer
10 years 18 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...
111
Voted
TCC
2016
Springer
10 years 18 days ago
2016
Springer
