On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \) (Q2120065): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-84242-0_2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3187260388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power from Random Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On basing one-way functions on NP-hardness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptography in $NC^0$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Basing Size-Verifiable One-Way Functions on NP-Hardness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativized cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Worst‐Case to Average‐Case Reductions for NP Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3413362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Cryptographic Applications of Random Functions (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Existence of Pseudorandom Generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4712666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pseudorandom Generator from any One-way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the notion of infinite pseudorandom sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three approaches to the quantitative definition of information<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: BPP and the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tale of one-way functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit commitment using pseudorandomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness vs randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal theory of inductive inference. Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness and average-case complexity via uniform reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS / rank
 
Normal rank

Latest revision as of 13:08, 28 July 2024

scientific article
Language Label Description Also known as
English
On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \)
scientific article

    Statements

    On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \) (English)
    0 references
    0 references
    0 references
    31 March 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    Kolmogorov complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references