Does encryption with redundancy provide authenticity?

DOI10.1007/3-540-44987-6_31MaRDI QIDQ2778863zbMATH OpenFDO

Authors Jee Hea An, M. Bellare

Publication date 21 March 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2045/20450512

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Encode-then-encipher encryption: How to exploit nonces or redundancy in plaintexts for efficient cryptography
• Authenticated encryption: relations among notions and analysis of the generic composition paradigm
• Redundancy, obscurity, self-containment \& independence
• Authenticated encryption: Relations among notions and analysis of the generic composition paradigm
• Robust Encryption

Cited in

(5)

• Authenticated encryption: relations among notions and analysis of the generic composition paradigm
• Encode-then-encipher encryption: How to exploit nonces or redundancy in plaintexts for efficient cryptography
• A Provable-Security Treatment of the Key-Wrap Problem
• Redundancy, obscurity, self-containment \& independence
• Linearly homomorphic authenticated encryption with provable correctness and public verifiability

This page was built for publication: Does encryption with redundancy provide authenticity?

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