搜索结果: 1-15 共查到“军事学 random-oracle model”相关记录38条 . 查询时间(0.093 秒)
Non-Interactive Zero Knowledge Proofs in the Random Oracle Model
FS transform NIZK random oracle model
font style='font-size:12px;'>
2019/8/22
The Fiat-Shamir (FS) transform is a well known and widely used technique to convert any constant-round public-coin honest-verifier zero-knowledge (HVZK) proof or argument system CIPC=(Prov,Ver)CIPC=(P...
Succinct Arguments in the Quantum Random Oracle Model
succinct arguments quantum random oracle model probabilistically checkable proofs
font style='font-size:12px;'>
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...
A Note on the (Im)possibility of Verifiable Delay Functions in the Random Oracle Model
Verifiable Delay Functions Random Oracle Model
font style='font-size:12px;'>
2019/6/6
Boneh, Bonneau, B{\"u}nz, and Fisch (CRYPTO 2018) recently introduced the notion of a \emph{verifiable delay function} (VDF). VDFs are functions that take a long \emph{sequential} time TT to compute, ...
Tighter proofs of CCA security in the quantum random oracle model
Quantum random oracle model key encapsulation mechanisms Fujisaki-Okamoto
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...
A Post-Quantum UC-Commitment Scheme in the Global Random Oracle Model from Code-Based Assumptions
Commitment Scheme Universal Composability
font style='font-size:12px;'>
2019/2/27
In this work, we propose the first post-quantum UC-commitment scheme in the Global Random Oracle Model, where only one non-programmable random oracle is available. The security of our proposal is base...
Tighter security proofs for generic key encapsulation mechanism in the quantum random oracle model
quantum random oracle model key encapsulation mechanism generic construction
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...
A Provably-Secure Unidirectional Proxy Re-Encryption Scheme Without Pairing in the Random Oracle Model
Proxy Re-Encryption Random Oracle Model Chosen Ciphertext Security
font style='font-size:12px;'>
2018/11/29
Proxy re-encryption (PRE) enables delegation of decryption rights by entrusting a proxy server with special information, that allows it to transform a ciphertext under one public key into a ciphertext...
(Tightly) QCCA-Secure Key-Encapsulation Mechanism in the Quantum Random Oracle Model
Tight security quantum chosen-ciphertext security post-quantum cryptography
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...
Making Groth's zk-SNARK Simulation Extractable in the Random Oracle Model
zk-snarks generic group model non-malleability
font style='font-size:12px;'>
2018/3/6
We describe a variant of Groth's zk-SNARK [Groth, Eurocrypt 2016] that satisfies simulation extractability, which is a strong form of adaptive non-malleability. The proving time is almost identical to...