[PDF] Top 20 Tighter Security Proofs for GPV-IBE in the Quantum Random Oracle Model
Has 10000 "Tighter Security Proofs for GPV-IBE in the Quantum Random Oracle Model" found on our website. Below are the top 20 most common "Tighter Security Proofs for GPV-IBE in the Quantum Random Oracle Model".
Tighter Security Proofs for GPV-IBE in the Quantum Random Oracle Model
... much tighter proof for the GPV-IBE in the QROM in the single-challenge ...the GPV-IBE has an almost tight reduction in the multi-challenge setting both in the ROM and QROM, where the ... See full document
38
(Tightly) QCCA-Secure Key-Encapsulation Mechanism in the Quantum Random Oracle Model
... IND-CCA security proofs of the above conversions, the challenger should simulate the decapsulation oracle on a query of any ciphertext c except the challenge ciphertext c ∗ ...the quantum way. ... See full document
14
Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
... [Unr15] Dominique Unruh. Non-interactive zero-knowledge proofs in the quantum random oracle model. In Elisabeth Oswald and Marc Fischlin, editors, Advances in Cryptol- ogy - EUROCRYPT ... See full document
20
A Note on the Instantiability of the Quantum Random Oracle
... the Random Oracle Model (ROM) and the standard ...standard model). In 2011, Boneh et al. defined the notion of the Quantum Random Oracle Model (QROM), where queries ... See full document
20
Key Encapsulation from Noisy Key Agreement in the Quantum Random Oracle Model
... and security for an NKA ...the quantum computing ...noisy, quantum-resistant counterparts of the problems aris- ing from the classical Diffie-Hellman type ...the quantum random ... See full document
49
Post-Quantum EPID Signatures from Symmetric Primitives
... the random oracle ...and security definitions needed for private hardware attestation used in Intel’s ...inclusion proofs of Derler et ... See full document
29
IND-CCA-secure Key Encapsulation Mechanism in the Quantum Random Oracle Model, Revisited
... the GPV trapdoor func- tion for LWE [35], NTRU [26], the McEliece PKE [36], and the Niederreiter PKE ...– Security notion. IND-CPA security and OW-CPA security are widely ac- cepted as ... See full document
44
Secure Identity-Based Encryption in the Quantum Random Oracle Model
... of security for an identity-based encryption scheme in the quantum random oracle ...of security for any scheme in this model that requires no additional ...obtain security ... See full document
27
Quantum security proofs using semi-classical oracles
... the quantum random oracle model that employ some variant of the original O2H Theorem from [Unr15b]: [Unr15b] introduced the O2H Theorem to build revocable timed-release encryption schemes, ... See full document
45
Identity-Based Encryption with Security against the KGC: A Formal Model and Its Instantiations
... standard IBE scheme that captures the key escrow problem, and provide two instantiations based on lattices and ...blind IBE with certified identities to differentiate between prior formaliza- ...blind ... See full document
32
Non-interactive zero-knowledge proofs in the quantum random oracle model
... NIZK proofs. However, if we want security against quantum adversaries, the situation becomes ...Groth-Sahai proofs are not secure because they are based on hardness assumptions in bilinear ... See full document
26
In the point of view security, An efficient scheme in IBE with random oracle
... (especially IBE) was firstly introduced by Shamir[6] in 1984, but it is not realistic until the invention of the scheme of Boneh and Franklin[3] in ...the model of the Random Oracle, it has ... See full document
15
Practical UC security with a Global Random Oracle
... the security of PVW OT against a malicious sender relies on the hardness of the DDH problem: an adversary distinguishing the input bit of the honest receiver can be used to construct an adversary that ... See full document
39
Adaptive Proofs of Knowledge in the Random Oracle Model
... of proofs of knowledge we can extend the approach to adaptive proofs of ...adaptive proofs formally without simu- lation soundness using so-called n-proofs, where n is a parameter describing ... See full document
56
Making Existential-Unforgeable Signatures Strongly Unforgeable in the Quantum Random-Oracle Model
... getting quantum-safe su-acma ...plain model (i.e. without a random-oracle) [29, 20, 18, ...be quantum-safe, they we can get more efficient quantum-safe su-acma schemes in the ... See full document
16
Revocable Identity-based Encryption from Codes with Rank Metric
... In 1985, Gabidulin [16] proposed rank metric as an alternative to Hamming metric. Indeed, Gabidulin [16] showed that it is possible to construct a rank analogue of Reed-Solomon codes, called Gabidulin codes. The generic ... See full document
19
Quantum-secure message authentication via blind-unforgeability
... (iii.) quantum poly-time algorithms (QPTs), modeling quantum ...are quantum circuits, which may contain both unitary gates and ...all random coins and measurements of A and any randomness used ... See full document
38
Efficient identity-based threshold decryption scheme from bilinear pairings
... In tradtional IBC the PKG is the holder of all the private keys, implying some risk if its security is compromised. In order to prevent such a scenario to occur, Boneh and Franklin [2] suggested to introduce the ... See full document
18
A Provably Secure Group Signature Scheme from Code-Based Assumptions
... the random oracle COM are assumed to be uniformly random, the distribution of the commitment CMT and the distribution of the challenge Ch from V b are statistically close to those in the real ... See full document
28
Cryptanalysis of pairing-free certificateless authenticated key agreement protocol
... key agreement protocol, International Journal of Communication Systems, 25(2), pp. 221-230, 2012] proposed a pairing-free certificateless authenticated key agreement protocol and demonstrated that their protocol is ... See full document
9
Related subjects