scientific article; zbMATH DE number 4191107

MaRDI QIDQ3210167zbMATHFDO

Authors Adi Shamir, Uriel Feige

Publication date 1991

zbMATH Keywords

zero knowledge protocols

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Handling expected polynomial-time strategies in simulation-based security proofs
• Theory of Cryptography
• On expected polynomial runtime in cryptography
• Precise time and space simulatable zero-knowledge
• scientific article; zbMATH DE number 2009954

Cited in

(9)

• A new framework for the design and analysis of identity-based identification schemes
• How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
• Polynomial-Space Approximation of No-Signaling Provers
• Theory of Cryptography
• Handling expected polynomial-time strategies in simulation-based security proofs
• Complexity bounds for zero-test algorithms
• On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits
• On expected polynomial runtime in cryptography
• scientific article; zbMATH DE number 2009954 (Why is no real title available?)

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 Q3210167)