Why Proving HIBE Systems Secure Is Difficult
From MaRDI portal
Publication:5418689
DOI10.1007/978-3-642-55220-5_4zbMath1326.94109OpenAlexW2098199531MaRDI QIDQ5418689
No author found.
Publication date: 27 May 2014
Published in: Advances in Cryptology – EUROCRYPT 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-55220-5_4
Related Items (21)
Hierarchical Identity-Based Encryption with Tight Multi-challenge Security ⋮ Parameter-hiding order revealing encryption ⋮ Quantum algorithms for the \(k\)-XOR problem ⋮ Tightness subtleties for multi-user PKE notions ⋮ Optimal tightness for chain-based unique signatures ⋮ Adaptive Security via Deletion in Attribute-Based Encryption: Solutions from Search Assumptions in Bilinear Groups ⋮ Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice ⋮ Multi-instance secure public-key encryption ⋮ Adaptive multiparty NIKE ⋮ The power of undirected rewindings for adaptive security ⋮ On optimal tightness for key exchange with full forward secrecy via key confirmation ⋮ On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model ⋮ Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness ⋮ Unbounded HIBE with tight security ⋮ The cost of adaptivity in security games on graphs ⋮ Towards tight adaptive security of non-interactive key exchange ⋮ Simple and more efficient PRFs with tight security from LWE and matrix-DDH ⋮ Anonymous spatial encryption under affine space delegation functionality with full security ⋮ Tightly secure hierarchical identity-based encryption ⋮ Verifiable random functions with optimal tightness ⋮ Unnamed Item
This page was built for publication: Why Proving HIBE Systems Secure Is Difficult
