Handling expected polynomial-time strategies in simulation-based security proofs

DOI10.1007/S00145-007-9004-8MaRDI QIDQ1021232zbMATH OpenOpenAlexFDO

Authors Yehuda Lindell, Jonathan Katz

Publication date 8 June 2009

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.414.8339

zbMATH Keywords

secure multiparty computationzero-knowledgeblack-box simulationexpected polynomial-time

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Theory of Cryptography
• scientific article; zbMATH DE number 4191107
• On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits
• On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits
• Expected-time cryptography: generic techniques and applications to concrete soundness

Cites work

• scientific article; zbMATH DE number 4191106 (Why is no real title available?)
• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• scientific article; zbMATH DE number 4060392 (Why is no real title available?)
• A Pseudorandom Generator from any One-way Function
• Definitions and properties of zero-knowledge proof systems
• Foundations of Cryptography
• Foundations of Cryptography
• How to construct constant-round zero-knowledge proof systems for NP
• Parallel coin-tossing and constant-round secure two-party computation
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Resettable zero-knowledge (extended abstract)
• Security and composition of multiparty cryptographic protocols
• Strict Polynomial-Time in Simulation and Extraction
• The Knowledge Complexity of Interactive Proof Systems
• Universal Arguments and their Applications

Cited in

(9)

• Expected-time cryptography: generic techniques and applications to concrete soundness
• Rogue-instance security for batch knowledge proofs
• scientific article; zbMATH DE number 2009954 (Why is no real title available?)
• On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits
• Theory of Cryptography
• On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits
• How to simulate it -- a tutorial on the simulation proof technique
• scientific article; zbMATH DE number 4191107 (Why is no real title available?)
• On expected polynomial runtime in cryptography

This page was built for publication: Handling expected polynomial-time strategies in simulation-based security proofs

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