Composition of Zero-Knowledge Proofs with Efficient Provers

15 years 19 days ago

Download eprint.iacr.org

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). Our results are:

Eleanor Birrell, Salil P. Vadhan

Real-time Traffic

Appropriate Auxiliary Input | Cryptology | Honest Prover Strategy | TCC 2010 | Zero-knowledge Proofs |

claim paper

Related Content

» Zero knowledge with efficient provers

» On the Concurrent Composition of ZeroKnowledge Proofs

» On the Composition of PublicCoin ZeroKnowledge Protocols

» ZKPDL A LanguageBased System for Efficient ZeroKnowledge Proofs and Electronic Cash

» Noninteractive Statistical ZeroKnowledge Proofs for Lattice Problems

» Interactive Locking ZeroKnowledge PCPs and Unconditional Cryptography

» A Complete Problem for Statistical Zero Knowledge

» A strategy for efficiently verifying requirements

» The Composite Discrete Logarithm and Secure Authentication

Post Info
More Details (n/a)

Added	15 Feb 2011
Updated	15 Feb 2011
Type	Journal
Year	2010
Where	TCC
Authors	Eleanor Birrell, Salil P. Vadhan

Comments (0)

Sciweavers

Composition of Zero-Knowledge Proofs with Efficient Provers

Appropriate Auxiliary Input | Cryptology | Honest Prover Strategy | TCC 2010 | Zero-knowledge Proofs |

Explore & Download

Productivity Tools

Sciweavers