Results 1 to 10 of about 95,474 (182)

Adaptive proofs of knowledge in the random oracle model [PDF]

open access: yesIET Information Security, 2016
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.
Bernhard, David   +2 more
core   +6 more sources

Delegating Quantum Computation in the Quantum Random Oracle Model [PDF]

open access: yes, 2020
A delegation scheme allows a computationally weak client to use a server's resources to help it evaluate a complex circuit without leaking any information about the input (other than its length) to the server.
A Broadbent   +17 more
core   +2 more sources

Binary Tree Based Forward Secure Signature Scheme in the Random Oracle Model [PDF]

open access: yesInternational 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   +1 more source

Indifferentiable hash functions in the standard model

open access: yesIET 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

Tightly Secure PKE Combiner in the Quantum Random Oracle Model

open access: yesCryptography, 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

The Random Oracle Methodology, Revisited [PDF]

open access: yes, 2000
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".
Canetti, Ran   +2 more
core   +7 more sources

Uselessness for an Oracle model with internal randomness [PDF]

open access: yesQuantum 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

RAFI: Robust Authentication Framework for IoT-Based RFID Infrastructure

open access: yesSensors, 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

Using intelligence techniques to automate Oracle testing [PDF]

open access: yesAl-Rafidain Journal of Computer Sciences and Mathematics, 2023
The software development life cycle includes software testing as a critical step. Oracle testing is necessary to determine if a particular test case detects an error because the purpose of testing is to ensure that the application adheres to its ...
Nour Sulaiman, safwan hasson
doaj   +1 more source

Quantum Depth in the Random Oracle Model

open access: yesProceedings 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}$.
Arora, Atul Singh   +5 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy