Results 21 to 30 of about 90,649 (207)

Random Oracle Model [PDF]

open access: bronzeJournal of Software, 2012
Xiaoying Jia, Bao Li, Yamin Liu
openalex   +3 more sources

Time-Lock Puzzles in the Random Oracle Model [PDF]

open access: bronze, 2011
A time-lock puzzle is a mechanism for sending messages "to the future". The sender publishes a puzzle whose solution is the message to be sent, thus hiding it until enough time has elapsed for the puzzle to be solved. For time-lock puzzles to be useful, generating a puzzle should take less time than solving it. Since adversaries may have access to many
Mohammad Mahmoody   +2 more
openalex   +3 more sources

On the Relation Between the Ideal Cipher and the Random Oracle Models [PDF]

open access: bronze, 2006
The Random Oracle Model and the Ideal Cipher Model are two of the most popular idealized models in cryptography. It is a fundamentally important practical and theoretical problem to compare the relative strengths of these models and to see how they relate to each other. Recently, Coron et al. [8] proved that one can securely instantiate a random oracle
Yevgeniy Dodis, Prashant Puniya
openalex   +3 more sources

Zero Knowledge in the Random Oracle Model, Revisited [PDF]

open access: bronze, 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).
Hoeteck Wee
openalex   +3 more sources

Quantum Position Verification in the Random Oracle Model

open access: bronze, 2014
We present a quantum position verification scheme in the random oracle model. In contrast to prior work, our scheme does not require bounded storage/retrieval/entanglement assumptions. We also give an efficient position-based authentication protocol.
Dominique Unruh
openalex   +3 more sources

Active learning with human heuristics: an algorithm robust to labeling bias [PDF]

open access: yesFrontiers in Artificial Intelligence
Active learning enables prediction models to achieve better performance faster by adaptively querying an oracle for the labels of data points. Sometimes the oracle is a human, for example when a medical diagnosis is provided by a doctor. According to the
Sriram Ravichandran   +5 more
doaj   +2 more sources

Pseudorandomness in the (Inverseless) Haar Random Oracle Model [PDF]

open access: green
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
openalex   +3 more sources

A Random Oracle Model for Information Hiding Resisting Extracting

open access: bronze2009 International Conference on E-Business and Information System Security, 2009
The random oracle model of cryptography is researched. According to the analysis of communication model and the anti-extracting of information hiding, the random oracle model of provable security is applied to the research on information hiding against extracting, an anti-extracting random oracle mode of information hiding is built and a conclusion ...
Guangming Tang, Jing Liu
openalex   +4 more sources

Equivalence of the Random Oracle Model and the Ideal Cipher Model, Revisited

open access: green, 2010
We consider the cryptographic problem of constructing an invertible random permutation from a public random function (i.e., which can be accessed by the adversary). This goal is formalized by the notion of indifferentiability of Maurer et al. (TCC 2004).
Thomas Holenstein   +2 more
openalex   +4 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

Home - About - Disclaimer - Privacy