Theory of Cryptography

DOI10.1007/B106171zbMath1080.94523OpenAlexW4251449056WikidataQ59379672 ScholiaQ59379672MaRDI QIDQ5711664

No author found.

Publication date: 7 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b106171

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (15)

Unconditionally secure short key ciphers based on data compression and randomization ⋮ Instantiability of classical random-oracle-model encryption transforms ⋮ Incremental deterministic public-key encryption ⋮ Deterministic public-key encryption for adaptively-chosen plaintext distributions ⋮ Applications of non-uniquely decodable codes to privacy-preserving high-entropy data representation ⋮ A Provable-Security Treatment of the Key-Wrap Problem ⋮ On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles ⋮ Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles ⋮ Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker ⋮ Point-Function Obfuscation: A Framework and Generic Constructions ⋮ A unified approach to deterministic encryption: new constructions and a connection to computational entropy ⋮ Worst- and average-case privacy breaches in randomization mechanisms ⋮ Better security for deterministic public-key encryption: the auxiliary-input setting ⋮ Unnamed Item ⋮ Quantum encryption and generalized Shannon impossibility

This page was built for publication: Theory of Cryptography