On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits

DOI10.1007/S00145-009-9050-5zbMATH Open1196.94052OpenAlexW2054122047MaRDI QIDQ2267359FDOQ2267359

Authors: Oded Goldreich 

Publication date: 1 March 2010

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

Full work available at URL: https://doi.org/10.1007/s00145-009-9050-5

Recommendations

• On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits
• Theory of Cryptography
• Handling expected polynomial-time strategies in simulation-based security proofs
• On expected polynomial runtime in cryptography
• scientific article; zbMATH DE number 4191107

zbMATH Keywords

secure multi-party computationzero-knowledgeblack-box simulationprotocol compositionexpected probabilistic polynomial-timereset attacks

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• How to construct constant-round zero-knowledge proof systems for NP
• Security and composition of multiparty cryptographic protocols
• Resettable zero-knowledge (extended abstract)
• Universal Arguments and their Applications
• Foundations of Cryptography
• Title not available (Why is that?)
• Foundations of Cryptography
• Definitions and properties of zero-knowledge proof systems
• The Knowledge Complexity of Interactive Proof Systems
• Average Case Complete Problems
• Session-key generation using human passwords only
• Local zero knowledge
• General composition and universal composability in secure multiparty computation
• Strict polynomial-time in simulation and extraction
• Handling expected polynomial-time strategies in simulation-based security proofs

Cited In (6)

• Handling expected polynomial-time strategies in simulation-based security proofs
• 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
• On expected polynomial runtime in cryptography
• Strong proofs of knowledge

This page was built for publication: On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits

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