Fooling an unbounded adversary with a short key, repeatedly: The honey encryption perspective

DOI10.4230/LIPICS.ITC.2021.23zbMATH Open1517.94127OpenAlexW3188530052MaRDI QIDQ6107277

No author found.

Publication date: 3 July 2023

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2021/14342/pdf/LIPIcs-ITC-2021-23.pdf/

zbMATH Keywords

unconditional securityhoney encryptioninformation theoretic encryption

Mathematics Subject Classification ID

Cryptography (94A60) Communication theory (94A05)

Related Items (1)

Honey Encryption Beyond Message Recovery Security

Recommendations

• Unnamed Item 👍 👎
• Revisiting the wrong-key-randomization hypothesis 👍 👎
• Unclonable encryption, revisited 👍 👎
• On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes 👍 👎
• An Optimal Key Enumeration Algorithm and Its Application to Side-Channel Attacks 👍 👎
• A Unified Approach to Related-Key Attacks 👍 👎
• How to fool an unbounded adversary with a short key 👍 👎
• Unaligned Rebound Attack: Application to Keccak 👍 👎
• Honey Encryption: Security Beyond the Brute-Force Bound 👍 👎
• Implicit key-stretching security of encryption schemes 👍 👎

This page was built for publication: Fooling an unbounded adversary with a short key, repeatedly: The honey encryption perspective