Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices

DOI10.1007/978-3-642-10366-7_37zbMath1267.94122MaRDI QIDQ3650718

Vinod Vaikuntanathan, Jonathan N. Katz

Publication date: 15 December 2009

Published in: Advances in Cryptology – ASIACRYPT 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10366-7_37

Mathematics Subject Classification ID

94A62: Authentication, digital signatures and secret sharing

Related Items

Efficient Password-Authenticated Key Exchange from RLWE Based on Asymmetric Key Consensus, PAKEs: New Framework, New Techniques and More Efficient Lattice-Based Constructions in the Standard Model, Group Key Establishment in a Quantum-Future Scenario, Multi-theorem preprocessing NIZKs from lattices, A universally composable PAKE with zero communication cost. (And why it shouldn't be considered UC-secure), Lattice-based authenticated key exchange with tight security, Almost tight multi-user security under adaptive corruptions from LWE in the standard model, Round-optimal password-based authenticated key exchange, Chosen ciphertext secure keyed-homomorphic public-key cryptosystems, Post-quantum key exchange for the Internet and the open quantum safe project, A simple provably secure AKE from the LWE problem, Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings, Covert authentication from lattices, A gapless code-based hash proof system based on RQC and its applications, How not to create an isogeny-based PAKE, Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification, Generic Construction of UC-Secure Oblivious Transfer, Augmented Learning with Errors: The Untapped Potential of the Error Term, Structure-Preserving Smooth Projective Hashing, Provably Secure Password Authenticated Key Exchange Based on RLWE for the Post-Quantum World, The Geometry of Lattice Cryptography, Approximate-Deterministic Public Key Encryption from Hard Learning Problems