Search
Search Results
-
Oracle Computability and Turing Reducibility in the Calculus of Inductive Constructions
We develop synthetic notions of oracle computability and Turing reducibility in the Calculus of Inductive Constructions (CIC), the constructive type...
-
Generic constructions of master-key KDM secure attribute-based encryption
Master-key key-dependent message (mKDM) security is a strong security notion for attribute-based encryption (ABE) schemes, which has been...
-
Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
We consider the proximity testing problem for error-correcting codes which consist in evaluations of multivariate polynomials either of bounded...
-
Simple Constructions from (Almost) Regular One-Way Functions
Two of the most useful cryptographic primitives that can be constructed from one-way functions are pseudorandom generators (PRGs) and universal...
-
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...
-
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...
-
Generic attacks on small-state stream cipher constructions in the multi-user setting
Small-state stream ciphers (SSCs), which violate the principle that the state size should exceed the key size by a factor of two, still demonstrate...
-
CCA security for contracting (quasi-)Feistel constructions with tight round complexity
Feistel constructions using contracting round functions were introduced in 1990s and generalized by Yun et al. (Des Codes Cryptogr 58(1):45–72, 2011)...
-
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...
-
Random Oracle Combiners: Breaking the Concatenation Barrier for Collision-Resistance
Suppose we have two hash functions \(h_1\) and...
-
On the Security of Triplex- and Multiplex-Type Constructions with Smaller Tweaks
In TCHES’22, Shen et al. proposed Triplex, a single-pass leakage-resistant authenticated encryption scheme based on Tweakable Block Ciphers (TBCs)...
-
Anamorphic Encryption: New Constructions and Homomorphic Realizations
The elegant paradigm of Anamorphic Encryption (Persiano et al., Eurocrypt 2022) considers the question of establishing a private communication in a...
-
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...
-
Functional signatures: new definition and constructions
Functional signatures (FS) enable a master authority to delegate its signing privilege to an assistant. Concretely, the master authority uses its...
-
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...
-
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...
-
Tight lower bounds and optimal constructions of anonymous broadcast encryption and authentication
Broadcast Encryption (BE) is public-key encryption allowing a sender to encrypt a message by specifing recipients, and only the specified recipients...
-
Synchronized Aggregate Signature Under Standard Assumption in the Random Oracle Model
An aggregate signature enables to aggregation of multiple signatures generated by different signers on different messages. A synchronized aggregate...
-
On the (Im)possibility of Time-Lock Puzzles in the Quantum Random Oracle Model
Time-lock puzzles wrap a solution \(\textrm{s}\)...