paper "Chaffing and Winnowing: Confidentiality without Encryption"
E487735
"Chaffing and Winnowing: Confidentiality without Encryption" is a paper by Ronald L. Rivest that proposes a method for achieving data confidentiality without using traditional encryption, instead relying on message authentication codes and the separation of valid and invalid data.
All labels observed (1)
| Label | Occurrences |
|---|---|
| paper "Chaffing and Winnowing: Confidentiality without Encryption" canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T5028189 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: paper "Chaffing and Winnowing: Confidentiality without Encryption" Context triple: [Chaffing and winnowing, publishedIn, paper "Chaffing and Winnowing: Confidentiality without Encryption"]
-
A.
New Directions in Cryptography
New Directions in Cryptography is a landmark 1976 paper that introduced the concepts of public-key cryptography and digital signatures, fundamentally reshaping modern cryptography and secure communications.
-
B.
Secrecy, Authentication, and Public Key Systems
"Secrecy, Authentication, and Public Key Systems" is Ralph Merkle's influential doctoral thesis that helped lay the foundations of modern public-key cryptography and secure communication protocols.
-
C.
Probabilistic Encryption
Probabilistic Encryption is a cryptographic technique that uses randomness in the encryption process so that the same message encrypts to different ciphertexts, enhancing security against attackers.
-
D.
Merkle puzzles
Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
-
E.
Shamir secret sharing scheme
The Shamir secret sharing scheme is a cryptographic method that divides a secret into multiple parts so that only a specified threshold of parts can reconstruct the original secret, while fewer parts reveal nothing.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: paper "Chaffing and Winnowing: Confidentiality without Encryption" Target entity description: "Chaffing and Winnowing: Confidentiality without Encryption" is a paper by Ronald L. Rivest that proposes a method for achieving data confidentiality without using traditional encryption, instead relying on message authentication codes and the separation of valid and invalid data.
-
A.
New Directions in Cryptography
New Directions in Cryptography is a landmark 1976 paper that introduced the concepts of public-key cryptography and digital signatures, fundamentally reshaping modern cryptography and secure communications.
-
B.
Secrecy, Authentication, and Public Key Systems
"Secrecy, Authentication, and Public Key Systems" is Ralph Merkle's influential doctoral thesis that helped lay the foundations of modern public-key cryptography and secure communication protocols.
-
C.
Probabilistic Encryption
Probabilistic Encryption is a cryptographic technique that uses randomness in the encryption process so that the same message encrypts to different ciphertexts, enhancing security against attackers.
-
D.
Merkle puzzles
Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
-
E.
Shamir secret sharing scheme
The Shamir secret sharing scheme is a cryptographic method that divides a secret into multiple parts so that only a specified threshold of parts can reconstruct the original secret, while fewer parts reveal nothing.
- F. None of above. chosen
Statements (45)
| Predicate | Object |
|---|---|
| instanceOf |
academic paper
ⓘ
cryptography paper ⓘ |
| addresses | data confidentiality ⓘ |
| argues |
MACs can be used to hide information content
ⓘ
regulating encryption does not prevent confidentiality ⓘ |
| assumes | sender and receiver share a secret MAC key ⓘ |
| author | Ronald L. Rivest NERFINISHED ⓘ |
| basedOn | MAC tags attached to message blocks ⓘ |
| category | applied cryptography literature ⓘ |
| contributesTo | discussion of alternatives to traditional encryption ⓘ |
| criticizes | legal restrictions on encryption ⓘ |
| demonstrates |
confidentiality can be achieved without encryption algorithms
ⓘ
separation of authenticity and confidentiality ⓘ |
| distinguishes | authentic packets from bogus packets ⓘ |
| field |
cryptography
ⓘ
information security ⓘ |
| goal | evade legal restrictions on encryption while preserving confidentiality ⓘ |
| hasAbbreviation | Chaffing and Winnowing NERFINISHED ⓘ |
| hasTitle | Chaffing and Winnowing: Confidentiality without Encryption NERFINISHED ⓘ |
| illustratesWith | analogy to separating wheat from chaff ⓘ |
| influencedBy | contemporary U.S. cryptography export laws ⓘ |
| introducesConcept |
chaffing
ⓘ
winnowing ⓘ |
| language | English ⓘ |
| motivatedBy | export controls on encryption ⓘ |
| property | third parties cannot distinguish real data from chaff without the MAC key ⓘ |
| proposes |
adding bogus packets with invalid MACs as chaff
ⓘ
method for achieving data confidentiality without encryption ⓘ receiver discards packets with invalid MACs ⓘ |
| publicationType | technical report ⓘ |
| relatedTo |
Clipper chip debate
ⓘ
data privacy without encryption ⓘ encryption policy debates ⓘ key escrow controversy ⓘ message authentication ⓘ steganographic techniques ⓘ |
| reliesOn | separation of valid and invalid data ⓘ |
| securityAssumption | MAC is unforgeable without the secret key ⓘ |
| securityMechanism | message authentication code ⓘ |
| securityProperty | confidentiality ⓘ |
| techniqueType | non-encryption confidentiality technique ⓘ |
| topic |
confidential communication
ⓘ
exportable security mechanisms ⓘ |
| uses |
message authentication codes
ⓘ
shared secret key for MAC computation ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: paper "Chaffing and Winnowing: Confidentiality without Encryption" Description of subject: "Chaffing and Winnowing: Confidentiality without Encryption" is a paper by Ronald L. Rivest that proposes a method for achieving data confidentiality without using traditional encryption, instead relying on message authentication codes and the separation of valid and invalid data.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
Chaffing and winnowing
→
publishedIn
→
paper "Chaffing and Winnowing: Confidentiality without Encryption"
ⓘ