Pages that link to "Item:Q1753871"
From MaRDI portal
The following pages link to Hash proof systems over lattices revisited (Q1753871):
Displaying 15 items.
- Two-round adaptively secure multiparty computation from standard assumptions (Q1629408) (← links)
- Keyed-fully homomorphic encryption without indistinguishability obfuscation (Q2096599) (← links)
- Covert authentication from lattices (Q2096622) (← links)
- A gapless code-based hash proof system based on RQC and its applications (Q2099170) (← links)
- How not to create an isogeny-based PAKE (Q2229270) (← links)
- Disjunctions for Hash Proof Systems: New Constructions and Applications (Q2948379) (← links)
- PAKEs: New Framework, New Techniques and More Efficient Lattice-Based Constructions in the Standard Model (Q5041165) (← links)
- Leftover Hash Lemma, Revisited (Q5199181) (← links)
- Multi-theorem preprocessing NIZKs from lattices (Q5918862) (← links)
- Identity-based encryption in DDH hard groups (Q6103077) (← links)
- Smooth zero-knowledge hash functions (Q6157605) (← links)
- A gapless post-quantum hash proof system in the Hamming metric (Q6535099) (← links)
- A generic construction of tightly secure password-based authenticated key exchange (Q6562583) (← links)
- The Boneh-Katz transformation, revisited: pseudorandom/obliviously-samplable PKE from lattices and codes and its application (Q6618581) (← links)
- Universal composable password authenticated key exchange for the post-quantum world (Q6637717) (← links)