Back to Results
First PageMeta Content
Cryptographic protocols / Proof of knowledge / Interactive proof system / Zero-knowledge proof / IP / Soundness / Commitment scheme / NP / Non-interactive zero-knowledge proof / Theoretical computer science / Cryptography / Applied mathematics


A Note on Constant-Round Zero-Knowledge Proofs of Knowledge∗ Yehuda Lindell† September 24, 2012 Abstract In this note, we show the existence of constant-round computational zero-knowledge proofs of knowledge for all
Add to Reading List

Document Date: 2012-09-24 15:21:39

Open Document

File Size: 375,66 KB

Share Result on Facebook

Country

Israel / /

Currency

pence / /

/

Facility

Bar-Ilan University / /

IndustryTerm

zero-knowledge protocols / Σ-protocol / coin tossing protocol / simulatable coin-tossing protocol / basic protocols / constant-round coin-tossing protocol / zero-knowledge proof systems / semi-simulatable coin-tossing protocol / /

Organization

Bar-Ilan University / European Research Council / U.S. Securities and Exchange Commission / /

Position

extractor / Prime Minister / /

PublishedMedium

Journal of Cryptology / /

Technology

basic protocols / semi-simulatable coin-tossing protocol / The protocol / cryptography / five-round protocol / zero-knowledge protocols / simulatable coin-tossing protocol / Simulation / coin tossing protocol / 3-coloring protocol / constant-round coin-tossing protocol / /

SocialTag