搜索结果: 1-15 共查到“Quantum random oracle model”相关记录16条 . 查询时间(0.106 秒)
Succinct Arguments in the Quantum Random Oracle Model
succinct arguments quantum random oracle model probabilistically checkable proofs
2019/7/22
Succinct non-interactive arguments (SNARGs) are highly efficient certificates of membership in non-deterministic languages. Constructions of SNARGs in the random oracle model are widely believed to be...
Tighter proofs of CCA security in the quantum random oracle model
Quantum random oracle model key encapsulation mechanisms Fujisaki-Okamoto
2019/5/31
We revisit the construction of IND-CCA secure key encapsulation mechanisms (KEM) from public-key encryption schemes (PKE). We give new, tighter security reductions for several constructions. Our main ...
On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model
non-tightness quantum random oracle model Fujisaki-Okamoto
2019/5/21
Key encapsulation mechanism (KEM) variants of the Fujisaki-Okamoto (FO) transformation (CRYPTO 1999 and Journal of Cryptology 2013) that turn a weakly-secure public-key encryption (PKE) into an IND-CC...
Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model
Fiat-Shamir post-quantum digital signatures
2019/3/1
The famous Fiat-Shamir transformation turns any public-coin three-round interactive proof, i.e., any so-called sigma-protocol, into a non-interactive proof in the random-oracle model. We study this tr...
Tighter security proofs for generic key encapsulation mechanism in the quantum random oracle model
quantum random oracle model key encapsulation mechanism generic construction
2019/2/27
In (TCC 2017), Hofheinz, Hoevelmanns and Kiltz provided a fine-grained and modular toolkit of generic key encapsulation mechanism (KEM) constructions, which were widely used among KEM submissions to N...
Key Encapsulation Mechanism with Explicit Rejection in the Quantum Random Oracle Model
quantum random oracle model key encapsulation mechanism explicit rejection
2019/1/26
The recent post-quantum cryptography standardization project launched by NIST increased the interest in generic key encapsulation mechanism (KEM) constructions in the quantum random oracle (QROM). Bas...
(Tightly) QCCA-Secure Key-Encapsulation Mechanism in the Quantum Random Oracle Model
Tight security quantum chosen-ciphertext security post-quantum cryptography
2018/11/16
This paper shows the security against quantum chosen-ciphertext attacks (QCCA security) of the KEM in Saito, Yamakawa, and Xagawa (EUROCRYPT 2018) in the QROM. The proof is very similar to that for th...
Key Encapsulation from Noisy Key Agreement in the Quantum Random Oracle Model
key exchange key encapsulation mechanism post-quantum cryptography
2018/11/13
A multitude of post-quantum key encapsulation mechanisms (KEMs) and public key encryption (PKE) schemes implicitly rely on a protocol by which Alice and Bob exchange public messages and converge on se...
Generic Authenticated Key Exchange in the Quantum Random Oracle Model
Authenticated key exchange quantum random oracle model NIST
2018/11/8
We propose FO-AKE , a generic construction of two-message authenticated key exchange (AKE) from any passively secure public key encryption (PKE) in the quantum random oracle model (QROM). Whereas prev...
Tighter Security Proofs for GPV-IBE in the Quantum Random Oracle Model
identity-based encryption quantum random oracle models LWE assumption
2018/5/22
In (STOC, 2008), Gentry, Peikert, and Vaikuntanathan proposed the first identity-based encryption (GPV-IBE) scheme based on a post-quantum assumption, namely, the learning with errors (LWE) assumption...
Tightly-Secure Key-Encapsulation Mechanism in the Quantum Random Oracle Model
Tight security chosen-ciphertext security post-quantum cryptography
2017/10/16
We give a first tight security reduction for a conversion from a weakly secure public-key encryption scheme to an IND-CCA-secure key-encapsulation mechanism scheme in the quantum random oracle model. ...
A tight security reduction in the quantum random oracle model for code-based signature schemes
Quantum Random Oracle Quantum-Safe Cryptography Code-Based Cryptography
2017/9/28
Quantum secure signature schemes have a lot of attention recently, in particular because of the NIST call to standardize quantum safe cryptography. However, only few signature schemes can have concret...
A Concrete Treatment of Fiat-Shamir Signatures in the Quantum Random-Oracle Model
Fiat-Shamir Quantum Random Oracle Tightness
2017/9/25
The Fiat-Shamir transform is a technique for combining a hash function and an identification scheme to produce a digital signature scheme. The resulting scheme is known to be secure in the random orac...
Leighton-Micali Hash-Based Signatures in the Quantum Random-Oracle Model
Post-Quantum Cryptography Digital Signatures Hash Functions
2017/6/27
Digital signatures constructed solely from hash functions offer competitive signature sizes and fast signing and verifying times. Moreover, the security of hash functions against a quantum adversary i...
Non-interactive zero-knowledge proofs in the quantum random oracle model
Quantum cryptography proofs of knowledge random oracles
2016/1/8
We present a construction for non-interactive zero-knowledge proofs of knowledge in the random
oracle model from general sigma-protocols. Our construction is secure against quantum adversaries.
Prio...