Alice and Bob

Alice and Bob are two commonly used placeholder names. They are used for archetypal characters in fields such as cryptography, game theory and physics.[1] The names are used for convenience; for example, "Alice sends a message to Bob encrypted with his public key" is easier to follow than "Party A sends a message to Party B encrypted by Party B's public key." Following the alphabet, the specific names have evolved into common parlance within these fields—helping technical topics to be explained in a more understandable fashion.

Overview

These placeholder names are used for convenience and easier understanding. For example, if a writer wants to explain encrypted emails, the explanation might be:

  1. Alice gets Bob's public key from the company directory.
  2. Alice sends a message to Bob encrypted with Bob's public key.
  3. Bob can use his secret key to unscramble it.

Every reader can intuitively figure out that they themselves could do the same thing as Bob or Alice.

In cryptography and computer security, there are a number of widely used names for the participants in discussions and presentations about various protocols.[2] The names are conventional, somewhat self-suggestive, sometimes humorous, and effectively act as metasyntactic variables.

In typical implementations of these protocols, it is understood that the actions attributed to characters such as Alice or Bob need not always be carried out by human parties directly, but also by a trusted automated agent (such as a computer program) on their behalf.

Cast of characters

An example of an "Alice and Bob" analogy used in cryptography.
Alice and Bob diagram used to explain public-key cryptography.

This list is drawn mostly from the book Applied Cryptography by Bruce Schneier. Alice and Bob are archetypes in cryptography; Eve is also common. Names further down the alphabet are less common.

Although an interactive proof system is not quite a cryptographic protocol, it is sufficiently related to mention the cast of characters its literature features:

See also

References

  1. Newton, David E. (1997). Encyclopedia of Cryptography. Santa Barbara California: Instructional Horizons, Inc. p. 10.
  2. RFC 4949
  3. "Security's inseparable couple". Network World. February 7, 2005.
  4. Tanenbaum, Andrew S. (2007), Distributed Systems: Principles and Paradigms, Pearson Prentice Hall, p. 171;399402, ISBN 978-0-13-239227-3 External link in |publisher= (help)
  5. Bruce Schneier (1994), Applied Cryptography: Protocols, Algorithms, and Source Code in C, Wiley, ISBN 9780471597568, p. 44: "Mallet can intercept Alice's database inquiry, and substitute his own public key for Alice's. He can do the same to Bob."
  6. Charles L. Perkins et al. (2000), Firewalls: 24seven, Network Press, ISBN 9780782125290, p. 130: "Mallet maintains the illusion that Alice and Bob are talking to each other rather than to him by intercepting the messages and retransmitting them."
  7. Brian LaMacchia (2002), .NET Framework Security, Addison-Wesley, ISBN 9780672321849, p. 616: "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."
  8. Shlomi Dolev, ed. (2009), Algorithmic Aspects of Wireless Sensor Networks, Springer, ISBN 9783642054334, p. 67: "We model key choices of Alice, Bob and adversary Mallet as independent random variables A, B and M [...]"
  9. 1 2 Bruce Schneier (1996), Applied Cryptography: Protocols, Algorithms, and Source Code in C, Second Edition, Wiley, ISBN 9780471117094, p. 23: Table 2.1: Dramatis Personae
  10. Carsten Lund; et al. (1992). "Algebraic Methods for Interactive Proof Systems". J. ACM (ACM) 39 (4): 859–868. doi:10.1145/146585.146605.
  11. Spencer, Joel; Winkler, Peter (1992), "Three Thresholds for a Liar", Combinatorics, Probability and Computing 1 (01): 81–93, doi:10.1017/S0963548300000080
  12. Muthukrishnan, S. (2005), Data Streams: Algorithms and Applications, Now Publishers, p. 3, ISBN 978-1-933019-14-7 External link in |publisher= (help)
  13. Conway, John Horton (2000). On Numbers and Games. CRC Press. pp. 71, 175, 176. ISBN 9781568811277.

Further reading

External links


This article is issued from Wikipedia - version of the Sunday, February 14, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.