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 with critical applications in security e-commerce. Existing ZKPs are iterative in nature; their protocols require multiple...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Published: |
2005
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/10718/1/ZKP1R_CEC_05_kfupm.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 with critical applications in security e-commerce. Existing ZKPs are iterative in nature; their protocols require multiple communication rounds. The cost of iteration makes ZKPs unsuitable in practice. We propose a new protocol that meets all the requirements of ZKPs, yet runs in one round. The new approach substantially reduces computation and communications costs. It makes ZKPs more suitable for practical cryptographic systems for both govern-ment and commercial applications. |
|---|