How to Utilize the Randomness of Zero-Knowledge Proofs

DOI10.1007/3-540-38424-3_33MaRDI QIDQ4279596zbMATH OpenOpenAlexFDO

Authors Tatsuaki Okamoto, Kazuo Ohta

Publication date 7 March 1994

Published in Advances in Cryptology - CRYPTO '90. A conference on the theory and application of Cryptography, Univ. of California, Santa Barbara, USA, August 11--15, 1990. Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-38424-3_33

zbMATH Keywords

key distributionzero-knowledge proofsinteractive proof systems

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Zero-knowledge proofs of identity
• scientific article; zbMATH DE number 4191103
• Noninteractive Zero-Knowledge
• scientific article; zbMATH DE number 4053065

Cited in

(9)

• New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
• scientific article; zbMATH DE number 4191103 (Why is no real title available?)
• A note on the Dwork-Naor timed deniable authentication
• scientific article; zbMATH DE number 4211485 (Why is no real title available?)
• Steganography-free zero-knowledge
• Zero-knowledge arguments and public-key cryptography
• scientific article; zbMATH DE number 1424187 (Why is no real title available?)
• On zero-knowledge proofs (extended abstract)
• Several practical protocols for authentication and key exchange

This page was built for publication: How to Utilize the Randomness of Zero-Knowledge Proofs

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