Results 241 to 250 of about 11,450 (279)
Succinct Arguments in the Quantum Random Oracle Model [PDF]
Succinct non-interactive arguments (SNARGs) are highly efficient certificates of membership in non-deterministic languages. Constructions of SNARGs in the random oracle model are widely believed to be post-quantum secure, provided the oracle is ...
Alessandro Chiesa +2 more
exaly +2 more sources
Secure Identity-Based Encryption in the Quantum Random Oracle Model [PDF]
We give the first proof of security for an identity-based encryption scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model that requires no additional assumptions. Our techniques are quite general and
Mark Zhandry
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Average dependence and random oracles
[1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 2003A reconstruction of the foundations of complexity theory relative to random oracles is begun. The goals are to identify the simple, core mathematical principles behind randomness; to use these principles to push hard on the current boundaries of randomness; and to eventually apply these principles in unrelativized complexity.
Stuart A. Kurtz +2 more
openaire +1 more source
Information Processing Letters, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
The random oracle model: a twenty-year retrospective [PDF]
It has been roughly two decades since the random oracle model for security reductions was introduced and one decade since we first discussed the controversy that had arisen concerning its use. In this retrospective we argue that there is no evidence that
Neal Koblitz +2 more
exaly +1 more source
Security of Encryption Schemes in Weakened Random Oracle Models [PDF]
Liskov proposed several weakened versions of the random oracle model, called {\em weakened random oracle models} (WROMs), to capture the vulnerability of ideal compression functions, which are expected to have the standard security of hash functions, i.e.
Akinori Kawachi +2 more
exaly +2 more sources
A Note on the Random Oracle Methodology
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2008Canetti et al. [5] showed that there exist signature and encryption schemes that are secure in the random oracle (RO) model, but for which any implementation of the RO (by a single function or a function ensemble) results in insecure schemes.
Mototsugu Nishioka, Naohisa Komatsu
openaire +1 more source
2021
Random oracles are a very powerful tool. As we have seen, they simultaneously give rise to one-way functions, collision-resistant hash functions, pseudorandom generators, symmetric encryption schemes, and more.
Arno Mittelbach, Marc Fischlin
openaire +1 more source
Random oracles are a very powerful tool. As we have seen, they simultaneously give rise to one-way functions, collision-resistant hash functions, pseudorandom generators, symmetric encryption schemes, and more.
Arno Mittelbach, Marc Fischlin
openaire +1 more source
Random Oracles and Non-uniformity
2018We revisit security proofs for various cryptographic primitives in the auxiliary-input random-oracle model (AI-ROM), in which an attacker \(\mathcal A\) can compute arbitrary S bits of leakage about the random oracle \(\mathcal O\) before attacking the system and then use additional T oracle queries to \(\mathcal O\) during the attack.
Sandro Coretti +3 more
openaire +2 more sources
Signcryption with Quantum Random Oracles
2018Signcryption is a cryptographic scheme that achieves the functionalities of both public-key encryption and digital signatures. It is an important scheme for realizing a mechanism of sending and/or receiving messages in a secure way, since it is understood that signcryption is a public-key based protocol to realize a secure channel from an insecure ...
Shingo Sato, Junji Shikata
openaire +1 more source

