Unbounded ABE via bilinear entropy expansion, revisited
From MaRDI portal
Publication:1648812
DOI10.1007/978-3-319-78381-9_19zbMath1423.94062OpenAlexW2795178971MaRDI QIDQ1648812
Junqing Gong, Hoeteck Wee, Lucas Kowalczyk, Jie Chen
Publication date: 9 July 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78381-9_19
constant-size public parametersconstructions of unbounded attribute-based encryption (ABE) schemesstatic assumptions in bilinear groups
Related Items (26)
Fast, Compact, and Expressive Attribute-Based Encryption ⋮ Public-Key Puncturable Encryption: Modular and Compact Constructions ⋮ Attribute based encryption for deterministic finite automata from DLIN ⋮ Rerandomizable signatures under standard assumption ⋮ Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin ⋮ Fully adaptive decentralized multi-authority \textsf{ABE} ⋮ Traitor tracing with \(N^{1/3}\)-size ciphertexts and \(O(1)\)-size keys from \(k\)-Lin ⋮ Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice ⋮ Decentralized multi-authority attribute-based inner-product FE: large universe and unbounded ⋮ GLUE: generalizing unbounded attribute-based encryption for flexible efficiency trade-offs ⋮ Compact FE for unbounded attribute-weighted sums for logspace from SXDH ⋮ A survey on functional encryption ⋮ Unbounded dynamic predicate compositions in ABE from standard assumptions ⋮ Unbounded HIBE with tight security ⋮ Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH ⋮ Improved inner-product encryption with adaptive security and full attribute-hiding ⋮ Fast, compact, and expressive attribute-based encryption ⋮ Flexible attribute-based proxy re-encryption for efficient data sharing ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Tag-based ABE in prime-order groups via pair encoding ⋮ Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) ⋮ Adaptively secure ABE for DFA from \(k\)-Lin and more ⋮ Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}} ⋮ Fully secure ABE with outsourced decryption against chosen ciphertext attack ⋮ Master-key KDM-secure ABE via predicate encoding
Cites Work
- Unnamed Item
- Bit commitment using pseudorandomness
- Tightly CCA-Secure Encryption Without Pairings
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- An Algebraic Framework for Diffie-Hellman Assumptions
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- Round-Efficient Black-Box Construction of Composable Multi-Party Computation
- Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
- Waters Signatures with Optimal Security Reduction
- Black-Box Constructions of Composable Protocols without Set-Up
- Semi-adaptive Attribute-Based Encryption and Improved Delegation for Boolean Formula
- On Adaptively Secure Protocols
- Improved Dual System ABE in Prime-Order Groups via Predicate Encodings
- 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
- Unbounded HIBE and Attribute-Based Encryption
- Semi-adaptive Security and Bundling Functionalities Made Generic and Easy
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Lossy Trapdoor Functions and Their Applications
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Round-Optimal Black-Box Two-Party Computation
- Bilinear Entropy Expansion from the Decisional Linear Assumption
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Bounded-concurrent secure multi-party computation with a dishonest majority
- New notions of security
- Bounded-concurrent secure two-party computation without setup assumptions
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Fully Secure Unbounded Inner-Product and Attribute-Based Encryption
- A Unified Framework for UC from Only OT
- Partial Garbling Schemes and Their Applications
- A unified framework for concurrent security
- Non-malleability amplification
- Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way
- Fuzzy Identity-Based Encryption
- Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More
- Concurrent Non-malleable Commitments from Any One-Way Function
- Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol
- Dual System Encryption via Predicate Encodings
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: Unbounded ABE via bilinear entropy expansion, revisited
