Results 21 to 30 of about 9,626 (278)
Pseudorandomness in the (Inverseless) Haar Random Oracle Model [PDF]
We study the (in)feasibility of quantum pseudorandom notions in a quantum analog of the random oracle model, where all the parties, including the adversary, have oracle access to the same Haar random unitary. In this model, we show the following: - (Unbounded-query secure) pseudorandom unitaries (PRU) exist.
Prabhanjan Ananth +3 more
openaire +5 more sources
A Machine-Checked Formalization of the Generic Model and the Random Oracle Model [PDF]
, 2004 Most approaches to the formal analyses of cryptographic protocols make the perfect cryptography assumption, i.e. the hypothese that there is no way to obtain knowledge about the plaintext pertaining to a ciphertext without knowing the key. Ideally, one would prefer to rely on a weaker hypothesis on the computational cost of gaining information about ...
Gilles Barthe +2 more
openaire +4 more sources
Uselessness for an Oracle model with internal randomness [PDF]
Quantum Information and Computation, 2014 We consider a generalization of the standard oracle model in which the oracle acts on the target with a permutation selected according to internal random coins. We describe several problems that are impossible to solve classically but can be solved by a quantum algorithm using a single query; we show that such infinity-vs-one separations between ...
Harrow, Aram W., Rosenbaum, David J.
openaire +4 more sources
Tightly Secure PKE Combiner in the Quantum Random Oracle Model
Cryptography, 2022 The development of increasingly sophisticated quantum computers poses a long-term threat to current cryptographic infrastructure. This has spurred research into both quantum-resistant algorithms and how to safely transition real-world implementations and
Brian Goncalves, Atefeh Mashatan
doaj +1 more source
Tightly Secure Lattice Identity-Based Signature in the Quantum Random Oracle Model [PDF]
, 2023 We present a quantumly secure identity-based signature scheme based on the standard short integer solution problem, featuring tight security reductions in the quantum and classic random oracle models. The scheme has short signatures.
Li, Qinyi, Foo, Ernest
core +1 more source
Indifferentiable hash functions in the standard model
IET Information Security, 2021 Indifferentiability of iterated hash functions is seen as evidence that there are no structural flaws in the iteration structure of the algorithm. However, it is often overlooked that such considerations only hold in the random oracle model and do not ...
Juha Partala
doaj +1 more source
A Random Oracle for All of Us [PDF]
, 2022 We introduce the notion of a universal random oracle. Analogously to a classical random oracle it idealizes hash functions as random functions. However, as opposed to a classical random oracle which is created freshly and independently for each adversary,
Schmalz, Tobias +5 more
core +1 more source
RAFI: Robust Authentication Framework for IoT-Based RFID Infrastructure
Sensors, 2022 The Internet of Things (IoT) is a future trend that uses the Internet to connect a variety of physical things with the cyber world. IoT technology is rapidly evolving, and it will soon have a significant impact on our daily lives.
Vikas Kumar +5 more
doaj +1 more source
A New Identification Scheme based on Syndrome Decoding Problem with Provable Security against Quantum Adversaries [PDF]
Journal of Universal Computer Science, 2019 Recently, in order to guarantee security against quantum adversaries, several identification (ID) schemes based on computational problems which are supposed to be hard even for quantum computers have been proposed. However, their security are only proven
Bagus Santoso, Chunhua Su
doaj +3 more sources
Sequential Hashing with Minimum Padding
Cryptography, 2018 This article presents a sequential domain extension scheme with minimum padding for hashing using a compression function. The proposed domain extension scheme is free from the length extension property.
Shoichi Hirose
doaj +1 more source