Generic constructions of master-key KDM secure attribute-based encryption

DOI10.1007/S10623-023-01296-4zbMATH Open1530.94038OpenAlexW4386571479MaRDI QIDQ6146591FDOQ6146591

Authors: Jia-xin Pan, Chen Qian, Benedikt Wagner 

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

Recommendations

• Master-key KDM-secure ABE via predicate encoding
• Master-key KDM-secure IBE from pairings
• KDM security for identity-based encryption: constructions and separations
• Identity-based encryption with master key-dependent message security and leakage-resilience
• Efficient circuit-size independent public key encryption with KDM security

zbMATH Keywords

identity-based encryptionattribute-based encryptiongeneric constructionindistinguishability obfuscationmaster-key KDM

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Fully homomorphic encryption using ideal lattices
• Public-key cryptosystems from the worst-case shortest vector problem
• On lattices, learning with errors, random linear codes, and cryptography
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Classical hardness of learning with errors
• Title not available (Why is that?)
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• New bounds in some transference theorems in the geometry of numbers
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• Title not available (Why is that?)
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Title not available (Why is that?)
• A Framework for Identity-Based Encryption with Almost Tight Security
• Identity-based encryption with master key-dependent message security and leakage-resilience
• Title not available (Why is that?)
• New techniques for noninteractive zero-knowledge
• Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting
• More efficient (almost) tightly secure structure-preserving signatures
• Key dependent message security and receiver selective opening security for identity-based encryption
• Circular and KDM security for identity-based encryption
• Efficient IBE with tight reduction to standard assumption in the multi-challenge setting
• Tighter security proofs for GPV-IBE in the quantum random oracle model
• Fully secure attribute-based encryption for \(t\)-CNF from LWE
• A note on perfect correctness by derandomization
• Master-key KDM-secure ABE via predicate encoding
• Master-key KDM-secure IBE from pairings
• Indistinguishability obfuscation from well-founded assumptions
• Indistinguishability obfuscation from circular security
• KDM security for identity-based encryption: constructions and separations
• Bounded KDM security from iO and OWF
• On the key dependent message security of the Fujisaki-Okamoto constructions

This page was built for publication: Generic constructions of master-key KDM secure attribute-based encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6146591)