Recommendations
- Smooth projective hashing and password-based authenticated key exchange from lattices
- Disjunctions for Hash Proof Systems: New Constructions and Applications
- New techniques for SPHFs and efficient one-round PAKE protocols
- A gapless code-based hash proof system based on RQC and its applications
- Smooth zero-knowledge hash functions
Cited in
(20)- A gapless code-based hash proof system based on RQC and its applications
- A generic construction of tightly secure password-based authenticated key exchange
- Disjunctions for Hash Proof Systems: New Constructions and Applications
- How not to create an isogeny-based PAKE
- Smooth projective hashing and password-based authenticated key exchange from lattices
- Two-round adaptively secure multiparty computation from standard assumptions
- Witness encryption from smooth projective hashing system
- Smooth zero-knowledge hash functions
- Leftover Hash Lemma, Revisited
- Public key authenticated encryption with keyword search from LWE
- The Boneh-Katz transformation, revisited: pseudorandom/obliviously-samplable PKE from lattices and codes and its application
- Identity-based encryption in DDH hard groups
- Almost tight multi-user security under adaptive corruptions from LWE in the standard model
- Lattice-based authenticated key exchange with tight security
- Multi-theorem preprocessing NIZKs from lattices
- Universal composable password authenticated key exchange for the post-quantum world
- A gapless post-quantum hash proof system in the Hamming metric
- PAKEs: new framework, new techniques and more efficient lattice-based constructions in the standard model
- Covert authentication from lattices
- Keyed-fully homomorphic encryption without indistinguishability obfuscation
This page was built for publication: Hash proof systems over lattices revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753871)
