All-but-many lossy trapdoor functions from lattices and applications
From MaRDI portal
Publication:1675206
DOI10.1007/978-3-319-63697-9_11zbMath1406.94028OpenAlexW2727073142MaRDI QIDQ1675206
Publication date: 27 October 2017
Full work available at URL: https://eprints.qut.edu.au/128467/2/2017-532.pdf
Related Items (12)
Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More ⋮ SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions ⋮ Regular lossy functions and their applications in leakage-resilient cryptography ⋮ Simulation-based selective opening security for receivers under chosen-ciphertext attacks ⋮ Cumulatively all-lossy-but-one trapdoor functions from standard assumptions ⋮ Simulation-based bi-selective opening security for public key encryption ⋮ Possibility and impossibility results for receiver selective opening secure PKE in the multi-challenge setting ⋮ Receiver selective opening security for identity-based encryption in the multi-challenge setting ⋮ Direct computation of branching programs and its applications to more efficient lattice-based cryptography ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Practical public key encryption with selective opening security for receivers ⋮ CCA-security from adaptive all-but-one lossy trapdoor functions
This page was built for publication: All-but-many lossy trapdoor functions from lattices and applications
