![Page 1: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/1.jpg)
Cryptography
CS 111 -- Lecture 19CS 111 -- Lecture 19 Prof. Amit SahaiProf. Amit Sahai
![Page 2: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/2.jpg)
Last Time• We saw examples of search problems that
we believe Computers can’t solve quickly.• In computer-science terminology:
• NP = All Search Problems• P = Problems we can solve quickly
• We believe that P NP, i.e. not every search problem can be solved quickly on a computer.
• (Otherwise life would be too good.)• But we don’t know how to prove it!
![Page 3: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/3.jpg)
Coloring
![Page 4: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/4.jpg)
Last Time (cont.)• We saw that the Coloring Problem is as hard
as any search problem:• In particular, we can reduce solving any
search problem to finding a valid coloring for some collection of circles!
• So, if we could solve Coloring quickly, then
P = NP • That’s why we believe Coloring can’t be
solved quickly by any computer.• We call such problems NP-Complete.
![Page 5: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/5.jpg)
Other Hard Problems?• There are other problems besides NP-
Complete Problems that we also believe are hard.
• How can we be sure?• We can’t.• But humanity has been trying to solve
certain mathematical problems for centuries.• It seems reasonable to assume that nobody
will figure out how to solve them soon.
![Page 6: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/6.jpg)
Cryptography• Why do we care so much about hard
problems?• Because sometimes we want to make things
hard.• Protecting Privacy, Authenticity• Want to make it hard for adversaries to:
• Steal our credit cards• Impersonate us• Etc.
![Page 7: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/7.jpg)
Cryptography• Science of making things hard for
adversaries = Cryptography
• Today: we’ll learn the basic principles used to protect credit cards online and much more.
• Beautiful and mathematically sophisticated field• This is your professor’s main area of
research.
![Page 8: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/8.jpg)
One Approach...One Approach...It’s so complicated!It must be secure!
Cryptosystem XYZ(Patent Pending)
![Page 9: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/9.jpg)
One Approach...One Approach...Cryptosystem XYZ Broken 2 Days After
Release!
![Page 10: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/10.jpg)
One Approach...One Approach...• Unfortunately, this approach is often used in
real life.
• This is one of the reasons why you hear about so many security systems being broken!• Examples: DVD encryption,
Cell phones in Europe (GSM),
many many more
![Page 11: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/11.jpg)
Our Approach...Our Approach...• We’ll of course take a much more disciplined
approach.• We’ll use the theory of hard search problems
and our notion of reducing one problem to another:
• We want to show that if you break our security system, you will have to solve some of the world’s greatest unsolved problems first!
![Page 12: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/12.jpg)
Encryption• The most basic problem in Cryptography is
Encryption:
Alice Bob
PrivateMessage m
![Page 13: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/13.jpg)
Encryption• The most basic problem in Cryptography is
Encryption:
Alice Bob
PrivateMessage m
Eve the eavesdropper
![Page 14: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/14.jpg)
Encryption• The most basic problem in Cryptography is
Encryption:
Alice Bob
EncryptedMessage E(m)
Eve the eavesdropper
![Page 15: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/15.jpg)
Encryption• Have to make it easy for Bob to recover m• But hard for Eve to learn anything about m
Alice Bob
EncryptedMessage E(m)
Eve the eavesdropper
![Page 16: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/16.jpg)
Public-Key Cryptography[Diffie-Hellman 1976]
Bob’sPublic Key
Bob’s Secret Key
Bob
• Everybody knows Bob’s published Public Key.• Only Bob knows his secret key.
![Page 17: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/17.jpg)
Public-Key Encryption
• Alice uses Bob’s public key to encrypt m.• Bob uses his secret key to recover (decrypt)
m.
Alice Bob
EncryptedMessage E(m)
![Page 18: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/18.jpg)
Public-Key Encryption
• Alice and Eve both know Bob’s public key.• Eve must not be able to “break” the
encryption even though she knows the public key.
Alice Bob
EncryptedMessage E(m)
Eve the eavesdropper
![Page 19: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/19.jpg)
Basic Math Review• Let’s recall some basic mathematics:• A number p is called prime if its only factors
are 1 and itself.• Examples:
![Page 20: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/20.jpg)
Basic Math Review• Let’s recall some basic mathematics:• A number p is called prime if its only factors
are 1 and itself.• Examples: 2, 3, 5, 7, 11, 13, 17, 19, …
![Page 21: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/21.jpg)
Basic Math Review• Let’s recall some basic mathematics:• A number p is called prime if its only factors
are 1 and itself.• Examples: 2, 3, 5, 7, 11, 13, 17, 19, …
• There are lots of prime numbers.• Fact: It is known how to check quickly if a
number is prime or not.• So, to find a big prime number, we can just
keep generating large random numbers until we find a prime.
![Page 22: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/22.jpg)
Basic Math Review• Given two primes p and q, it is easy to
multiply them together: N = pq• But given N, how do you find p and q
quickly?i.e. how do you factor N?
• Easy for small numbers (e.g. 6 or 35).• For centuries, mathematicians have been
trying to find ways to factor large numbers quickly. No one knows how!
• Factoring a 10,000 digit N would take centuries on the fastest computer in existence!
![Page 23: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/23.jpg)
Basic Math & Crypto• We want to make it so that if Eve the
eavesdropper breaks our system, she would have to factor a very large number.
• We’ll (almost) do that.
![Page 24: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/24.jpg)
Modular Arithmetic• Ordinary Arithmetic:
… -4 -3 -2 -1 0 1 2 3 4 …
![Page 25: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/25.jpg)
Modular Arithmetic• Ordinary Arithmetic:
• Arithmetic Modulo N:
… -4 -3 -2 -1 0 1 2 3 4 …
N = 01
2
3…
(N – 3)
(N – 2)
(N – 1)
![Page 26: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/26.jpg)
Modular Arithmetic• Example: Arithmetic Modulo 12
(like Arithmetic on time)• 3 + 11 (Modulo 12) = • 2 – 4 (Modulo 12) =• 5 * 4 (Modulo 12) =• 4 * 3 (Modulo 12) =
![Page 27: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/27.jpg)
Modular Arithmetic• Example: Arithmetic Modulo 12
(like Arithmetic on time)• 3 + 11 (Modulo 12) = 2 • 2 – 4 (Modulo 12) =• 5 * 4 (Modulo 12) =• 4 * 3 (Modulo 12) =
![Page 28: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/28.jpg)
Modular Arithmetic• Example: Arithmetic Modulo 12
(like Arithmetic on time)• 3 + 11 (Modulo 12) = 2 • 2 – 4 (Modulo 12) = 10• 5 * 4 (Modulo 12) =• 4 * 3 (Modulo 12) =
![Page 29: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/29.jpg)
Modular Arithmetic• Example: Arithmetic Modulo 12
(like Arithmetic on time)• 3 + 11 (Modulo 12) = 2 • 2 – 4 (Modulo 12) = 10• 5 * 4 (Modulo 12) = 8• 4 * 3 (Modulo 12) =
![Page 30: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/30.jpg)
Modular Arithmetic• Example: Arithmetic Modulo 12
(like Arithmetic on time)• 3 + 11 (Modulo 12) = 2 • 2 – 4 (Modulo 12) = 10• 5 * 4 (Modulo 12) = 8• 4 * 3 (Modulo 12) = 0
![Page 31: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/31.jpg)
The RSA Encryption Scheme
[Rivest Shamir Adleman 1978]
• Bob picks two large primes p and q, and computes: N = pq
• Fact: Because Bob knows p and q, he can pick numbers e and d such that:• For all m: (me)d = m (Modulo N)
• Bob’s Public Key will be e, N • Bob’s secret key will be d
![Page 32: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/32.jpg)
The RSA Encryption Scheme
• Fact: Because Bob knows p and q, he can pick numbers e and d such that:• For all m: (me)d = m (Modulo N)
• To Encrypt a message m, Alice computes:• E(m) = me (Modulo N)
![Page 33: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/33.jpg)
The RSA Encryption Scheme
• Fact: Because Bob knows p and q, he can pick numbers e and d such that:• For all m: (me)d = m (Modulo N)
• To Encrypt a message m, Alice computes:• E(m) = me (Modulo N)
• To Decrypt, Bob computes:• m = E(m)d (Modulo N)
![Page 34: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/34.jpg)
The RSA Encryption Scheme• To Encrypt a message m, Alice computes:
• E(m) = me (Modulo N)
• The only known way to compute m from E(m) involves factoring N.
• For Eve to break this system, she would have to solve a long-standing open problem in Mathematics.
• This is probably the most widely used Public-Key Encryption Scheme in the world.
![Page 35: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/35.jpg)
Shifting Gears: Proofs…• Bob wants to convince Alice of the validity of
some statement (like “I really am Bob!”)
• But Bob doesn’t want to reveal his secrets to Alice in the process…
Alice Bob
![Page 36: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/36.jpg)
Zero-Knowledge Proofs[Goldwasser Micali Rackoff
85]• What is the least amount of information Bob can reveal, while still convincing Alice?
• Amazingly, it is possible for Bob to convince Alice of something without revealing any information at all!
• How can that be?
![Page 37: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/37.jpg)
Magic TricksMagic Tricks• Magic tricks are like zero-knowledge proofs:• Good magic tricks reveal nothing about how they work.
• What makes a magic trick good?
![Page 38: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/38.jpg)
A Magic TrickA Magic Trick• Two balls: Purple and Red, otherwise identical• Blindfolded Magician • You give a random ball to magician
![Page 39: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/39.jpg)
A Magic Trick (cont.)A Magic Trick (cont.)• Magician tells you the color!• Magician proves he can distinguish balls blindfolded.• You learn nothing except this.
Abracadabra,Goobedy goo!
It is Red!
Wow! He’sso cool!
![Page 40: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/40.jpg)
A Magic Trick (cont.)A Magic Trick (cont.)• You knew exactly what magician was going to do.• And he did it!• Since you knew to begin with, you could not have learned anything new!
It’s Red!
I knew hewould say that.
![Page 41: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/41.jpg)
Zero KnowledgeZero Knowledge• What it means:
• Alice “knows” what is going to happen.• CS-speak: Alice can simulate it herself!
Abracadabra,Goobedy goo!
It is Red!
Simulation
![Page 42: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/42.jpg)
Another Magic TrickAnother Magic Trick• Magician asks you to think of either
• “Apple” or• “Banana”
• Magician then gives you a sealed box.
![Page 43: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/43.jpg)
Mind ReadingMind Reading• You tell Magician what you were thinking.
I was thinkingof a banana.
![Page 44: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/44.jpg)
Banana
Mind Reading (cont.)Mind Reading (cont.)• Magician tells you to open box, and read piece of paper in box.• Magician proves he can predict what you will say.
How did hedo that!!
![Page 45: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/45.jpg)
Mind Reading (cont.)Mind Reading (cont.)• Again, you knew what was going to happen. Zero-Knowledge
I was thinkingof a banana.
Simulation
Banana
![Page 46: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/46.jpg)
Mind Reading (cont.)Mind Reading (cont.)• But why was it convincing?• Because Magician committed to his guess before you told him.
![Page 47: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/47.jpg)
CryptographicCryptographicCommitmentCommitment
• Public Key Encryption Scheme• To commit to a string x, I send y = E(x).• To open the commitment, I reveal my secret key.
• Commitment is secret.• And I can’t change my mind about x once I’ve sent the encryption.
![Page 48: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/48.jpg)
NP-CompletenessNP-Completeness• Remember we can reduce any search problem to Coloring.
![Page 49: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/49.jpg)
NP-Completeness (cont.)NP-Completeness (cont.)• “y is an encryption of a valid tax return”
reduction
![Page 50: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/50.jpg)
ZK Proof for ZK Proof for ColoringColoring
• Input: Collection of circles.• Magician Knows: Coloring using R, B, G• First, Magician picks random permutation : R,B,G R,B,G, and applies to coloring:
![Page 51: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/51.jpg)
ZK Proof (cont.)ZK Proof (cont.)
![Page 52: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/52.jpg)
ZK Proof (cont.)ZK Proof (cont.)
![Page 53: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/53.jpg)
ZK Proof (cont.)ZK Proof (cont.)
![Page 54: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/54.jpg)
ZK Proof: AnalysisZK Proof: Analysis• Suppose NO valid coloring exists.• Then at least one pair of connected circles where colors equal. Alice catches Magician cheating with probability at least 1/n2.
• Repeat protocol 100 n2 times, Alice catches Magician cheating almost always!
![Page 55: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/55.jpg)
SimulatorSimulator
![Page 56: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/56.jpg)
Simulated ZK ProofSimulated ZK Proof
![Page 57: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/57.jpg)
ZK Proof: Analysis (cont.)ZK Proof: Analysis (cont.)• Only difference between real & simulated:
• In real life, commitments are to valid coloring.• In simulator, commitments are to invalid coloring.
• But commitments are secret, by security of encryption scheme. Simulator output and real life are indistinguishable.
![Page 58: Cryptography CS 111 -- Lecture 19 Prof. Amit Sahai](https://reader035.vdocuments.us/reader035/viewer/2022062413/5a4d1b967f8b9ab0599c3d9d/html5/thumbnails/58.jpg)
Wrap-up• Today we saw some examples illustrating
techniques from modern cryptography:• Encryption• Zero Knowledge Proofs
• Next Time: Discussions on Computer Music & Intellectual Property.