18739A: Foundations of Security and Privacy . A Quick Tour of Cryptographic Primitives. Anupam Datta CMU Fall 2009. Basic Cryptographic Concepts. Encryption scheme (symmetric and public key) Signature scheme Message authentication code Hash function
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
dec(enc(m,k),k) = m
Can you think of a stronger security property?
dec(enc(m, pk(A)), sk(A)) = m
Why would you want public key encryption?
verify(m,sign(m,sk(A)), pk(A)) = ok
Can you think of a scenario where you may not want non-repudiation?
verify(k, m, mac(k,m)) = ok
Similar to signature, but uses symmetric key
What property does a signature have, but a MAC does not?
Given hash function hash: X Y and key k, cannot find a
collision, i.e. x, x’ X s.t. x ≠ x’ and hash(k,x) = hash(k,x’)
What is the difference between a MAC and a hash function?
Later: Peeking inside the RSA encryption scheme