Results 11 to 20 of about 9,626 (278)
How Risky Is the Random-Oracle Model? [PDF]
Lecture Notes in Computer Science, 2009 RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instantiations proposed in the literature for such cases are weaker than a random oracle, including the proposals by Bellare and Rogaway from 1993 and 1996, and the ones implicit in ...
Gaëtan Leurent +2 more
exaly +5 more sources
The random oracle model: a twenty-year retrospective [PDF]
Designs, Codes, and Cryptography, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Neal Koblitz +2 more
exaly +6 more sources
Non Observability in the Random Oracle Model [PDF]
, 2013 Security proofs in the Random Oracle Model (ROM) often make use of the fact that the queries made by the adversary to the oracle are observable as well as the responses to those queries can be programmed. While, the issue of programmability of query responses has received attention in the literature, to the best of our knowledge, observability of the ...
Prabhanjan Ananth, Raghav Bhaskar
openaire +5 more sources
Quantum Random Oracle Model for Quantum Public-Key Encryption
IEEE Access, 2019 Random oracle model is a general security analysis tool for rigorous security proof and effective cryptographic protocol design. In the quantum world, the attempts of constructing a quantum random oracle (QRO) have been made, such as quantum-accessible ...
Tao Shang, Ranyiliu Chen, Qi Lei
doaj +3 more sources
Quantum Depth in the Random Oracle Model [PDF]
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023 We give a comprehensive characterization of the computational power of shallow quantum circuits combined with classical computation. Specifically, for classes of search problems, we show that the following statements hold, relative to a random oracle: (a) $\mathsf{BPP}^{\mathsf{QNC}^{\mathsf{BPP}}} \neq \mathsf{BQP}$.
Atul Singh Arora +5 more
openaire +4 more sources
Adaptive Proofs of Knowledge in the Random Oracle Model [PDF]
Lecture Notes in Computer Science, 2015 The authors define a notion of adaptive proofs of knowledge (PoKs) in the random oracle model (ROM). These are proofs where the malicious prover can adaptively issue multiple statements and proofs, and where the extractor is supposed to extract a witness for each statement.
Bogdan Warinschi +2 more
exaly +7 more sources
Online-Extractability in the Quantum Random-Oracle Model [PDF]
, 2022 We show the following generic result. Whenever a quantum query algorithm in the quantum random-oracle model outputs a classical value $t$ that is promised to be in some tight relation with $H(x)$ for some $x$, then $x$ can be efficiently extracted with almost certainty.
J.W. Don (Jelle) +3 more
core +10 more sources
Zero Knowledge in the Random Oracle Model, Revisited [PDF]
Lecture Notes in Computer Science, 2009 We revisit previous formulations of zero knowledge in the random oracle model due to Bellare and Rogaway (CCS '93) and Pass (Crypto '03), and present a hierarchy for zero knowledge that includes both of these formulations. The hierarchy relates to the programmability of the random oracle, previously studied by Nielsen (Crypto '02).
Wee Hoeteck
exaly +2 more sources
On Deniability in the Common Reference String and Random Oracle Model [PDF]
Lecture Notes in Computer Science, 2003 We revisit the definitions of zero-knowledge in the Common Reference String (CRS) model and the Random Oracle (RO) model. We argue that even though these definitions syntactically mimic the standard zero-knowledge definition, they loose some of its spirit. In particular, we show that there exist a specific natural security property that is not captured
Rafael Pass, Pass Rafael
exaly +2 more sources
Special Soundness in the Random Oracle Model [PDF]
IACR Communications in CryptologyWe generalize the optimal knowledge extractor for constant-round special sound protocols presented by Wikström (2018) to a knowledge extractor for the corresponding non-interactive Fiat-Shamir proofs in the random oracle model and give an exact analysis of the extraction error and running time.
Douglas Wikström
openaire +4 more sources