Chris Peikert - Lattice Cryptography for the Internet
Chris Peikert of Georgia Institute of Technology presented a talk titled: Lattice cryptography for the internet at the 2014 PQCrypto conference in October, 2...
🔥 Related Trending Topics
LIVE TRENDSThis video may be related to current global trending topics. Click any trend to explore more videos about what's hot right now!
THIS VIDEO IS TRENDING!
This video is currently trending in Australia under the topic 'christmas island'.
About this video
Chris Peikert of Georgia Institute of Technology presented a talk titled: Lattice cryptography for the internet at the 2014 PQCrypto conference in October, 2014.
Abstract: In recent years, lattice-based cryptography has been recognized for its many attractive properties, such as strong provable security guarantees and apparent resistance to quantum attacks, flexibility for realizing powerful tools like fully homomorphic encryption, and high asymptotic efficiency. Indeed, several works have demonstrated that for basic tasks like encryption and authentication, lattice-based primitives can have performance competitive with (or even surpassing) those based on classical mechanisms like RSA or Diffie-Hellman. However, there still has been relatively little work on developing lattice cryptography for deployment in real-world cryptosystems and protocols.
In this work, we take a step toward that goal, by giving efficient and practical lattice-based protocols for key transport, encryption, and authenticated key exchange that are suitable as "drop-in" components for proposed Internet standards and other open protocols. The security of all our proposals is provable based (sometimes in the random-oracle model) on the well-studied "leaning with errors over rings" problem, and hence on the conjectured worst-case hardness of problems on ideal lattices (against quantum algorithms).
One of our main technical innovations (which may be of independent interest) is a simple, low-bandwidth reconciliation technique that allows two parties who "approximately agree" on a secret value to reach exact agreement, a setting common to essentially all lattice-bases encryption schemes. Our technique reduces the ciphertext length of prior (already compact) encryption schemes nearly twofold, at essentially no cost.
PQCrypto
2014 Book: http://www.springer.com/computer/security+and+cryptology/book/978-3-319-11658-7
Workshop: https://pqcrypto2014.uwaterloo.ca/
Find out more about IQC!
Website - https://uwaterloo.ca/institute-for-qu...
Facebook - https://www.facebook.com/QuantumIQC
Twitter - https://twitter.com/QuantumIQC
Video Information
Views
4.3K
Total views since publication
Likes
37
User likes and reactions
Duration
24:58
Video length
Published
Oct 23, 2014
Release date
Quality
hd
Video definition
About the Channel
Tags and Topics
This video is tagged with the following topics. Click any tag to explore more related content and discover similar videos:
#Lattice #cryptography #Chris Peikert #Georgia Institute Of Technology (College/University) #internet
Tags help categorize content and make it easier to find related videos. Browse our collection to discover more content in these categories.