PAKEs: New Framework, New Techniques and More Efficient Lattice-Based Constructions in the Standard Model
From MaRDI portal
Publication:5041165
DOI10.1007/978-3-030-45374-9_14zbMath1501.94069OpenAlexW3023458473MaRDI QIDQ5041165
Guang Gong, Jingnan He, Khoa Nguyen, Huaxiong Wang, Shaoquan Jiang
Publication date: 13 October 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-45374-9_14
Related Items
Almost tight multi-user security under adaptive corruptions from LWE in the standard model, Covert authentication from lattices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limits on the hardness of lattice problems in \(\ell_{p}\) norms
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\)
- Gaussian sampling over the integers: efficient, generic, constant-time
- Two-round PAKE from approximate SPH and instantiations from lattices
- Hash proof systems over lattices revisited
- Improved Short Lattice Signatures in the Standard Model
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Efficient Password Authenticated Key Exchange via Oblivious Transfer
- Lattice Cryptography for the Internet
- Provably Secure Password Authenticated Key Exchange Based on RLWE for the Post-Quantum World
- A Group Signature Scheme from Lattice Assumptions
- Public-Key Encryption Schemes with Auxiliary Inputs
- Trapdoors for hard lattices and new cryptographic constructions
- Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
- A Toolkit for Ring-LWE Cryptography
- Generating Shorter Bases for Hard Random Lattices
- On Ideal Lattices and Learning with Errors over Rings
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Selected Areas in Cryptography
- Financial Cryptography and Data Security
- On lattices, learning with errors, random linear codes, and cryptography
