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

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

Cites work

scientific article; zbMATH DE number 1775426 (Why is no real title available?)
Average Case Complete Problems
Definitions and properties of zero-knowledge proof systems
Foundations of Cryptography
Foundations of Cryptography
General composition and universal composability in secure multiparty computation
Handling expected polynomial-time strategies in simulation-based security proofs
How to construct constant-round zero-knowledge proof systems for NP
Local zero knowledge
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
Session-key generation using human passwords only
Strict polynomial-time in simulation and extraction
The Knowledge Complexity of Interactive Proof Systems
Universal Arguments and their Applications

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)