(Enter summary)
Abstract: . In a cryptographic protocol, it is important for a recipient to
determine that a message has not been modified during transmission. This
is normally achieved by providing redundancy in the message. Typically, a
message is described in the literature as containing enough redundancy, not
enough redundancy, or no redundancy at all. This note shows that, because
of the secrecy that comes with encryption, redundancy can be provided at
two different levels. An example demonstrates that this... (Update)
Context of citations to this paper: More
...and Boyd [12] have recently investigated ways of protecting against such attacks. Aspects of redundancy have also been addressed by Gong [8]. Protocols using passwords have been addressed by several authors [2] 9] Carlsen [5] has a category called elementary flaws which is...
.... cannot contain any non random padding to match the encryption blocksize, nor can it contain any form of error detecting checksum [17]. Otherwise, an attacker could use these indicators when guessing at P . Protection against communications errors must be provided by lower...
Cited by: More
Preventing Guessing Attacks Using Fingerprint - Alves-Foss
(Correct)
Private Computing: The Trusted Digital Assistant - Stabell-Kulø
(Correct)
A Method for Examining Cryptographic Protocols - Tjaden (1997)
(Correct)
Active bibliography (related documents): More All
0.5: Protecting Poorly Chosen Secrets from Guessing Attacks - Gong, Lomas, Needham, Saltzer (1993)
(Correct)
0.3: Security for a High Performance Commodity Storage Subsystem - Gobioff (1999)
(Correct)
0.1: Encrypted Key Exchange: Password-Based Protocols Secure.. - Bellovin, Merritt (1992)
(Correct)
Similar documents based on text: More All
0.0: The Epistemics of Encryption - Bleeker, van Eijck (2000)
(Correct)
0.0: Earnings Management to Exceed Thresholds - Gegeorge, al. (1999)
(Correct)
0.0: Incorporating Guarded Execution into Existing Instruction Sets - Pnevmatikatos (1996)
(Correct)
Related documents from co-citation: More All
5: A method for obtaining digital signatures and public-key cryptosystems; Communic..
- Rivest, Shamir et al. - 1978
3: New directions in cryptography
- Diffie, Hellman - 1976
3: Limitations of the Kerberos Authentication System
- Bellovin, Merritt - 1991
BibTeX entry: (Update)
L. Gong, "A Note on Redundancy in Encrypted Messages", ACM Computer Communication Review, Vol.20, No.5, October, 1990, pp.18-22. http://citeseer.ist.psu.edu/gong90note.html More
@article{ gong90note,
author = "Li Gong",
title = "{A Note on Redundancy in Encrypted Messages}",
journal = "Computer Communication Review",
volume = "20",
number = "5",
pages = "18--22",
year = "1990",
url = "citeseer.ist.psu.edu/gong90note.html" }
Citations (may not include all citations):
450
Using Encryption for Authentication in Large Networks of Com.. (context) - Needham, Schroeder - 1978
317
Kerberos: An Authentication Service for Open Network Systems
- Steiner, Neuman et al. - 1988
227
Privacy Enhancement for Internet Electronic Mail: Part II --..
- Kent, Linn - 1989
227
Privacy Enhancement for Internet Electronic Mail: Part I -- ..
- Linn - 1989
44
Reducing Risks from Poorly Chosen Keys
- Lomas, Gong et al. - 1989
7
Verifiable-Text Attacks in Cryptographic Protocols (context) - Gong - 1990
3
Financial Institution Message Authentication (Wholesale (context) - Standard - 1986
Documents on the same site (http://java.sun.com/people/gong/papers/pubs90.html): More
Using One-Way Functions for Authentication - Gong (1989)
(Correct)
Reducing Risks from Poorly Chosen Keys - Mark Lomas (1989)
(Correct)
A Matrix Key Distribution Scheme - Li Gong (1990)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC