scientific article; zbMATH DE number 4191107

zbMATH Open0722.68046MaRDI QIDQ3210167FDOQ3210167

Authors: Adi Shamir, Uriel Feige 

Publication date: 1991

Title of this publication is not available (Why is that?)

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

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)

Cited In (9)

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

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)