Hierarchical Identity-Based Encryption with Tight Multi-challenge Security

DOI10.1007/978-3-030-45374-9_6zbMath1500.94034OpenAlexW3022137835MaRDI QIDQ5041156

Jia-xin Pan, Roman Langrehr

Publication date: 13 October 2022

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-45374-9_6

zbMATH Keywords

anonymitychosen-ciphertext securitytight securityhierarchical identity-based encryptionmulti-challenge security

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

Forward-secure revocable identity-based encryption ⋮ Trapdoor sanitizable and redactable signatures with unlinkability, invisibility and strong context-hiding ⋮ Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting ⋮ Unbounded HIBE with tight security ⋮ Efficient identity-based encryption with hierarchical key-insulation from HIBE ⋮ Adaptively secure revocable hierarchical IBE from \(k\)-linear assumption ⋮ Master-key KDM-secure ABE via predicate encoding ⋮ Short identity-based signatures with tight security from lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• More efficient (almost) tightly secure structure-preserving signatures
• Kurosawa-Desmedt meets tight security
• Tightly-secure signatures from five-move identification protocols
• Identity-based encryption tightly secure under chosen-ciphertext attacks
• Practical and tightly-secure digital signatures and authenticated key exchange
• Shorter QA-NIZK and SPS with tighter security
• Extended dual system group and shorter unbounded hierarchical identity based encryption
• Extended Nested Dual System Groups, Revisited
• A Framework for Identity-Based Encryption with Almost Tight Security
• Tightly CCA-Secure Encryption Without Pairings
• An Algebraic Framework for Diffie-Hellman Assumptions
• Fully, (Almost) Tightly Secure IBE and Dual System Groups
• Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
• (Hierarchical) Identity-Based Encryption from Affine Message Authentication
• Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
• Message Authentication, Revisited
• Tightly Secure Signatures and Public-Key Encryption
• Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting
• Quasi-Adaptive NIZK for Linear Subspaces Revisited
• Efficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge Setting
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
• Hierarchical ID-Based Cryptography
• Adaptive Partitioning
• Efficient Identity-Based Encryption Without Random Oracles
• Why Proving HIBE Systems Secure Is Difficult
• Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Tightly secure hierarchical identity-based encryption

This page was built for publication: Hierarchical Identity-Based Encryption with Tight Multi-challenge Security