How to fool an unbounded adversary with a short key

DOI10.1109/TIT.2005.864438zbMath1317.94133MaRDI QIDQ3547568

Alexander Russell, Hong Wang

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

Unconditionally secure short key ciphers based on data compression and randomization ⋮ Rosenthal type inequalities for random variables ⋮ Incremental deterministic public-key encryption ⋮ Deterministic public-key encryption for adaptively-chosen plaintext distributions ⋮ Attainable unconditional security for shared-key cryptosystems ⋮ A unified approach to deterministic encryption: new constructions and a connection to computational entropy ⋮ Better security for deterministic public-key encryption: the auxiliary-input setting ⋮ Quantum encryption and generalized Shannon impossibility

This page was built for publication: How to fool an unbounded adversary with a short key