Sciweavers

93 search results - page 5 / 19
» Unifying Zero-Knowledge Proofs of Knowledge
Sort
View
PKC
2009
Springer
129views Cryptology» more  PKC 2009»
14 years 5 days ago
Zero-Knowledge Proofs with Witness Elimination
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...
Aggelos Kiayias, Hong-Sheng Zhou
COCO
1991
Springer
130views Algorithms» more  COCO 1991»
13 years 11 months ago
One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs
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 ...
Rafail Ostrovsky
TCC
2010
Springer
141views Cryptology» more  TCC 2010»
13 years 5 months ago
Composition of Zero-Knowledge Proofs with Efficient Provers
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)...
Eleanor Birrell, Salil P. Vadhan
USS
2010
13 years 5 months ago
ZKPDL: A Language-Based System for Efficient Zero-Knowledge Proofs and Electronic Cash
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...
Sarah Meiklejohn, C. Christopher Erway, Alptekin K...
LATINCRYPT
2010
13 years 6 months ago
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
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...
S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yer...