Direct zero knowledge proofs of computational power in five rounds

DOI10.1007/3-540-46416-6_8MaRDI QIDQ4037454zbMATH OpenOpenAlexFDO

Authors Tatsuaki Okamoto, David Chaum, Kazuo Ohta

Publication date 18 May 1993

Published in Advances in Cryptology — EUROCRYPT ’91 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46416-6_8

zbMATH Keywords

efficient protocolszero knowledge proofs of computational power

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• Zero-knowledge proofs of decision power: New protocols and optimal round- complexity
• How to construct constant-round zero-knowledge proof systems for NP
• Zero-knowledge proofs of computational power in the shared string model
• A note on constant-round zero-knowledge proofs of knowledge
• Zero knowledge with efficient provers

Cited in

(1)

• Zero-knowledge proofs of computational power in the shared string model

This page was built for publication: Direct zero knowledge proofs of computational power in five rounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037454)