scientific article; zbMATH DE number 1256783

MaRDI QIDQ4228520zbMATH OpenFDO

Authors Donald Beaver

Publication date 25 May 2000

zbMATH Keywords

polynomial hierarchyzero knowledge proof systems

Mathematics Subject Classification ID

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

Recommendations

• Constant-round adaptive zero-knowledge proofs for NP
• Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
• Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Definitions and properties of zero-knowledge proof systems

Cited in

(9)

• Efficient adaptively secure zero-knowledge from garbled circuits
• An improvement of multi-exponentiation with encrypted bases argument: smaller and faster
• Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
• A Dolev-Yao model for zero knowledge
• Equivocal Blind Signatures and Adaptive UC-Security
• Doubly adaptive zero-knowledge proofs
• Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
• Constant-round adaptive zero-knowledge proofs for NP
• Non-interactive and non-malleable commitment scheme based on q-one way group homomorphisms

This page was built for publication:

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