Results 11 to 20 of about 4,491,165 (327)
The random oracle methodology, revisited [PDF]
Journal of the ACM, 2004 We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing the random oracle by so called "cryptographic hash functions".
Ran Canetti, Oded Goldreich, Shai Halevi
core +14 more sources
Making Existential-Unforgeable Signatures Strongly Unforgeable in the Quantum Random-Oracle Model [PDF]
IACR Cryptology ePrint Archive, 2015 Strongly unforgeable signature schemes provide a more stringent security guarantee than the standard existential unforgeability. It requires that not only forging a signature on a new message is hard, it is infeasible as well to produce a new signature ...
Edward Eaton, Fang Song
core +7 more sources
A New Short Signature Scheme with Random Oracle from Bilinear Pairings
Journal of Telecommunications and Information Technology, 2023 In this paper, we propose a new and efficient short signature scheme from the bilinear pairings. Our scheme is constructed by bilinear inverse-square Diffie-Hellman problem (BISDHP) and does not require any special hash function.
Sedat Akleylek +3 more
doaj +2 more sources
An oracle approach for interaction neighborhood estimation in random fields [PDF]
, 2011 We consider the problem of interaction neighborhood estimation from the partial observation of a finite number of realizations of a random field.
Matthieu Lerasle, Daniel Y. Takahashi
openalex +5 more sources
Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [PDF]
Quantum, 2020 Copy-protection allows a software distributor to encode a program in such a way that it can be evaluated on any input, yet it cannot be "pirated" – a notion that is impossible to achieve in a classical setting.
Andrea Coladangelo +2 more
doaj +2 more sources
Binary Tree Based Forward Secure Signature Scheme in the Random Oracle Model [PDF]
International Journal of Electronics and Telecommunications, 2021 In this paper we construct and consider a new group-based digital signature scheme with evolving secret key, which is built using a bilinear map. This map is an asymmetric pairing of Type 3, and although, for the reason of this paper, it is treated in a ...
Mariusz Jurkiewicz
doaj +3 more sources
On Pseudo-Random Oracles [PDF]
Tatra Mountains Mathematical Publications, 2012 ABSTRACT Many cryptographic systems which involve hash functions have proof of their security in a so called random oracle model. Behavior of hash functions used in such cryptographic systems should be as close as possible to the behavior of a random function. There are several properties of hash functions dealing with a random behavior.
Michal Rjaško
openalex +3 more sources
Quantum Depth in the Random Oracle Model [PDF]
Symposium on the Theory of Computing, 2022 We give a comprehensive characterisation 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)
A. S. Arora +5 more
semanticscholar +1 more source
Non-uniformity and Quantum Advice in the Quantum Random Oracle Model [PDF]
International Conference on the Theory and Application of Cryptographic Techniques, 2022 QROM (quantum random oracle model), introduced by Boneh et al. (Asiacrypt 2011), captures all generic algorithms. However, it fails to describe non-uniform quantum algorithms with preprocessing power, which receives a piece of bounded classical or ...
Qipeng Liu
semanticscholar +1 more source
Random oracles in constantipole [PDF]
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing, 2000 Byzantine agreement requires a set of parties in a distributed system to agree on a value even if some parties are corrupted. A new protocol for Byzantine agreement in a completely asynchronous network is presented that makes use of cryptography, specifically of threshold signatures and coin-tossing protocols.
Christian Cachin +2 more
openalex +2 more sources