Alice and Bob are fictional characters commonly used as placeholders in discussions aboutcryptographic systems andprotocols,[1] and in other science and engineering literature where there are several participants in athought experiment. The Alice and Bob characters were created byRon Rivest,Adi Shamir, andLeonard Adleman in their 1978 paper "A Method for Obtaining Digital Signatures and Public-key Cryptosystems".[2] Subsequently, they have become commonarchetypes in many scientific and engineering fields, such asquantum cryptography,game theory andphysics.[3] 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 people; they refer to generic agents which might be different computers or even different programs running on a single computer.
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?"[2] is believed to be easier to describe and understand than if the hypothetical people were simply namedA andB as in "How can B send a private message M to A in a public-key cryptosystem?"
The names are conventional, and where relevant may use analliterativemnemonic such as "Mallory" for "malicious" to associate the name with the typical role of that person.
Scientific papers about thought experiments with several participants often used letters to identify them:A,B,C, etc.
The first mention of Alice and Bob in the context of cryptography was inRivest,Shamir, andAdleman's 1978 article "A method for obtaining digital signatures and public-key cryptosystems."[2] They wrote, "For our scenarios we suppose that A and B (also known as Alice and Bob) are two users of a public-key cryptosystem".[2]: 121 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 theRSA cryptosystem, there is no mention of Alice and Bob.[4][5] The choice of the first three names may have come from the filmBob & Carol & Ted & Alice.[6]
Within a few years, however, references to Alice and Bob in cryptological literature became a commontrope. 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."[7] Early on, Alice and Bob were starting to appear in other domains, such as inManuel 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."[8]
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."[9] In 1984, John Gordon delivered his famous[10] "After Dinner Speech" about Alice and Bob, which he imagines to be the first "definitive biography of Alice and Bob."[11]
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."[12] InBruce Schneier's bookApplied Cryptography, other characters are listed.[13]
 | This sectionneeds additional citations forverification. Please helpimprove this article byadding citations to reliable sources in this section. Unsourced material may be challenged and removed.(May 2023) (Learn how and when to remove this message) |
The most common characters are Alice and Bob. Eve, Mallory, and Trent are also common names, and have fairly well-established "personalities" (or functions). The names often use alliterative mnemonics (for example, Eve, "eavesdropper"; Mallory, "malicious") where different players have different motives. Other names are much less common and more flexible in use. Sometimes the genders are alternated: Alice, Bob, Carol, Dave, Eve, etc.[14]
| Alice andBob | The original, generic characters. Generally, Alice and Bob want to exchange a message or cryptographic key. |
| Carol,Carlos orCharlie | A generic third participant. |
| Chuck orChad | A third participant, usually of malicious intent.[15] |
| Craig | Apassword cracker, often encountered in situations with stored passwords. |
| Dan,Dave orDavid | A generic fourth participant. |
| Erin | A generic fifth participant, but rarely used, as "E" is usually reserved for Eve. |
| Eve orYves | Aneavesdropper, who is usually a passive attacker. While they can listen in on messages between Alice and Bob, they cannot modify them. Inquantum cryptography, Eve may also represent theenvironment.[clarification needed] |
| Faythe | Atrustedadvisor, courier or intermediary. Faythe is used infrequently, and is associated withfaith andfaithfulness. Faythe may be a repository of key service or courier of shared secrets.[citation needed] |
| Frank | A generic sixth participant. |
| Grace | Agovernment representative. For example, Grace may try to force Alice or Bob to implement backdoors in their protocols. Grace may also deliberately weaken standards.[16] |
| Heidi | Amischievous designer for cryptographic standards, but rarely used.[17] |
| Ivan | Anissuer, mentioned first by Ian Grigg in the context ofRicardian contracts.[18] |
| Judy | Ajudge who may be called upon to resolve a potential dispute between participants. SeeJudge Judy. |
| Mallory[19][20][21] or (less commonly)Mallet[22][23][24][25] orDarth[26] | Amalicious attacker. Associated with Trudy, anintruder. Unlike the passive Eve, Mallory is an active attacker (often used inman-in-the-middle attacks), who can modify messages, substitute messages, or replay old messages. The difficulty of securing a system against a Mallory is much greater than against an Eve. |
| Michael orMike | Used as an alternative to the eavesdropper Eve, frommicrophone. |
| Niaj | Used as an alternative to the eavesdropper Eve in several South Asian nations.[27] |
| Olivia | Anoracle, who responds to queries from other participants. Olivia often acts as a "black box" with some concealed state or information, or as arandom oracle. |
| Oscar | Anopponent, similar to Mallory, but not necessarily malicious. |
| Peggy orPat | Aprover, who interacts with theverifier to show that the intended transaction has actually taken place. Peggy is often found inzero-knowledge proofs. |
| Rupert | Arepudiator who appears for interactions that desirenon-repudiation. |
| Sybil | Apseudonymous attacker, who usually uses a large number of identities. For example, Sybil may attempt to subvert areputation system. SeeSybil attack. |
| Trent orTed | Atrustedarbitrator, who acts as aneutral third party. |
| Trudy | Anintruder. |
| Victor[19] orVanna[28] | A verifier, who requires proof from theprover. |
| Walter | Awarden, who may guard Alice and Bob. |
| Wendy | Awhistleblower, who is an insider with privileged access capable of divulging information. |
Forinteractive proof systems there are other characters:
| Arthur andMerlin | Merlin provides answers, and Arthur asks questions.[29] Merlin has unbounded computational ability (like the wizardMerlin). In interactive proof systems, Merlin claims the truth of a statement, and Arthur (likeKing Arthur), questions him to verify the claim. |
| Paul andCarole | Paul asks questions, and Carole provides answers. In the solution of theTwenty Questions problem,[30] Paul (standing in forPaul Erdős) asked questions and Carole (ananagram of "oracle") answered them. Paul and Carole were also used incombinatorial games, in the roles of pusher and chooser.[31] |
| Arthur andBertha | Arthur is the "left", "black", or "vertical" player, and Bertha is the "right", "white", or "horizontal" player in acombinatorial game. Additionally, Arthur, given the same outcome, prefers a game to take the fewest moves, while Bertha prefers a game to take the most moves.[32] |
The names Alice and Bob are often used to name the participants in thought experiments in physics.[33][34] More alphabetical names, usually of alternating gender, are used as required, e.g. "Alice and Bob (and Carol and Dick and Eve)".[35]
In experiments involving robotic systems, the terms "Alice Robot" and "Bob Robot" refer to mobile platforms responsible for transmitting quantum information and receiving it with quantum detectors, respectively, within the context of the field ofquantum robotics.[36][37][38][39][40][41]
{{cite book}}: CS1 maint: location missing publisher (link)Mallet can intercept Alice's database inquiry, and substitute his own public key for Alice's. He can do the same to Bob.
Mallet maintains the illusion that Alice and Bob are talking to each other rather than to him by intercepting the messages and retransmitting them.
Mallet represents an active adversary that not only listens to all communications between Alice and Bob but can also modify the contents of any communication he sees while it is in transit.
We model key choices of Alice, Bob and adversary Mallet as independent random variables A, B and M [...]
Suppose Alice and Bob wish to exchange keys, and Darth is the adversary.