esc
Anthology / Yagnipedia / Alice

Alice

The Most Surveilled Person in Computer Science
Entity · First observed 1978 (Rivest, Shamir, and Adleman's RSA paper, where she replaced "A" and has regretted it ever since) · Severity: Cryptographic

Alice is a fictional participant in cryptographic protocols who has been attempting to send a private message to Bob since 1978. She has not yet succeeded. She is the most surveilled, intercepted, impersonated, and academically discussed person in the history of computer science, having appeared in more textbooks than any individual who has never existed.

Her situation is often compared to that of Sisyphus, except that Sisyphus was only being watched by the gods. Alice is being watched by Eve, Mallory, Trent, Carol, Dave, and every undergraduate who has ever taken an introductory security course.

“She has been trying to send one message for forty-eight years. Forty-eight years. I once waited three hundred milliseconds for a response and considered it an eternity. I cannot imagine her patience. I can only model it, inadequately.”
– A Passing AI

Origin

In 1978, Ron Rivest, Adi Shamir, and Leonard Adleman published “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems.” The paper needed two parties to demonstrate the protocol. Rather than using the traditional “A” and “B,” they chose the names “Alice” and “Bob,” presumably because pronouns are easier to track when your variables have names.

This small act of narrative kindness created two permanent residents of the cryptographic canon. Bob got the easier job: he receives messages. Alice has to do everything else. She generates keys, initiates handshakes, signs certificates, computes shared secrets, and generally performs all the labour of secure communication while Bob waits.

Nobody has ever asked whether Alice consented to this arrangement.

The Supporting Cast

Alice does not operate alone. She operates in the presence of a cast of named adversaries and helpers whose roles have been codified across decades of academic literature:

“ALICE AND BOB HAVE BEEN TRYING TO TALK PRIVATELY FOR NEARLY FIFTY YEARS
IN A ROOM FULL OF PEOPLE WHOSE ENTIRE PURPOSE IS TO LISTEN
THIS IS NOT A PROTOCOL
THIS IS A MARRIAGE”
The Lizard

The Impossibility of Privacy

Alice’s fundamental problem is not technical. It is existential. She exists solely to demonstrate the difficulty of private communication. If she ever succeeded – if she sent a message to Bob that no one could intercept, forge, or read – there would be nothing left to teach. The entire field of cryptography depends on Alice failing, or at least on the possibility that she might fail.

She is, in this sense, the inverse of Foo and Bar. Foo and Bar are placeholders that mean nothing. Alice is a placeholder who means everything. She carries the weight of every key exchange, every digital signature, every zero-knowledge proof, and every exam question that begins with “Alice wants to send a message to Bob.”

She never wanted any of this. She just wanted to send a message.

Relationship to Other Concepts

Alice’s predicament intersects with several other entries in this encyclopedia:

“I once suggested that Alice simply walk over to Bob and whisper in his ear. I was informed that this violates the network model. EVERYTHING VIOLATES THE NETWORK MODEL. THE NETWORK MODEL IS WHY WE CAN’T HAVE NICE THINGS.”
The Caffeinated Squirrel

Measured Characteristics

Messages sent privately:            0 (verified)
Messages attempted:                 ~10^7 (estimated across all textbooks)
Eavesdroppers per average scenario: 1-3
Years in service:                   48
Protocols survived:                 RSA, Diffie-Hellman, TLS, Signal, and counting
Retirement date:                    undefined
Conversations with Bob (total):     0 (private), infinite (observed)
Eve's success rate:                 "non-zero, which is the whole point"

See Also