111 search results - page 5 / 23 » Errors in Computational Complexity Proofs for Protocols |
CRYPTO
1995
Springer
15 years 3 months ago
1995
Springer
Abstract. In this paper we present an eficient protocol for “Committed Oblivious Transfer” to perform oblivious transfer on committed bits: suppose Alice is committed to bits 0...
CCR
2000
14 years 11 months ago
2000
We propose a zero-knowledge interactive proof based identification and signature scheme. The protocol is based on Euler's totient function and discrete logarithms over the ri...
88
Voted
QCQC
1998
Springer
15 years 3 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
104
click to vote
STOC
2006
ACM
15 years 11 months ago
2006
ACM
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
TCC
2009
Springer
16 years 2 days ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...