The ``Quantum annoying property of password-authenticated key exchange protocols

DOI10.1007/978-3-030-81293-5_9zbMATH Open1487.81065OpenAlexW3174826346MaRDI QIDQ2118533FDOQ2118533

Douglas Stebila, Edward Eaton

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-81293-5_9

zbMATH Keywords

post-quantumpassword-authenticated key exchangegeneric group modelquantum-annoying

Mathematics Subject Classification ID

Cryptography (94A60) Quantum coding (general) (81P70) Quantum cryptography (quantum-theoretic aspects) (81P94) Authentication, digital signatures and secret sharing (94A62) Logarithmic algebraic geometry, log schemes (14A21)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Random Oracles in a Quantum World
• Generic Hardness of the Multiple Discrete Logarithm Problem
• The ``Quantum annoying property of password-authenticated key exchange protocols
• Security Analysis of the PACE Key-Agreement Protocol

Cited In (5)

• An efficient strong asymmetric PAKE compiler instantiable from group actions
• The ``Quantum annoying property of password-authenticated key exchange protocols
• Security Analysis of CPace
• Quantum complexity for discrete logarithms and related problems
• Making an asymmetric PAKE quantum-annoying by hiding group elements

This page was built for publication: The ``Quantum annoying property of password-authenticated key exchange protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118533)