Tighter security proofs for GPV-IBE in the quantum random oracle model
From MaRDI portal
Publication:5915905
DOI10.1007/978-3-030-03329-3_9zbMath1446.94144OpenAlexW3127079654MaRDI QIDQ5915905
Shota Yamada, Shuichi Katsumata, Takashi Yamakawa
Publication date: 23 January 2019
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-03329-3_9
identity-based encryptiontight security reductionLWE assumptionmulti-challenge securityquantum random oracle models
Related Items (10)
Generic constructions of master-key KDM secure attribute-based encryption ⋮ Constructive post-quantum reductions ⋮ Lattice-based authenticated key exchange with tight security ⋮ Tighter Security Proofs for Post-quantum Key Encapsulation Mechanism in the Multi-challenge Setting ⋮ Efficient public-key encryption with equality test from lattices ⋮ Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity ⋮ CCA-security from adaptive all-but-one lossy trapdoor functions ⋮ Classical vs quantum random oracles ⋮ Identity-based encryption with security against the KGC: a formal model and its instantiations ⋮ Short identity-based signatures with tight security from lattices
This page was built for publication: Tighter security proofs for GPV-IBE in the quantum random oracle model
