An efficient strong asymmetric PAKE compiler instantiable from group actions
From MaRDI portal
Publication:6562584
DOI10.1007/978-981-99-8742-9_6zbMATH Open1542.94158MaRDI QIDQ6562584
Publication date: 26 June 2024
Cryptography (94A60) Theory of compilers and interpreters (68N20) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Small generic hardcore subsets for the discrete logarithm: short secret DL-keys.
- OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
- CSIDH: an efficient post-quantum commutative group action
- The algebraic group model and its applications
- Compact, efficient and UC-secure isogeny-based oblivious transfer
- Universally composable relaxed password authenticated key exchange
- A classification of computational assumptions in the algebraic group model
- Separating symmetric and asymmetric password-authenticated key exchange
- The ``Quantum annoying property of password-authenticated key exchange protocols
- CSI-FiSh: efficient isogeny based signatures through class group computations
- Strong asymmetric PAKE based on trapdoor CKEM
- Cryptographic group actions and applications
- Efficient Password Authenticated Key Exchange via Oblivious Transfer
- Random Oracles in a Quantum World
- Universally Composable Quantum Multi-party Computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Universally Composable Password-Based Key Exchange
- A Method for Making Password-Based Key Exchange Resilient to Server Compromise
- Security Analysis of CPace
- Generic models for group actions
- 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
- Password-authenticated key exchange from group actions
- How to obfuscate MPC inputs
- Algebraic adversaries in the universal composability framework
- CHIP and CRISP: protecting all parties against compromise through identity-binding PAKEs
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)