Adaptive Security via Deletion in Attribute-Based Encryption: Solutions from Search Assumptions in Bilinear Groups
From MaRDI portal
Publication:6041288
DOI10.1007/978-3-030-92068-5_11zbMATH Open1515.94070OpenAlexW3158550400MaRDI QIDQ6041288FDOQ6041288
Authors: Rishab Goyal, Jiahui Liu, Brent Waters 
Publication date: 26 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92068-5_11
Recommendations
- Adaptively Secure Unrestricted Attribute-Based Encryption with Subset Difference Revocation in Bilinear Groups of Prime Order
- Security-level switchable attribute-based encryption under the strictly weaker assumption family
- New proof techniques for DLIN-based adaptively secure attribute-based encryption
- Fast, compact, and expressive attribute-based encryption
- Fast, compact, and expressive attribute-based encryption
Cites Work
- Probabilistic encryption
- A method for obtaining digital signatures and public-key cryptosystems
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Practical Identity-Based Encryption Without Random Oracles
- New directions in cryptography
- Title not available (Why is that?)
- Fuzzy Identity-Based Encryption
- Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
- Fully secure functional encryption with general relations from the decisional linear assumption
- New proof methods for attribute-based encryption: achieving full security through selective techniques
- Decentralizing 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
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Constrained pseudorandom functions and their applications
- Functional signatures and pseudorandom functions
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Semi-adaptive security and bundling functionalities made generic and easy
- Predicate encryption for circuits from LWE
- Attribute-based functional encryption on lattices
- Fully secure attribute-based encryption for \(t\)-CNF from LWE
- Adaptively secure constrained pseudorandom functions in the standard model
Cited In (2)
This page was built for publication: Adaptive Security via Deletion in Attribute-Based Encryption: Solutions from Search Assumptions in Bilinear Groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041288)
