Circular and KDM security for identity-based encryption

DOI10.1007/978-3-642-30057-8_20MaRDI QIDQ2900226zbMATH OpenOpenAlexFDO

Authors Jacob Alperin-Sheriff, Chris Peikert

Publication date 20 July 2012

Published in Public Key Cryptography – PKC 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-30057-8_20

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• KDM security for identity-based encryption: constructions and separations
• Master-key KDM-secure IBE from pairings
• Circular security is complete for KDM security
• Circular chosen-ciphertext security with compact ciphertexts
• Key dependent message security and receiver selective opening security for identity-based encryption

Cited in

(30)

• Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
• Anonymous IBE, leakage resilience and circular security from new assumptions
• New constructions of identity-based and key-dependent message secure encryption schemes
• An improved algorithm for learning sparse parities in the presence of noise
• Shorter lattice-based zero-knowledge proofs via one-time commitments
• Master-key KDM-secure ABE via predicate encoding
• Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
• KDM security for identity-based encryption: constructions and separations
• Efficient public-key encryption with equality test from lattices
• Worst-case to average-case reductions for module lattices
• Circular security is complete for KDM security
• Updatable public key encryption in the standard model
• Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
• Circular Security Separations for Arbitrary Length Cycles from LWE
• Fully secure functional encryption for inner products, from standard assumptions
• Identity-based encryption with master key-dependent message security and leakage-resilience
• Deniable Attribute Based Encryption for Branching Programs from LWE
• Improved (hierarchical) inner-product encryption from lattices
• Master-key KDM-secure IBE from pairings
• Separating semantic and circular security for symmetric-key bit encryption from the learning with errors assumption
• Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
• Efficient laconic cryptography from learning with errors
• BLOOM: bimodal lattice one-out-of-many proofs and applications
• Generic constructions of master-key KDM secure attribute-based encryption
• Toward practical lattice-based proof of knowledge from Hint-MLWE
• Lattice-Based DAPS and Generalizations: Self-enforcement in Signature Schemes
• Ring/module learning with errors under linear leakage -- hardness and applications
• Snake-eye resistant PKE from LWE for oblivious message retrieval and robust encryption
• Efficient identity-based encryption with tight adaptive anonymity from RLWE
• Hardness of M-LWE with general distributions and applications to leaky variants

This page was built for publication: Circular and KDM security for identity-based encryption

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