Universal reductions: reductions relative to stateful oracles
From MaRDI portal
Publication:6169554
DOI10.1007/978-3-031-22368-6_6zbMATH Open1519.94079OpenAlexW4312622976MaRDI QIDQ6169554FDOQ6169554
Authors:
Publication date: 14 August 2023
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22368-6_6
Recommendations
Cites Work
- Title not available (Why is that?)
- A single quantum cannot be cloned
- Title not available (Why is that?)
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Bit commitment using pseudorandomness
- Formalizing human ignorance
- Universal Arguments and their Applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Knowledge Complexity of Interactive Proof Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Zaps and Their Applications
- Title not available (Why is that?)
- Possibility and impossibility results for selective decommitments
- Random oracles in a quantum world
- Indistinguishability Amplification
- Quantum proofs of knowledge
- Computationally binding quantum commitments
- Notions of black-box reductions, revisited
- Constructive cryptography -- a new paradigm for security definitions and proofs
- Theory of Cryptography
- Post-quantum zero knowledge in constant rounds
- Theory of Cryptography
- Constructive post-quantum reductions
- Universal reductions: reductions relative to stateful oracles
Cited In (2)
This page was built for publication: Universal reductions: reductions relative to stateful oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169554)
