Sciweavers

152 search results - page 4 / 31
» Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use
Sort
View
WECWIS
2005
IEEE
116views ECommerce» more  WECWIS 2005»
14 years 1 months ago
Security and Privacy Using One-Round Zero-Knowledge Proofs
A zero-knowledge proof (ZKP) is an interactive proof that allows a prover to prove the knowledge of a secret to a verifier without revealing it. ZKPs are powerful tools to deal wi...
Sultan Almuhammadi, Clifford Neuman
ASIACRYPT
2010
Springer
13 years 5 months ago
Short Non-interactive Zero-Knowledge Proofs
We show that probabilistically checkable proofs can be used to shorten non-interactive zero-knowledge proofs. We obtain publicly verifiable non-interactive zero-knowledge proofs fo...
Jens Groth
FOCS
2003
IEEE
14 years 21 days ago
Lower Bounds for Non-Black-Box Zero Knowledge
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
Boaz Barak, Yehuda Lindell, Salil P. Vadhan
FOCS
1999
IEEE
13 years 11 months ago
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...
Amit Sahai
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...