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

DOI10.1007/978-3-540-85093-9_21zbMATH Open1162.94325OpenAlexW1484738404MaRDI QIDQ5502804FDOQ5502804

Authors: 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

Recommendations

• Nonmalleable Cryptography
• Characterization of security notions for probabilistic private-key encryption
• Nonmalleable Cryptography
• Non-malleable encryption: simpler, shorter, stronger
• Relations Among Notions of Non-malleability for Encryption

Mathematics Subject Classification ID

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

Cites Work

• Probabilistic encryption
• Families of finite sets in which no set is covered by the union of two others
• Title not available (Why is that?)
• Codes Which Detect Deception
• Title not available (Why is that?)
• Authentication Theory/Coding Theory
• Title not available (Why is that?)
• Families of finite sets in which no set is covered by the union of \(r\) others
• Advances in Cryptology - EUROCRYPT 2004
• Title not available (Why is that?)
• Using hash functions as a hedge against chosen ciphertext attack
• Unconditionally secure chaffing and winnowing with short authentication tags
• Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
• Bounded CCA2-Secure Encryption
• Relations Among Notions of Non-malleability for Encryption
• Unconditionally Secure Anonymous Encryption and Group Authentication
• Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
• Information Security and Privacy
• A unified and generalized treatment of authentication theory
• Unconditionally secure chaffing-and-winnowing for multiple use
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Cited In (3)

• Title not available (Why is that?)
• Symmetric-key encryption scheme with multi-ciphertext non-malleability
• Characterization of the relations between information-theoretic non-malleability, secrecy, and authenticity

This page was built for publication: Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk)

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