Alice and Bob
Alice and Bob are fictional characters commonly used as a placeholder name in cryptology, and in other science and engineering literature where there are several participants in a thought experiment. The Alice and Bob characters were invented by Ron Rivest, Adi Shamir, and Leonard Adleman in their 1978 paper "A Method for Obtaining Digital Signatures and Public-key Cryptosystems". Subsequently, they have become common archetypes in many scientific and engineering fields, such as quantum cryptography, game theory and physics. As the use of Alice and Bob became more widespread, additional characters were added, sometimes each with a particular meaning. These characters do not have to refer to humans; they refer to generic agents which might be different computers or even different programs running on a single computer.
Overview
Alice and Bob are the names of fictional characters used for convenience and to aid comprehension. For example, "How can Bob send a private message M to Alice in a public-key cryptosystem?" is believed to be easier to describe and understand than "How can B send a private message M to A in a public-key cryptosystem?"In cryptography and computer security, Alice and Bob are used extensively as participants in discussions about cryptographic protocols or systems. The names are conventional, and where relevant may use a rhyming mnemonic to associate the name with the typical role of that person.
History
Scientific papers about thought experiments with several participants often used letters to identify them, "A", "B", and "C", etc.The first mention of Alice and Bob in the context of cryptography was in Rivest, Shamir, and Adleman's 1978 article "A method for obtaining digital signatures and public-key cryptosystems." They wrote, "For our scenarios we suppose that A and B are two users of a public-key cryptosystem". Previous to this article, cryptographers typically referred to message senders and receivers as A and B, or other simple symbols. In fact, in the two previous articles by Rivest, Shamir, and Adleman, introducing the RSA cryptosystem, there is no mention of Alice and Bob. Possibly the choice of the first three names came from the film Bob & Carol & Ted & Alice.
Within a few years, however, reference to Alice and Bob in cryptological literature became a common trope. Cryptographers would often begin their academic papers with reference to Alice and Bob. For instance, Michael Rabin began his 1981 paper, "Bob and Alice each have a secret, SB and SA, respectively, which they want to exchange." Early on, Alice and Bob were starting to appear in other domains, such as in Manuel Blum's 1981 article, "Coin Flipping by Telephone: A Protocol for Solving Impossible Problems," which begins, "Alice and Bob want to flip a coin by telephone."
Although Alice and Bob were invented with no reference to their personality, authors soon began adding colorful descriptions. In 1983, Blum invented a backstory about a troubled relationship between Alice and Bob, writing, "Alice and Bob, recently divorced, mutually distrustful, still do business together. They live on opposite coasts, communicate mainly by telephone, and use their computers to transact business over the telephone." In 1984, John Gordon delivered his famous "After Dinner Speech" about Alice and Bob, which he imagines to be the first "definitive biography of Alice and Bob."
In addition to adding backstories and personalities to Alice and Bob, authors soon added other characters, with their own personalities. The first to be added was Eve, the "eavesdropper." Eve was invented in 1988 by Charles Bennet, Gilles Brassard, and Jean-Marc Robert, in their paper, "Privacy Amplification by Public Discussion." In Bruce Schneier's book Applied Cryptography, other characters are listed.
Cast of characters
The most common characters are Alice and Bob. Eve, Mallory, and Trent are also common names, and have fairly well-established "personalities". The names often use rhyming mnemonics where different players have different motives. Other names are much less common, and flexible in use. Sometimes the sexes are alternated: Alice, Bob, Carol, Dave, Eve...- Alice and Bob. The original, generic characters. Generally, Alice and Bob want to exchange a message or cryptographic key.
- Carol, Carlos or Charlie. A generic third participant.
- Chuck. A third participant, usually of malicious intent.
- Craig. A password cracker, often encountered in situations with stored passwords.
- Dan, Dave or David. A generic fourth participant.
- Erin. A generic fifth participant, but rarely used, as "E" is usually reserved for Eve.
- Eve. An eavesdropper, who is usually a passive attacker. While they can listen in on messages between Alice and Bob, they cannot modify them. In quantum cryptography, Eve may also represent the environment.
- Faythe. A trusted advisor, courier or intermediary. Faythe is used infrequently, and is associated with Faith and Faithfulness. Faythe may be a repository of key service or courier of shared secrets.
- Frank. A generic sixth participant.
- Grace. A government representative. For example, Grace may try to force Alice or Bob to implement backdoors in their protocols. Grace may also deliberately weaken standards.
- Heidi. A mischievous designer for cryptographic standards, but rarely used.
- Ivan. An Issuer, mentioned first by Ian Grigg in the context of Ricardian contracts.
- Judy. A judge who may be called upon to resolve a potential dispute between participants.
- Mallory or Mallet A malicious attacker. Associated with Trudy, an intruder. Unlike the passive Eve, Mallory/Mallet is an active attacker, who can modify messages, substitute messages, or replay old messages. The difficulty of securing a system against Mallory/Mallet is much greater than against Eve.
- Michael, or Mike. Used as an alternative to the eavesdropper Eve. See Microphone.
- Niaj. Used as an alternative to the eavesdropper Eve in several South Asian nations.
- Olivia. An oracle, who provides external data to smart contracts residing on distributed ledger systems.
- Oscar. An opponent, similar to Mallory, but not necessarily malicious.
- Peggy, or Pat. A prover, who interacts with the verifier to show that the intended transaction has actually taken place. Peggy is often found in zero-knowledge proofs.
- Rupert. A repudiator who appears for interactions that desire Non-repudiation.
- Sybil. A pseudonymous attacker, who usually uses a large number of identities. For example, Sybil may attempt to subvert a reputation system. See Sybil attack.
- Trent or Ted. A trusted arbitrator, who acts as a neutral third party.
- Trudy. An intruder.
- Victor, or Vanna. A verifier, who requires proof from the prover.
- Walter. A warden, who may guard Alice and Bob.
- Wendy. A whistleblower, who is an insider with privileged access capable of divulging information.
- Arthur and Merlin: Merlin provides answers, and Arthur asks questions. Merlin has unbounded computational ability. In interactive proof systems, Merlin claims the truth of a statement, and Arthur, questions him to verify the claim.
- Paul and Carole. Paul asks questions, and Carole provides answers. In the solution of the Twenty Questions problem, "Paul" asked questions and "Carole" answered them. Paul and Carole were also used in combinatorial games, in the roles of Pusher and Chooser.
- Arthur and Bertha. Arthur is the "Left", "Black", or "Vertical" player, and Bertha is the "Right", "White", or "Horizontal" player in a combinatorial game. Additionally, Arthur, given the same outcome, prefers a game to take the fewest moves. Bertha likewise prefers a game to take the most number of moves.
Physics