93 search results - page 5 / 19 » Unifying Zero-Knowledge Proofs of Knowledge |
117
click to vote
PKC
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction prov...
100
click to vote
COCO
1991
Springer
15 years 4 months ago
1991
Springer
Abstract Rafail Ostrovskyy MIT Laboratory for Computer Science 545 Technology Square, Cambridge, MA 02139 In this paper, we study connections among one-way functions, hard on the ...
114
click to vote
TCC
2010
Springer
14 years 11 months ago
2010
Springer
We revisit the composability of different forms of zero-knowledge proofs when the honest prover strategy is restricted to be polynomial time (given an appropriate auxiliary input)...
121
click to vote
USS
2010
14 years 11 months ago
2010
In recent years, many advances have been made in cryptography, as well as in the performance of communication networks and processors. As a result, many advanced cryptographic pro...
106
click to vote
LATINCRYPT
2010
14 years 11 months ago
2010
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...