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

DOI10.1007/S00145-012-9143-4zbMATH Open1297.94056OpenAlexW2087591603WikidataQ121811155 ScholiaQ121811155MaRDI QIDQ744600FDOQ744600

Authors: Zvika Brakerski, Gil Segev 

Publication date: 25 September 2014

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-012-9143-4

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

zbMATH Keywords

public-key encryptionauxiliary inputscomposable securitydeterministic encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Probabilistic encryption
• Theory of Cryptography
• Simultaneous Hardcore Bits and Cryptography against Memory Attacks
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Foundations of Cryptography
• Public-key encryption schemes with auxiliary inputs
• Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
• Circular-Secure Encryption from Decision Diffie-Hellman
• On cryptography with auxiliary input
• Public-Key Cryptosystems Resilient to Key Leakage
• A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
• More constructions of lossy and correlation-secure trapdoor functions
• On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
• Deterministic and Efficiently Searchable Encryption
• Title not available (Why is that?)
• A simple BGN-type cryptosystem from LWE
• Building Lossy Trapdoor Functions from Lossy Encryption
• Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More
• Incremental Deterministic Public-Key Encryption
• Lossy Trapdoor Functions and Their Applications
• How to fool an unbounded adversary with a short key
• Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
• Hedged public-key encryption: how to protect against bad randomness
• Theory of Cryptography

Cited In (2)

• Better security for deterministic public-key encryption: the auxiliary-input setting
• Reproducible circularly secure bit encryption: applications and realizations

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 Q744600)