Tag-based ABE in prime-order groups via pair encoding
From MaRDI portal
Publication:2043416
DOI10.1007/s10623-021-00894-4zbMath1469.94115OpenAlexW3167465005MaRDI QIDQ2043416
Publication date: 2 August 2021
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-021-00894-4
Related Items
Cites Work
- An algebraic framework for Diffie-Hellman assumptions
- Verifiability-based conversion from CPA to CCA-secure predicate encryption
- Unbounded ABE via bilinear entropy expansion, revisited
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- ABE with tag made easy. Concise framework and new instantiations in prime-order groups
- CCA-secure predicate encryption from pair encoding in prime order groups: generic and efficient
- Fully secure functional encryption with a large class of relations from the decisional linear assumption
- Delegation-based conversion from CPA to CCA-secure predicate encryption
- Advances in cryptology -- EUROCRYPT 2020. 39th annual international conference on the theory and applications of cryptographic techniques, Zagreb, Croatia, May 10--14, 2020. Proceedings. Part III
- Adaptively secure ABE for DFA from \(k\)-Lin and more
- CCA-secure ABE using tag and pair encoding
- Attribute based encryption for deterministic finite automata from DLIN
- Compact adaptively secure ABE for \(\mathrm{NC}^1\) from \(k\)-lin
- Unbounded dynamic predicate compositions in attribute-based encryption
- ABE for DFA from \(k\)-lin
- Attribute-based encryption (and more) for nondeterministic finite automata from LWE
- Unbounded dynamic predicate compositions in ABE from standard assumptions
- Succinct and adaptively secure ABE for ABP from \(k\)-Lin
- 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
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- Verifiable Predicate Encryption and Applications to CCA Security and Anonymous Predicate Authentication
- New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques
- Functional Encryption for Regular Languages
- Improved Dual System ABE in Prime-Order Groups via Predicate Encodings
- Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings
- Unbounded HIBE and Attribute-Based Encryption
- Secret-Sharing Schemes: A Survey
- Generic Constructions for Chosen-Ciphertext Secure Attribute Based Encryption
- Attribute-Based Encryption for Circuits
- Semi-adaptive Security and Bundling Functionalities Made Generic and Easy
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Predicate Encryption for Circuits from LWE
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Fully Secure Unbounded Inner-Product and Attribute-Based Encryption
- Fuzzy Identity-Based Encryption
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More
- Simplifying Design and Analysis of Complex Predicate Encryption Schemes
- Dual System Encryption via Predicate Encodings
