Better security for deterministic public-key encryption: the auxiliary-input setting

DOI10.1007/978-3-642-22792-9_31MaRDI QIDQ5199212zbMATH OpenOpenAlexFDO

Authors Zvika Brakerski, Gil Segev

Publication date 12 August 2011

Published in Advances in Cryptology – CRYPTO 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22792-9_31

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Better security for deterministic public-key encryption: the auxiliary-input setting
• Deterministic public key encryption and identity-based encryption from lattices in the auxiliary-input setting
• On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
• Deterministic public-key encryption for adaptively-chosen plaintext distributions
• Deterministic public-key encryption for adaptively chosen plaintext distributions

Cited in

(27)

• Incremental deterministic public-key encryption
• Deterministic public-key encryption for adaptively-chosen plaintext distributions
• A generic construction of CCA-secure deterministic encryption
• CCA-security from adaptive all-but-one lossy trapdoor functions
• Witness authenticating NIZKs and applications
• On ELFs, deterministic encryption, and correlated-input security
• Efficient cryptosystems from \(2^k\)-th power residue symbols
• A unified approach to deterministic encryption: new constructions and a connection to computational entropy
• Updatable all-but-one dual projective hashing and its applications
• Computational robust (fuzzy) extractors for CRS-dependent sources with minimal min-entropy
• Point-function obfuscation: a framework and generic constructions
• Deterministic Public-Key Encryption Under Continual Leakage
• Signature schemes secure against hard-to-invert leakage
• Deterministic public key encryption and identity-based encryption from lattices in the auxiliary-input setting
• How secure is deterministic encryption?
• Lossy key encapsulation mechanism and its applications
• Approximate-deterministic public key encryption from hard learning problems
• Towards tightly secure deterministic public key encryption
• Public-key encryption schemes with auxiliary inputs
• On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
• Deterministic public-key encryption for adaptively chosen plaintext distributions
• Functional encryption: deterministic to randomized functions from simple assumptions
• Multi-use deterministic public key proxy re-encryption from lattices in the auxiliary-input setting
• CCA security and trapdoor functions via key-dependent-message security
• Augmented random oracles
• Protecting distributed primitives against leakage: equivocal secret sharing and more
• Better security for deterministic public-key encryption: the auxiliary-input setting

This page was built for publication: Better security for deterministic public-key encryption: the auxiliary-input setting

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