Generic constructions of master-key KDM secure attribute-based encryption
From MaRDI portal
Publication:6146591
DOI10.1007/s10623-023-01296-4zbMath1530.94038OpenAlexW4386571479MaRDI QIDQ6146591
Benedikt Wagner, Chen Qian, Jia-xin Pan
Publication date: 15 January 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-023-01296-4
attribute-based encryptionidentity-based encryptionindistinguishability obfuscationgeneric constructionmaster-key KDM
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New bounds in some transference theorems in the geometry of numbers
- More efficient (almost) tightly secure structure-preserving signatures
- Key dependent message security and receiver selective opening security for identity-based encryption
- Master-key KDM-secure ABE via predicate encoding
- Fully secure attribute-based encryption for \(t\)-CNF from LWE
- KDM security for identity-based encryption: constructions and separations
- On the Key Dependent Message Security of the Fujisaki-Okamoto Constructions
- A Framework for Identity-Based Encryption with Almost Tight Security
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Bounded KDM Security from iO and OWF
- Identity-Based Encryption with Master Key-Dependent Message Security and Leakage-Resilience
- Circular and KDM Security for Identity-Based Encryption
- Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting
- Efficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge Setting
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- 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
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai Trees, or How to Delegate a Lattice Basis
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Master-Key KDM-Secure IBE from Pairings
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- A Note on Perfect Correctness by Derandomization
- New Techniques for Noninteractive Zero-Knowledge
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
- Tighter security proofs for GPV-IBE in the quantum random oracle model
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation from circular security
This page was built for publication: Generic constructions of master-key KDM secure attribute-based encryption