Fast, compact, and expressive attribute-based encryption
From MaRDI portal
Publication:2234469
DOI10.1007/s10623-021-00939-8zbMath1475.94171OpenAlexW4205089155WikidataQ123229249 ScholiaQ123229249MaRDI QIDQ2234469
Junichi Tomida, Yuto Kawahara, Ryo Nishimaki
Publication date: 19 October 2021
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-021-00939-8
Related Items (3)
TinyABE: unrestricted ciphertext-policy attribute-based encryption for embedded devices and low-quality networks ⋮ A generic construction of CCA-secure attribute-based encryption with equality test ⋮ Formal Language Identity-based Cryptography
Cites Work
- An algebraic framework for Diffie-Hellman assumptions
- Unbounded ABE via bilinear entropy expansion, revisited
- Be adaptive, avoid overcommitting
- Secure integration of asymmetric and symmetric encryption schemes
- Updating key size estimations for pairings
- Compact adaptively secure ABE for \(\mathrm{NC}^1\) from \(k\)-lin
- Unbounded dynamic predicate compositions in attribute-based encryption
- Predicate encryption supporting disjunctions, polynomial equations, and inner products
- Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- Improved Dual System ABE in Prime-Order Groups via Predicate Encodings
- Efficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge Setting
- Decentralizing Attribute-Based Encryption
- The random oracle methodology, revisited
- Generic Constructions for Chosen-Ciphertext Secure Attribute Based Encryption
- Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
- Identity-Based Encryption from the Weil Pairing
- Fully Secure Unbounded Inner-Product and Attribute-Based Encryption
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Fuzzy Identity-Based Encryption
- A Framework and Compact Constructions for Non-monotonic Attribute-Based Encryption
- Topics in Cryptology – CT-RSA 2005
- Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
- Simplifying Design and Analysis of Complex Predicate Encryption Schemes
- Dual System Encryption via Predicate Encodings
- Unnamed Item
- Unnamed Item
This page was built for publication: Fast, compact, and expressive attribute-based encryption
