Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk)
From MaRDI portal
Publication:5502804
Recommendations
Cites work
- scientific article; zbMATH DE number 1583775 (Why is no real title available?)
- scientific article; zbMATH DE number 1302836 (Why is no real title available?)
- scientific article; zbMATH DE number 2086699 (Why is no real title available?)
- scientific article; zbMATH DE number 2086723 (Why is no real title available?)
- A unified and generalized treatment of authentication theory
- Advances in Cryptology - EUROCRYPT 2004
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- Authentication Theory/Coding Theory
- Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
- Bounded CCA2-Secure Encryption
- Codes Which Detect Deception
- Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
- 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
- Information Security and Privacy
- Probabilistic encryption
- Relations Among Notions of Non-malleability for Encryption
- Unconditionally Secure Anonymous Encryption and Group Authentication
- Unconditionally secure chaffing and winnowing with short authentication tags
- Unconditionally secure chaffing-and-winnowing for multiple use
- Using hash functions as a hedge against chosen ciphertext attack
Cited in
(3)
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)