Circular and KDM Security for Identity-Based Encryption
From MaRDI portal
Publication:2900226
DOI10.1007/978-3-642-30057-8_20zbMath1294.94030OpenAlexW157865340MaRDI QIDQ2900226
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
Related Items (21)
Master-Key KDM-Secure IBE from Pairings ⋮ Deniable Attribute Based Encryption for Branching Programs from LWE ⋮ Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ 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 ⋮ Updatable public key encryption in the standard model ⋮ KDM security for identity-based encryption: constructions and separations ⋮ Efficient public-key encryption with equality test from lattices ⋮ Improved (Hierarchical) Inner-Product Encryption from Lattices ⋮ Separating IND-CPA and Circular Security for Unbounded Length Key Cycles ⋮ 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 ⋮ 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 ⋮ Worst-case to average-case reductions for module lattices ⋮ Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption
This page was built for publication: Circular and KDM Security for Identity-Based Encryption
