Hash proof systems over lattices revisited
From MaRDI portal
Publication:1753871
DOI10.1007/978-3-319-76581-5_22zbMath1400.94119OpenAlexW2789338552MaRDI QIDQ1753871
Olivier Blazy, Fabrice Benhamouda, Willy Quach, Léo Ducas
Publication date: 29 May 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-76581-5_22
Related Items (12)
PAKEs: New Framework, New Techniques and More Efficient Lattice-Based Constructions in the Standard Model ⋮ Two-round adaptively secure multiparty computation from standard assumptions ⋮ Identity-based encryption in DDH hard groups ⋮ Witness encryption from smooth projective hashing system ⋮ Public key authenticated encryption with keyword search from LWE ⋮ Lattice-based authenticated key exchange with tight security ⋮ Almost tight multi-user security under adaptive corruptions from LWE in the standard model ⋮ How not to create an isogeny-based PAKE ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Keyed-fully homomorphic encryption without indistinguishability obfuscation ⋮ Covert authentication from lattices ⋮ A gapless code-based hash proof system based on RQC and its applications
This page was built for publication: Hash proof systems over lattices revisited
