On expected polynomial runtime in cryptography

DOI10.1007/978-3-030-90459-3_19MaRDI QIDQ2695649zbMATH OpenOpenAlexFDO

Authors Michael Klooß

Publication date 31 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-90459-3_19

zbMATH Keywords

black-box zero-knowledgeuniform complexity

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Handling expected polynomial-time strategies in simulation-based security proofs
• 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

Cites work

• A note on constant-round zero-knowledge proofs of knowledge
• A uniform-complexity treatment of encryption and zero-knowledge
• Advances in Cryptology - CRYPTO 2003
• Average Case Complete Problems
• Average case complexity, revisited
• Concurrent and resettable zero-knowledge in poly-logarithmic rounds
• Concurrent zero knowledge, revisited
• From weak to strong zero-knowledge and applications
• Handling expected polynomial-time strategies in simulation-based security proofs
• How to construct constant-round zero-knowledge proof systems for NP
• scientific article; zbMATH DE number 5081744 (Why is no real title available?)
• Local zero knowledge
• Magic functions
• Notes on Levin's theory of average-case complexity
• On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits
• Polynomial runtime and composability
• Security and composition of multiparty cryptographic protocols
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Strict Polynomial-Time in Simulation and Extraction
• Theory of Cryptography

Cited in

(4)

• On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits
• scientific article; zbMATH DE number 4191107 (Why is no real title available?)
• On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits
• On the Cryptographic Complexity of the Worst Functions

This page was built for publication: On expected polynomial runtime in cryptography

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