(Hierarchical) identity-based encryption from affine message authentication
From MaRDI portal
Recommendations
- Tightly secure hierarchical identity-based encryption
- Tightly secure hierarchical identity-based encryption
- Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness
- Hierarchical Identity Based Encryption with Polynomially Many Levels
- Hierarchical identity-based encryption with tight multi-challenge security
Cited in
(62)- Efficient authentication from hard learning problems
- New chosen-ciphertext secure identity-based encryption with tight security reduction to the bilinear Diffie-Hellman problem
- Adaptively secure revocable hierarchical IBE from \(k\)-linear assumption
- Adaptive-ID secure hierarchical ID-based authenticated key exchange under standard assumptions without random oracles
- Short identity-based signatures with tight security from lattices
- Fine-grained secure attribute-based encryption
- Authenticated key exchange and signatures with tight security in the standard model
- Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin
- Tightly secure ring signatures in the standard model
- 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
- Survey of information security
- Short signatures from Diffie-Hellman: realizing almost compact public key
- Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness
- A generic construction of tightly secure signatures in the multi-user setting
- Extended dual system group and shorter unbounded hierarchical identity based encryption
- Unbounded HIBE with tight security
- 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
- More efficient constructions for inner-product encryption
- 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
- IBE Under k-LIN with Shorter Ciphertexts and Private Keys
- 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
- 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
- New Proof for BKP IBE Scheme and Improvement in the MIMC Setting
- Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes
- Adaptive partitioning
- 0-RTT key exchange with full forward secrecy
- 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
- Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange
- Tightly secure hierarchical identity-based encryption
- Digital Signatures with Memory-Tight Security in the Multi-challenge Setting
- 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
- Compact structure-preserving signatures with almost tight security
- Fine-grained secure attribute-based encryption
- Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting
- Almost optimal oblivious transfer from QA-NIZK
- Anonymous Lattice Identity-Based Encryption with Traceable Identities
- Toothpicks: more efficient fork-free two-round multi-signatures
- Tightly secure inner-product functional encryption revisited: compact, lattice-based, and more
- A note on adaptive security in hierarchical identity-based encryption
- Tight adaptive simulation security for identity-based inner-product FE in the (quantum) random oracle model
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- Efficient identity-based encryption with tight adaptive anonymity from RLWE
- Tightly-secure blind signatures in pairing-free groups
- Tight security for BBS signatures
- IBE with tight security against selective opening and chosen-ciphertext attacks
- SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions
This page was built for publication: (Hierarchical) identity-based encryption from affine message authentication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874517)
