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

DOI10.1007/978-3-030-81293-5_9MaRDI QIDQ2118533zbMATH OpenOpenAlexFDO

Authors Edward Eaton, Douglas Stebila

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)

Recommendations

• Towards isogeny-based password-authenticated key establishment
• Provably secure password authenticated key exchange based on RLWE for the post-quantum world
• Efficient password-authenticated key exchange from RLWE based on asymmetric key consensus
• Security Analysis of CPace
• Password-authenticated key exchange from group actions

Cites work

• scientific article; zbMATH DE number 1303114 (Why is no real title available?)
• Authenticated key exchange secure against dictionary attacks
• Generic Hardness of the Multiple Discrete Logarithm Problem
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Random oracles in a quantum world
• Security Analysis of the PACE Key-Agreement Protocol
• The ``Quantum annoying property of password-authenticated key exchange protocols

Cited in

(9)

• Intermundium-DL: assessing the resilience of current schemes to discrete-log-computation attacks on public parameters
• An efficient strong asymmetric PAKE compiler instantiable from group actions
• The ``Quantum annoying property of password-authenticated key exchange protocols
• Towards quantum large-scale password guessing on real-world distributions
• Universally composable password-hardened encryption
• Security Analysis of CPace
• A new approach to generic lower bounds. Classical/quantum MDL, quantum factoring, and more
• 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)