On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \)
From MaRDI portal
Publication:2120065
DOI10.1007/978-3-030-84242-0_2OpenAlexW3187260388MaRDI QIDQ2120065
Publication date: 31 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84242-0_2
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bit commitment using pseudorandomness
- BPP and the polynomial hierarchy
- Probabilistic encryption
- On the notion of infinite pseudorandom sequences
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Hardness vs randomness
- Pseudorandomness and average-case complexity via uniform reductions
- The tale of one-way functions
- On basing one-way functions on NP-hardness
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
- Relativized cryptography
- New directions in cryptography
- A Pseudorandom Generator from any One-way Function
- On the Existence of Pseudorandom Generators
- Foundations of Cryptography
- A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms
- On Basing Size-Verifiable One-Way Functions on NP-Hardness
- On the Computational Complexity of Algorithms
- Power from Random Strings
- Three approaches to the quantitative definition of information*
- On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- A formal theory of inductive inference. Part I
- Cryptography in $NC^0$
- On Worst‐Case to Average‐Case Reductions for NP Problems
This page was built for publication: On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \)
