skip to main content
10.1145/3055399.3079078acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
invited-talk

Practical post-quantum key agreement from generic lattices (invited talk)

Published:19 June 2017Publication History

ABSTRACT

Lattice-based cryptography offers some of the most attractive primitives believed to be resistant to quantum computers. This work introduces "Frodo" - a concrete instantiation of a key agreement mechanism based on hard problems in generic lattices.

Skip Supplemental Material Section

Supplemental Material

d1_sc_t1.mp4

mp4

230.8 MB

References

  1. Erdem Alkim, Léo Ducas, Thomas Pöppelmann, and Peter Schwabe. 2015. Postquantum key exchange-a new hope. IACR Cryptology ePrint Archive 2015 (2015), 1092.Google ScholarGoogle Scholar
  2. Joppe Bos, Craig Costello, Léo Ducas, Ilya Mironov, Michael Naehrig, Valeria Nikolaenko, Ananth Raghunathan, and Douglas Stebila. 2016. Frodo: Take off the ring! practical, quantum-secure key exchange from LWE. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. ACM, New York, NY, USA, 1006–1018. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Joppe W Bos, Craig Costello, Michael Naehrig, and Douglas Stebila. 2015. Postquantum key exchange for the TLS protocol from the ring learning with errors problem. In Security and Privacy (SP), 2015 IEEE Symposium on. IEEE, 553–570. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Chris Peikert. 2014. Lattice cryptography for the internet. In International Workshop on Post-Quantum Cryptography. Springer International Publishing, Cham, 197–219.Google ScholarGoogle ScholarCross RefCross Ref
  5. Oded Regev. 2009. On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM (JACM) 56, 6 (2009), 34. Abstract Acknowledgments References Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Practical post-quantum key agreement from generic lattices (invited talk)

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          STOC 2017: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
          June 2017
          1268 pages
          ISBN:9781450345286
          DOI:10.1145/3055399

          Copyright © 2017 Owner/Author

          Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 19 June 2017

          Check for updates

          Qualifiers

          • invited-talk

          Acceptance Rates

          Overall Acceptance Rate1,469of4,586submissions,32%

          Upcoming Conference

          STOC '24
          56th Annual ACM Symposium on Theory of Computing (STOC 2024)
          June 24 - 28, 2024
          Vancouver , BC , Canada

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader