Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice
From MaRDI portal
Publication:2678984
DOI10.1007/s10623-022-01093-5zbMath1506.94070OpenAlexW3204244463WikidataQ114849670 ScholiaQ114849670MaRDI QIDQ2678984
Marloes Venema, Greg Alpár, Jaap-Henk Hoepman
Publication date: 18 January 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01093-5
Related Items (3)
A practical compiler for attribute-based encryption: new decentralized constructions and more ⋮ GLUE: generalizing unbounded attribute-based encryption for flexible efficiency trade-offs ⋮ TinyABE: unrestricted ciphertext-policy attribute-based encryption for embedded devices and low-quality networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A bunch of broken schemes: a simple yet powerful linear approach to analyzing security of attribute-based encryption
- The random oracle model: a twenty-year retrospective
- Pairings for cryptographers
- Unbounded ABE via bilinear entropy expansion, revisited
- Time-based direct revocable ciphertext-policy attribute-based encryption with short revocation List
- ABE with tag made easy. Concise framework and new instantiations in prime-order groups
- Updating key size estimations for pairings
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
- Generic negation of pair encodings
- Server-aided revocable attribute-based encryption
- Making \textit{any} attribute-based encryption accountable, efficiently
- Decentralized policy-hiding ABE with receiver privacy
- Unbounded dynamic predicate compositions in attribute-based encryption
- Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
- Another look at tightness. II: Practical issues in cryptography
- Unbounded dynamic predicate compositions in ABE from standard assumptions
- Succinct and adaptively secure ABE for ABP from \(k\)-Lin
- Duality in ABE: Converting Attribute Based Encryption for Dual Predicate and Dual Policy via Computational Encodings
- Practical Ciphertext-Policy Attribute-Based Encryption: Traitor Tracing, Revocation, and Large Universe
- A Study of Pair Encodings: Predicate Encryption in Prime Order Groups
- Conversions Among Several Classes of Predicate Encryption and Applications to ABE with Various Compactness Tradeoffs
- Attribute Based Encryption with Direct Efficiency Tradeoff
- Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- Attribute-Based Encryption for Circuits from Multilinear Maps
- Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups
- Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
- Threshold Ciphertext Policy Attribute-Based Encryption with Constant Size Ciphertexts
- New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques
- Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption
- Semi-adaptive Attribute-Based Encryption and Improved Delegation for Boolean Formula
- Expressive Attribute-Based Encryption with Constant-Size Ciphertexts from the Decisional Linear Assumption
- Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption
- Improved Dual System ABE in Prime-Order Groups via Predicate Encodings
- Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Unbounded HIBE and Attribute-Based Encryption
- Decentralizing Attribute-Based Encryption
- How to share a secret
- The random oracle methodology, revisited
- Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
- Generic Constructions for Chosen-Ciphertext Secure Attribute Based Encryption
- Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts
- Efficient Ciphertext Policy Attribute-Based Encryption with Constant-Size Ciphertext and Constant Computation-Cost
- Fully Secure Multi-authority Ciphertext-Policy Attribute-Based Encryption without Random Oracles
- Attribute-Based Encryption for Circuits
- How Risky Is the Random-Oracle Model?
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Conjunctive Broadcast and Attribute-Based Encryption
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Bilinear Entropy Expansion from the Decisional Linear Assumption
- Attribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures
- Constant Size Ciphertexts in Threshold Attribute-Based Encryption
- Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation
- Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
- Security Analysis of the Strong Diffie-Hellman Problem
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Multi-authority Attribute Based Encryption
- The Uber-Assumption Family
- Identity-Based Proxy Re-encryption
- Removing Escrow from Identity-Based Encryption
- Attribute-Based Encryption Supporting Direct/Indirect Revocation Modes
- New directions in cryptography
- Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
- Fully Secure Attribute-Based Systems with Short Ciphertexts/Signatures and Threshold Access Structures
- Attribute-Based Functional Encryption on Lattices
- Fully Secure Unbounded Inner-Product and Attribute-Based Encryption
- Decentralized Attribute-Based Signatures
- Attribute-Based Encryption with Fast Decryption
- Secure integration of asymmetric and symmetric encryption schemes
- Fast, Compact, and Expressive Attribute-Based Encryption
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Fuzzy Identity-Based Encryption
- A Framework and Compact Constructions for Non-monotonic Attribute-Based Encryption
- Online/Offline Attribute-Based Encryption
- Why Proving HIBE Systems Secure Is Difficult
- Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More
- Pairing-Friendly Elliptic Curves of Prime Order
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Secure Threshold Multi Authority Attribute Based Encryption without a Central Authority
- Fast Software Encryption
- Simplifying Design and Analysis of Complex Predicate Encryption Schemes
- Dual System Encryption via Predicate Encodings
This page was built for publication: Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice
