Fully, (Almost) Tightly Secure IBE and Dual System Groups
From MaRDI portal
Publication:2849411
DOI10.1007/978-3-642-40084-1_25zbMath1311.94072OpenAlexW148801026MaRDI QIDQ2849411
Publication date: 17 September 2013
Published in: Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40084-1_25
Related Items (66)
An efficient IBE scheme with tight security reduction in the random oracle model ⋮ Master-Key KDM-Secure IBE from Pairings ⋮ Hierarchical Identity-Based Encryption with Tight Multi-challenge Security ⋮ Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More ⋮ Efficient subtree-based encryption for fuzzy-entity data sharing ⋮ On the security loss of unique signatures ⋮ Quantum algorithms for the \(k\)-XOR problem ⋮ Extended dual system group and shorter unbounded hierarchical identity based encryption ⋮ Fine-grained secure attribute-based encryption ⋮ New Proof for BKP IBE Scheme and Improvement in the MIMC Setting ⋮ Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption ⋮ Bilinear Entropy Expansion from the Decisional Linear Assumption ⋮ Unbounded ABE via bilinear entropy expansion, revisited ⋮ IBE Under $$k$$-LIN with Shorter Ciphertexts and Private Keys ⋮ Efficient revocable identity-based encryption with short public parameters ⋮ Attribute based encryption for deterministic finite automata from DLIN ⋮ Short signatures from Diffie-Hellman: realizing almost compact public key ⋮ Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness ⋮ Blind key-generation attribute-based encryption for general predicates ⋮ 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 ⋮ Towards Tightly Secure Lattice Short Signature and Id-Based Encryption ⋮ Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings ⋮ 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 ⋮ Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps ⋮ Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice ⋮ A practical compiler for attribute-based encryption: new decentralized constructions and more ⋮ Almost tight multi-user security under adaptive corruptions \& leakages in the standard model ⋮ Fine-grained verifier NIZK and its applications ⋮ Identity-based encryption in DDH hard groups ⋮ Functional encryption for computational hiding in prime order groups via pair encodings ⋮ Lattice-based signatures with tight adaptive corruptions and more ⋮ Compact and tightly selective-opening secure public-key encryption schemes ⋮ Identity-based matchmaking encryption from standard assumptions ⋮ A survey on functional encryption ⋮ 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 ⋮ Simple and more efficient PRFs with tight security from LWE and matrix-DDH ⋮ Expanded Framework for Dual System Encryption and Its Application ⋮ Tighter Security Proofs for Post-quantum Key Encapsulation Mechanism in the Multi-challenge Setting ⋮ Tightly secure inner product functional encryption: multi-input and function-hiding constructions ⋮ 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 ⋮ Leakage-resilient attribute based encryption in prime-order groups via predicate encodings ⋮ Compact structure-preserving signatures with almost tight security ⋮ Tightly Secure IBE Under Constant-Size Master Public Key ⋮ 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 ⋮ A Study of Pair Encodings: Predicate Encryption in Prime Order Groups ⋮ Tighter security proofs for GPV-IBE in the quantum random oracle model ⋮ Fully Secure IBE with Tighter Reduction in Prime Order Bilinear Groups ⋮ A multi-authority approach to various predicate encryption types ⋮ Tag-based ABE in prime-order groups via pair encoding ⋮ Tightly secure hierarchical identity-based encryption ⋮ Verifiable random functions with optimal tightness ⋮ Generic negation of pair encodings ⋮ A Tag Based Encoding: An Efficient Encoding for Predicate Encryption in Prime Order Groups ⋮ 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 ⋮ Short identity-based signatures with tight security from lattices
This page was built for publication: Fully, (Almost) Tightly Secure IBE and Dual System Groups
