Honey encryption: security beyond the brute-force bound

DOI10.1007/978-3-642-55220-5_17MaRDI QIDQ5418702zbMATH OpenOpenAlexFDO

Authors Ari Juels, Thomas Ristenpart

Publication date 27 May 2014

Published in Advances in Cryptology – EUROCRYPT 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-55220-5_17

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Honey Encryption Beyond Message Recovery Security
• Honey encryption for language. Robbing Shannon to pay Turing?
• Fooling an unbounded adversary with a short key, repeatedly: The honey encryption perspective
• scientific article; zbMATH DE number 1304288
• scientific article; zbMATH DE number 2086371

Cited in

(5)

• Honey encryption for language. Robbing Shannon to pay Turing?
• Honey Encryption Beyond Message Recovery Security
• Unconditionally secure short key ciphers based on data compression and randomization
• Fooling an unbounded adversary with a short key, repeatedly: The honey encryption perspective
• Honey encryption applied to Schnorr signature scheme

This page was built for publication: Honey encryption: security beyond the brute-force bound

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