On the efficiency of generic, quantum cryptographic constructions
From MaRDI portal
Cites work
- Advances in cryptology -- ASIACRYPT 2020. 26th international conference on the theory and application of cryptology and information security, Daejeon, South Korea, December 7--11, 2020. Proceedings. Part I
- Advances in cryptology -- ASIACRYPT 2021. 27th international conference on the theory and application of cryptology and information security, Singapore, December 6--10, 2021. Proceedings. Part I
- Average-Case Complexity
- Black-box separations for non-interactive classical commitments in a quantum world
- Bounds on the Efficiency of Generic Cryptographic Constructions
- Constructing a pseudorandom generator requires an almost linear number of calls
- Cryptography from pseudorandom quantum states
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- How to construct quantum random functions
- scientific article; zbMATH DE number 1306886 (Why is no real title available?)
- scientific article; zbMATH DE number 1759776 (Why is no real title available?)
- scientific article; zbMATH DE number 2086396 (Why is no real title available?)
- scientific article; zbMATH DE number 7759460 (Why is no real title available?)
- scientific article; zbMATH DE number 7701522 (Why is no real title available?)
- Limits on the efficiency of one-way permutation-based hash functions
- Lower bounds on the efficiency of encryption and digital signature schemes
- Lower bounds on the efficiency of generic cryptographic constructions
- New hash functions and their use in authentication and set equality
- Non-uniformity and quantum advice in the quantum random oracle model
- Oblivious transfer is in MiniQCrypt
- On the impossibility of key agreements from quantum random oracles
- On the round complexity of secure quantum computation
- One-way functions imply secure computation in a quantum world
- Pseudorandom (function-Like) quantum state generators: new definitions and applications
- Pseudorandom quantum states
- Quantum cryptography in Algorithmica
- Quantum encryption with certified deletion
- Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication
- Quantum hardcore functions by complexity-theoretical quantum list decoding
- Quantum lower bounds by quantum arguments
- Quantum random oracle model with auxiliary input
- Secure identity-based encryption in the quantum random oracle model
- The acrobatics of BQP
- Theory of Cryptography
- Tight quantum time-space tradeoffs for function inversion
- Time space tradeoffs for attacks against one-way functions and PRGs
- Toward basing fully homomorphic encryption on worst-case hardness
This page was built for publication: On the efficiency of generic, quantum cryptographic constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7318554)
