Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk)

DOI10.1007/978-3-540-85093-9_21zbMath1162.94325OpenAlexW1484738404MaRDI QIDQ5502804

Goichiro Hanaoka

Publication date: 9 January 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-85093-9_21

Mathematics Subject Classification ID

Cryptography (94A60) Information theory (general) (94A15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unconditionally secure chaffing and winnowing with short authentication tags
• Probabilistic encryption
• Families of finite sets in which no set is covered by the union of \(r\) others
• Families of finite sets in which no set is covered by the union of two others
• Bounded CCA2-Secure Encryption
• Relations Among Notions of Non-malleability for Encryption
• Unconditionally Secure Chaffing-and-Winnowing for Multiple Use
• Authentication Theory/Coding Theory
• Codes Which Detect Deception
• Unconditionally Secure Anonymous Encryption and Group Authentication
• A unified and generalized treatment of authentication theory
• Advances in Cryptology - EUROCRYPT 2004
• Information Security and Privacy
• Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
• Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes