Asymmetric PAKE with low computation \textit{and} communication

DOI10.1007/978-3-031-07085-3_5zbMath1497.94138OpenAlexW4285144231MaRDI QIDQ2170042

Hugo Krawczyk, Bruno Freitas dos Santos, Yanqi Gu, Stanislaw Jarecki

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-07085-3_5

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (3)

A universally composable PAKE with zero communication cost. (And why it shouldn't be considered UC-secure) ⋮ Randomized half-ideal cipher on groups with applications to UC (a)PAKE ⋮ EKE meets tight security in the universally composable framework

Uses Software

• HMQV
• Keccak
• Elligator
• XooTools
• Gimli

Cites Work

• Unnamed Item
• Unnamed Item
• Smooth NIZK arguments
• OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
• Indifferentiability of iterated Even-Mansour ciphers with non-idealized key-schedules: five rounds are necessary and sufficient
• Round-reduced modular construction of asymmetric password-authenticated key exchange
• Invalid curve attacks in a GLS setting
• On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding
• Universally composable relaxed password authenticated key exchange
• KHAPE: Asymmetric PAKE from key-hiding key exchange
• Strong asymmetric PAKE based on trapdoor CKEM
• Indifferentiability of 8-Round Feistel Networks
• On the Indifferentiability of Key-Alternating Ciphers
• Elligator Squared: Uniform Points on Elliptic Curves of Prime Order as Uniform Random Strings
• One-Pass HMQV and Asymmetric Key-Wrapping
• A Domain Extender for the Ideal Cipher
• Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
• Keccak
• Injective Encodings to Elliptic Curves
• Universally Composable Password-Based Key Exchange
• The equivalence of the random oracle model and the ideal cipher model, revisited
• HMQV: A High-Performance Secure Diffie-Hellman Protocol
• Topics in Cryptology – CT-RSA 2005
• 10-Round Feistel is Indifferentiable from an Ideal Cipher
• Indifferentiability of Confusion-Diffusion Networks
• A Method for Making Password-Based Key Exchange Resilient to Server Compromise
• Algorithmic Number Theory

This page was built for publication: Asymmetric PAKE with low computation \textit{and} communication