Search
Search Results
-
Non-Observable Quantum Random Oracle Model
The random oracle model (ROM), introduced by Bellare and Rogaway (CCS 1993), enables a formal security proof for many (efficient) cryptographic...
-
A Theoretical Framework for the Analysis of Physical Unclonable Function Interfaces and Its Relation to the Random Oracle Model
Analysis of advanced physical unclonable function (PUF) applications and protocols relies on assuming that a PUF behaves like a random oracle; that...
-
-
Signatures with Memory-Tight Security in the Quantum Random Oracle Model
Memory tightness of reductions in cryptography, in addition to the standard tightness related to advantage and running time, is important when the...
-
Probabilistic Hash-and-Sign with Retry in the Quantum Random Oracle Model
A hash-and-sign signature based on a preimage-sampleable function (Gentry et al., STOC 2008) is secure in the quantum random oracle model if the...
-
Selective Opening Security in the Quantum Random Oracle Model, Revisited
We prove that two variants of the Fujisaki-Okamoto transformations are selective opening (SO) secure against chosen-ciphertext attacks in the quantum...
-
QCCA-Secure Generic Transformations in the Quantum Random Oracle Model
The post-quantum security of cryptographic schemes assumes that the quantum adversary only receives the classical result of computations with the...
-
Tightly Secure Lattice Identity-Based Signature in the Quantum Random Oracle Model
We present a quantumly secure identity-based signature scheme based on the standard short integer solution problem, featuring tight security...
-
Non-uniformity and Quantum Advice in the Quantum Random Oracle Model
QROM (quantum random oracle model), introduced by Boneh et al. (Asiacrypt 2011), captures all generic algorithms. However, it fails to describe...
-
Online-Extractability in the Quantum Random-Oracle Model
We show the following generic result: When a quantum query algorithm in the quantum random-oracle model outputs a classical value t that is promised...
-
A Random Oracle for All of Us
We introduce the notion of a universal random oracle. Analogously to a classical random oracle it idealizes hash functions as random functions....
-
IND-CCA Security of Kyber in the Quantum Random Oracle Model, Revisited
In this paper, we answer the open question pointed out by Grubbs et al. (EUROCRYPT 2022) and Xagawa (EUROCRYPT 2022), i.e., the...
-
Linking unknown characters via oracle bone inscriptions retrieval
Retrieving useful information from existing collections of oracle bone rubbing images plays a pivotal role in the study of oracle bone inscription...
-
Evaluating the Security of CRYSTALS-Dilithium in the Quantum Random Oracle Model
In the wake of recent progress on quantum computing hardware, the National Institute of Standards and Technology (NIST) is standardizing...
-
Universally Composable \(\varSigma \) -protocols in the Global Random-Oracle Model
Numerous cryptographic applications require efficient non-interactive zero-knowledge proofs of knowledge (NIZKPoK) as a building block. Typically...
-
The Pseudorandom Oracle Model and Ideal Obfuscation
We introduce a new idealized model of hash functions, which we refer to as the pseudorandom oracle (Pr...
-
On the (Im)possibility of Time-Lock Puzzles in the Quantum Random Oracle Model
Time-lock puzzles wrap a solution \(\textrm{s}\)...
-
The Random Fault Model
In this work, we introduce the random fault model - a more advanced fault model inspired by the random probing model, where the adversary can fault...
-
Lower Bound on SNARGs in the Random Oracle Model
Succinct non-interactive arguments (SNARGs) have become a fundamental primitive in the cryptographic community. The focus of this work is...
-
Instantiability of Classical Random-Oracle-Model Encryption Transforms
Extending work leveraging program obfuscation to instantiate random-oracle-based transforms (e.g., Hohenberger et al., EUROCRYPT 2014, Kalai el al.,...