๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Zero-Knowledge Sets With Short Proofs

โœ Scribed by Catalano, D.; Di Raimondo, M.; Fiore, D.; Messina, M.


Book ID
114642583
Publisher
IEEE
Year
2011
Tongue
English
Weight
536 KB
Volume
57
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Zero knowledge proofs
โœ Simon Collin ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science โš– 358 KB
Zero-knowledge proofs of retrievability
โœ Yan Zhu; HuaiXi Wang; ZeXing Hu; Gail-Joon Ahn; HongXin Hu ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Science in China Press (SCP) ๐ŸŒ English โš– 228 KB
Round-optimal perfect zero-knowledge pro
โœ Giovanni Di Crescenco; Giuseppe Persiano ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 948 KB
Zero-Knowledge Proofs from Secure Multip
โœ Ishai, Yuval; Kushilevitz, Eyal; Ostrovsky, Rafail; Sahai, Amit ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 391 KB
On Relationships between Statistical Zer
โœ Tatsuaki Okamoto ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 537 KB

This paper solves several fundamental open problems about statistical zero-knowledge interactive proofs (SZKIPs). The following two theorems are proven: v If language L has a statistical zero-knowledge interactive proof against an honest verifier, then L has a statistical zero-knowledge ``publiccoi