A combinatorial approach to quantum random functions
From MaRDI portal
Recommendations
Cites work
- Efficient pseudorandom functions via on-the-fly adaptation
- Expander graphs and their applications
- From independence to expansion and back again
- From non-adaptive to adaptive pseudorandom functions
- Hardness preserving constructions of pseudorandom functions
- Hardness preserving reductions via cuckoo hashing
- scientific article; zbMATH DE number 1261819 (Why is no real title available?)
- scientific article; zbMATH DE number 1030974 (Why is no real title available?)
- scientific article; zbMATH DE number 1559534 (Why is no real title available?)
- Key homomorphic PRFs and their applications
- On lattices, learning with errors, random linear codes, and cryptography
- On Universal Classes of Extremely Random Constant-Time Hash Functions
- Pseudo-random functions and factoring (extended abstract)
- Pseudorandom functions and lattices
- Pseudorandom quantum states
- Public Key Cryptography - PKC 2005
- Quantum-access-secure message authentication via blind-unforgeability
- Quantum-secure message authentication codes
- Secure identity-based encryption in the quantum random oracle model
- Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
Cited in
(7)- Scalable pseudorandom quantum states
- A compositional approach to quantum functions
- How to Construct Quantum Random Functions
- Pseudorandom (function-Like) quantum state generators: new definitions and applications
- Adaptive versus static multi-oracle algorithms, and quantum security of a split-key PRF
- On quantum secure compressing pseudorandom functions
- MicroCrypt assumptions with quantum input sampling and pseudodeterminism: constructions and separations
This page was built for publication: A combinatorial approach to quantum random functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2692397)