Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
From MaRDI portal
Publication:3183588
DOI10.1007/978-3-642-03356-8_36zbMath1252.94101OpenAlexW1484751769MaRDI QIDQ3183588
Publication date: 20 October 2009
Published in: Advances in Cryptology - CRYPTO 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03356-8_36
Related Items (only showing first 100 items - show all)
Generic Constructions of Revocable Identity-Based Encryption ⋮ Two-Dimensional Representation of Cover Free Families and Its Applications: Short Signatures and More ⋮ Fast, Compact, and Expressive Attribute-Based Encryption ⋮ Master-Key KDM-Secure IBE from Pairings ⋮ Hierarchical Identity-Based Encryption with Tight Multi-challenge Security ⋮ Short Integrated PKE+PEKS in Standard Model ⋮ New Proof for BKP IBE Scheme and Improvement in the MIMC Setting ⋮ Structure-Preserving Signatures from Standard Assumptions, Revisited ⋮ Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption ⋮ Predicate Encryption for Circuits from LWE ⋮ Bilinear Entropy Expansion from the Decisional Linear Assumption ⋮ From Selective to Adaptive Security in Functional Encryption ⋮ Semi-adaptive Security and Bundling Functionalities Made Generic and Easy ⋮ IBE Under $$k$$-LIN with Shorter Ciphertexts and Private Keys ⋮ Improved Identity-Based Online/Offline Encryption ⋮ Constructions of CCA-Secure Revocable Identity-Based Encryption ⋮ Efficient ciphertext-policy attribute-based encryption with blackbox traceability ⋮ Key-Policy Multi-authority Attribute-Based Encryption ⋮ Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption ⋮ Blind key-generation attribute-based encryption for general predicates ⋮ Adaptive Security via Deletion in Attribute-Based Encryption: Solutions from Search Assumptions in Bilinear Groups ⋮ (Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin ⋮ Leakage-resilient identity-based cryptography from minimal assumptions ⋮ Fully adaptive decentralized multi-authority \textsf{ABE} ⋮ Registered attribute-based encryption ⋮ Traitor tracing with \(N^{1/3}\)-size ciphertexts and \(O(1)\)-size keys 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 ⋮ Decentralized multi-authority attribute-based inner-product FE: large universe and unbounded ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ Tight lower bounds and optimal constructions of anonymous broadcast encryption and authentication ⋮ On Constructing Pairing-Free Identity-Based Encryptions ⋮ Unbounded predicate inner product functional encryption from pairings ⋮ Leakage-resilient \textsf{IBE}/\textsf{ABE} with optimal leakage rates from lattices ⋮ Adaptive multiparty NIKE ⋮ Reinforcing privacy in cloud computing via adaptively secure non-zero inner product encryption and anonymous identity-based revocation in unbounded setting ⋮ Key-policy ABE with switchable attributes ⋮ Multi-client functional encryption with fine-grained access control ⋮ Compact FE for unbounded attribute-weighted sums for logspace from SXDH ⋮ Adaptively secure inner product encryption from LWE ⋮ Unbounded dynamic predicate compositions in ABE from standard assumptions ⋮ Succinct and adaptively secure ABE for ABP from \(k\)-Lin ⋮ Inner-product functional encryption with fine-grained access control ⋮ Unbounded HIBE with tight security ⋮ Receiver selective opening security for identity-based encryption in the multi-challenge setting ⋮ Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH ⋮ Multi-party functional encryption ⋮ ABE for DFA from LWE against bounded collusions, revisited ⋮ Ring-based identity based encryption -- asymptotically shorter MPK and tighter security ⋮ Towards tight adaptive security of non-interactive key exchange ⋮ New Revocable IBE in Prime-Order Groups: Adaptively Secure, Decryption Key Exposure Resistant, and with Short Public Parameters ⋮ Transforming Hidden Vector Encryption Schemes from Composite to Prime Order Groups ⋮ Expanded Framework for Dual System Encryption and Its Application ⋮ SecHome: A Secure Large-Scale Smart Home System Using Hierarchical Identity Based Encryption ⋮ A Signature Scheme with Efficient Proof of Validity ⋮ Cost-Effective and Scalable Data Sharing in Cloud Storage Using Hierarchical Attribute-Based Encryption with Forward Security ⋮ Identification Schemes from Key Encapsulation Mechanisms ⋮ Adaptively Secure Non-interactive Threshold Cryptosystems ⋮ Decentralized Attribute-Based Signatures ⋮ Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures ⋮ Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES ⋮ Sequential Aggregate Signatures with Short Public Keys: Design, Analysis and Implementation Studies ⋮ Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits ⋮ Tightly Secure IBE Under Constant-Size Master Public Key ⋮ Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps ⋮ Multi-input Inner-Product Functional Encryption from Pairings ⋮ Simplifying Design and Analysis of Complex Predicate Encryption Schemes ⋮ Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks ⋮ Duality in ABE: Converting Attribute Based Encryption for Dual Predicate and Dual Policy via Computational Encodings ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange ⋮ Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography ⋮ Verifiable Random Functions from Standard Assumptions ⋮ Déjà Q: Encore! Un Petit IBE ⋮ A Study of Pair Encodings: Predicate Encryption in Prime Order Groups ⋮ Functional Encryption Without Obfuscation ⋮ Fully Secure IBE with Tighter Reduction in Prime Order Bilinear Groups ⋮ Tightly secure hierarchical identity-based encryption ⋮ Leakage-Resilient Functional Encryption via Pair Encodings ⋮ Secret Handshakes with Dynamic Expressive Matching Policy ⋮ Chosen Ciphertext Secure Attribute-Based Encryption with Outsourced Decryption ⋮ Minicrypt primitives with algebraic structure and applications ⋮ More Efficient Constructions for Inner-Product Encryption ⋮ Efficient Ciphertext Policy Attribute-Based Encryption with Constant-Size Ciphertext and Constant Computation-Cost ⋮ Anonymous Encryption with Partial-Order Subset Delegation Functionality ⋮ A Tag Based Encoding: An Efficient Encoding for Predicate Encryption in Prime Order Groups ⋮ Non-zero Inner Product Encryption with Short Ciphertexts and Private Keys ⋮ Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes ⋮ Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming ⋮ Ciphertext-Policy Delegatable Hidden Vector Encryption and Its Application to Searchable Encryption in Multi-user Setting ⋮ New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts ⋮ Unnamed Item ⋮ An efficient IBE scheme with tight security reduction in the random oracle model
This page was built for publication: Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
