Trapdoor functions from the computational Diffie-Hellman assumption
From MaRDI portal
Publication:1784099
DOI10.1007/978-3-319-96881-0_13zbMath1436.94067OpenAlexW2805321060MaRDI QIDQ1784099
Sanjam Garg, Mohammad Hajiabadi
Publication date: 26 September 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-96881-0_13
Related Items (9)
Non-interactive batch arguments for NP from standard assumptions ⋮ Efficient laconic cryptography from learning with errors ⋮ How to build a trapdoor function from an encryption scheme ⋮ A note on non-interactive zero-knowledge from CDH ⋮ Amortizing rate-1 OT and applications to PIR and PSI ⋮ Fine-grained cryptography revisited ⋮ Minicrypt primitives with algebraic structure and applications ⋮ New constructions of hinting PRGs, OWFs with encryption, and more ⋮ Chosen ciphertext security from injective trapdoor functions
This page was built for publication: Trapdoor functions from the computational Diffie-Hellman assumption
