(Hierarchical) Identity-Based Encryption from Affine Message Authentication
From MaRDI portal
Publication:2874517
DOI10.1007/978-3-662-44371-2_23zbMath1345.94044OpenAlexW2138805158WikidataQ59163671 ScholiaQ59163671MaRDI QIDQ2874517
Eike Kiltz, Jia-xin Pan, Olivier Blazy
Publication date: 7 August 2014
Published in: Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44371-2_23
Related Items (52)
Master-Key KDM-Secure IBE from Pairings ⋮ Hierarchical Identity-Based Encryption with Tight Multi-challenge Security ⋮ Public-Key Puncturable Encryption: Modular and Compact Constructions ⋮ Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More ⋮ SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions ⋮ Extended dual system group and shorter unbounded hierarchical identity based encryption ⋮ Fine-grained secure attribute-based encryption ⋮ Authenticated key exchange and signatures with tight security in the standard model ⋮ New Proof for BKP IBE Scheme and Improvement in the MIMC Setting ⋮ Survey of information security ⋮ IBE Under $$k$$-LIN with Shorter Ciphertexts and Private Keys ⋮ Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes ⋮ Short signatures from Diffie-Hellman: realizing almost compact public key ⋮ Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness ⋮ Digital Signatures with Memory-Tight Security in the Multi-challenge Setting ⋮ A generic construction of tightly secure signatures in the multi-user setting ⋮ Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin ⋮ Adaptive Oblivious Transfer and Generalization ⋮ Towards Tightly Secure Lattice Short Signature and Id-Based Encryption ⋮ Efficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge Setting ⋮ Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions ⋮ Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions ⋮ Fine-grained verifier NIZK and its applications ⋮ Tight lower bounds and optimal constructions of anonymous broadcast encryption and authentication ⋮ Identity-based encryption in DDH hard groups ⋮ Trapdoor sanitizable and redactable signatures with unlinkability, invisibility and strong context-hiding ⋮ Efficient authentication from hard learning problems ⋮ Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting ⋮ Unbounded HIBE with tight security ⋮ SecHome: A Secure Large-Scale Smart Home System Using Hierarchical Identity Based Encryption ⋮ Tighter Security Proofs for Post-quantum Key Encapsulation Mechanism in the Multi-challenge Setting ⋮ Tightly secure ring signatures in the standard model ⋮ New chosen-ciphertext secure identity-based encryption with tight security reduction to the bilinear Diffie-Hellman problem ⋮ Compact structure-preserving signatures with almost tight security ⋮ Tightly Secure IBE Under Constant-Size Master Public Key ⋮ Equivalences and Black-Box Separations of Matrix Diffie-Hellman Problems ⋮ Multi-input Inner-Product Functional Encryption from Pairings ⋮ Fine-grained secure attribute-based encryption ⋮ Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange ⋮ Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography ⋮ Reconfigurable Cryptography: A Flexible Approach to Long-Term Security ⋮ Déjà Q: Encore! Un Petit IBE ⋮ Adaptively secure revocable hierarchical IBE from \(k\)-linear assumption ⋮ Tightly secure hierarchical identity-based encryption ⋮ More Efficient Constructions for Inner-Product Encryption ⋮ IBE with tight security against selective opening and chosen-ciphertext attacks ⋮ Short tightly secure signatures for signing a vector of group elements: a new approach ⋮ Tightly secure signature schemes from the LWE and subset sum assumptions ⋮ Adaptive Partitioning ⋮ 0-RTT Key Exchange with Full Forward Secrecy ⋮ Adaptive-ID secure hierarchical ID-based authenticated key exchange under standard assumptions without random oracles ⋮ Short identity-based signatures with tight security from lattices
This page was built for publication: (Hierarchical) Identity-Based Encryption from Affine Message Authentication
