An efficient strong asymmetric PAKE compiler instantiable from group actions
From MaRDI portal
Publication:6562584
Recommendations
- Asymmetric PAKE with low computation \textit{and} communication
- Round-reduced modular construction of asymmetric password-authenticated key exchange
- Strong asymmetric PAKE based on trapdoor CKEM
- Password-authenticated key exchange from group actions
- OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
Cites work
- A classification of computational assumptions in the algebraic group model
- A Method for Making Password-Based Key Exchange Resilient to Server Compromise
- A universally composable PAKE with zero communication cost. (And why it shouldn't be considered UC-secure)
- Algebraic adversaries in the universal composability framework
- CHIP and CRISP: protecting all parties against compromise through identity-binding PAKEs
- Compact, efficient and UC-secure isogeny-based oblivious transfer
- Cryptographic group actions and applications
- CSI-FiSh: efficient isogeny based signatures through class group computations
- CSIDH: an efficient post-quantum commutative group action
- Decomposing finite Abelian groups
- Efficient password authenticated key exchange via oblivious transfer
- Generic models for group actions
- How to obfuscate MPC inputs
- scientific article; zbMATH DE number 1808213 (Why is no real title available?)
- scientific article; zbMATH DE number 1942415 (Why is no real title available?)
- OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
- Password-authenticated key exchange from group actions
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Random oracles in a quantum world
- Randomized half-ideal cipher on groups with applications to UC (a)PAKE
- Security Analysis of CPace
- Separating symmetric and asymmetric password-authenticated key exchange
- Small generic hardcore subsets for the discrete logarithm: short secret DL-keys.
- Strong asymmetric PAKE based on trapdoor CKEM
- The ``Quantum annoying property of password-authenticated key exchange protocols
- The algebraic group model and its applications
- Universally Composable Password-Based Key Exchange
- Universally composable quantum multi-party computation
- Universally composable relaxed password authenticated key exchange
Cited in
(6)- Compact password authenticated key exchange from group actions
- Making an asymmetric PAKE quantum-annoying by hiding group elements
- Threshold PAKE with security against compromise of all servers
- Efficient asymmetric PAKE compiler from KEM and AE
- Two-factor authentication can harden servers against offline password search
- OneTwoPAKE: two-round strong asymmetric PAKE with ideal security
This page was built for publication: An efficient strong asymmetric PAKE compiler instantiable from group actions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562584)
