Characters used in cryptography and science literature
Example scenario where communication between Alice and Bob is intercepted by Mallory
Alice and Bob are fictional characters commonly used as placeholders in discussions about cryptographic systems and protocols,[1] and in other science and engineering literature where there are several participants in a thought experiment. The Alice and Bob characters were created by Ron Rivest, Adi Shamir, and Leonard Adleman in their 1978 paper "A Method for Obtaining Digital Signatures and Public-key Cryptosystems".[2] Subsequently, they have become common archetypes in many scientific and engineering fields, such as quantum cryptography, game theory and physics.[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.
Overview
An example of an "Alice and Bob" used in cryptography
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 named A and B 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 an alliterativemnemonic such as "Mallory" for "malicious" 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, 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."[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 the RSA cryptosystem, there is no mention of Alice and Bob.[4][5] The choice of the first three names may have come from the film Bob & Carol & Ted & Alice.[6]
Within a few years, however, references 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."[7] 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."[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] In Bruce Schneier's book Applied Cryptography, other characters are listed.[13]
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 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 or Chad
A third participant, usually of malicious intent.[15]
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 or Yves
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.[clarification needed]
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.[citation needed]
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.[16]
Heidi
A mischievous designer for cryptographic standards, but rarely used.[17]
A malicious attacker. Associated with Trudy, an intruder. Unlike the passive Eve, Mallory is an active attacker (often used in man-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 or Mike
Used as an alternative to the eavesdropper Eve, from microphone.
Niaj
Used as an alternative to the eavesdropper Eve in several South Asian nations.[27]
Olivia
An oracle, who responds to queries from other participants. Olivia often acts as a "black box" with some concealed state or information, or as a random oracle.
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.
Merlin provides answers, and Arthur asks questions.[29] Merlin has unbounded computational ability (like the wizard Merlin). In interactive proof systems, Merlin claims the truth of a statement, and Arthur (like King 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,[30] Paul (standing in for Paul Erdős) asked questions and Carole (an anagram of "oracle") answered them. Paul and Carole were also used in combinatorial games, in the roles of pusher and chooser.[31]
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, while Bertha prefers a game to take the most moves.[32]
Physics
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 of quantum robotics.[36][37][38][39][40][41]
^Newton, David E. (1997). Encyclopedia of Cryptography. Santa Barbara California: Instructional Horizons, Inc. p. 10.
^Rivest, Ron L.; Shamir, Adi; Adleman, Len (April 1977). On Digital Signatures and Public-Key Cryptosystems. Cambridge MA: Massachusetts Institute of Technology.
^Cho, Hyunghoon; Ippolito, Daphne; Yun William Yu (2020). "Contact Tracing Mobile Apps for COVID-19: Privacy Considerations and Related Trade-offs". arXiv:2003.11511 [cs.CR].
^ abSchneier, Bruce (1996). Applied Cryptography: Protocols, Algorithms, and Source Code in C (Second ed.). Wiley. p. 23. ISBN978-0-471-11709-4. Table 2.1: Dramatis Personae.
^Schneier, Bruce (1994). Applied Cryptography: Protocols, Algorithms, and Source Code in C. Wiley. p. 44. ISBN978-0-471-59756-8. Mallet can intercept Alice's database inquiry, and substitute his own public key for Alice's. He can do the same to Bob.
^Perkins, Charles L.; et al. (2000). Firewalls: 24seven. Network Press. p. 130. ISBN9780782125290. Mallet maintains the illusion that Alice and Bob are talking to each other rather than to him by intercepting the messages and retransmitting them.
^LaMacchia, Brian (2002). .NET Framework Security. Addison-Wesley. p. 616. ISBN9780672321849. 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.
^Dolev, Shlomi, ed. (2009). Algorithmic Aspects of Wireless Sensor Networks. Springer. p. 67. ISBN9783642054334. We model key choices of Alice, Bob and adversary Mallet as independent random variables A, B and M [...]
^Stallings, William (1998). Cryptography and Network Security: Principles and Practice. Pearson. p. 317. ISBN978-0133354690. Suppose Alice and Bob wish to exchange keys, and Darth is the adversary.
^ Farbod Khoshnoud, Maziar Ghazinejad, Automated quantum entanglement and cryptography for networks of robotic systems, IEEE/ASME International Conference on Mechatronic and Embedded Systems and Applications (MESA), IDETC-CIE 2021, Virtual Conference: August 17 – 20, DETC2021-71653, 2021.
^Khoshnoud, Farbod; Aiello, Clarice; Quadrelli, Bruno; Ghazinejad, Maziar; De Silva, Clarence; Khoshnoud, Farbod; Bahr, Behnam; Lamata, Lucas (April 23, 2021). Modernizing Mechatronics course with Quantum Engineering. 2021 ASEE Pacific Southwest Conference - "Pushing Past Pandemic Pedagogy: Learning from Disruption". ASEE Conferences. doi:10.18260/1-2--38241. PDF
^Farbod Khoshnoud, Marco B. Quadrelli, Enrique Galvez, Clarence W. de Silva, Shayan Javaherian, B. Bahr, M. Ghazinejad, A. S. Eddin, M. El-Hadedy, Quantum Brain-Computer Interface, ASEE PSW, 2023, in press.
