technologybriefs
9:02in productionCh. 1 · Probabilistic Encryption/ 9:02 · ceiling 15 min
Security

Shafi Goldwasser

Cryptography stopped being about hiding messages—and started being about controlling what can be known.

Shafi Goldwasser co-invented probabilistic encryption (1984) and zero-knowledge proofs (1985). These are not theoretical curiosities. They define how real-world cryptography enforces confidentiality and verification under adversarial conditions.

Chapters & takeaways4
  1. 0:55
    Probabilistic Encryption

    One message, many ciphertexts—breaking the link between plaintext and ciphertext was the first step toward semantic security.

  2. 2:52
    The Basis, Not the Exception

    It is not an option—it is the default architecture behind nearly every public-key system in use today.

  3. 4:16
    Zero-Knowledge Proofs

    You can prove something is true without giving away why it’s true—a formal separation of verification from disclosure.

  4. 5:33
    The Probabilistic Turn

    Both rely on probability and interaction—not certainty or silence—to enforce security guarantees.

Worth your time?

Yes. Study the whole thing.

4.5/ 5
What works
  • It defines semantic security.
  • It enables verifiable computation without data exposure.
  • It is embedded in standards and deployed systems.
What does not
  • It does not eliminate implementation risk.
  • It does not replace domain-specific threat modelling.
  • It does not make cryptography easy to use correctly.
Study it if
  • Cryptographic engineers
  • Protocol designers
  • Privacy-focused product architects
Skip it if
  • Developers treating crypto as a black-box library
  • Policy makers relying on 'encryption' as a monolithic concept
  • Executives equating adoption with security
The written brief1 min read

What it is and the problem it solves

Two cryptographic primitives: probabilistic encryption solves the vulnerability of deterministic public-key encryption to chosen-plaintext attacks; zero-knowledge proofs solve the problem of verifying statements without revealing secrets.

How it works

Probabilistic encryption uses randomness so one plaintext maps to many possible ciphertexts. Zero-knowledge proofs use interactive, probabilistic protocols where a prover convinces a verifier of a statement’s truth without leaking any other information.

What works

Probabilistic encryption became the basis for most public-key cryptographic schemes. Zero-knowledge proofs became a fundamental cryptographic primitive used across identity systems, blockchain protocols, and secure multiparty computation.

What does not

Neither method eliminates implementation flaws, side-channel leaks, or trust in underlying assumptions like the hardness of factoring. They do not guarantee security by themselves—only when correctly instantiated and integrated.

What it changes

They redefined what ‘security’ means in cryptography: from deterministic secrecy to semantic security (probabilistic encryption) and from knowledge transfer to knowledge containment (zero-knowledge proofs).

Is it worth your time

Yes—if you work on cryptographic protocol design, verification, or privacy-preserving systems. These are not optional abstractions; they are operational prerequisites for modern secure computation.

Same field · Security3 of 3
Up next in Technology

Siri

2011 · 9:44

Siri didn’t invent voice control—it outsourced understanding to Nuance and offloaded thinking to the cloud.

9:44