Trapdoor functions from the computational Diffie-Hellman assumption
From MaRDI portal
Publication:1784099
DOI10.1007/978-3-319-96881-0_13zbMATH Open1436.94067OpenAlexW2805321060MaRDI QIDQ1784099FDOQ1784099
Authors: 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
Recommendations
Cited In (20)
- Paillier's trapdoor function hides up to \(O(n)\) bits
- Use of trapdoor structures in cryptography
- A Feebly Secure Trapdoor Function
- Fine-grained cryptography revisited
- Efficient laconic cryptography from learning with errors
- Rate-1 trapdoor functions from the Diffie-Hellman problem
- Minicrypt primitives with algebraic structure and applications
- Non-interactive batch arguments for NP from standard assumptions
- How to build a trapdoor function from an encryption scheme
- Injective rank metric trapdoor functions with homogeneous errors
- A note on non-interactive zero-knowledge from CDH
- Anonymous (hierarchical) identity-based encryption from broader assumptions
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Efficient range-trapdoor functions and applications: rate-1 OT and more
- New techniques for efficient trapdoor functions and applications
- Amortizing rate-1 OT and applications to PIR and PSI
- Algebraic (trapdoor) one-way functions: constructions and applications
- General construction of chameleon all-but-one trapdoor functions
- Chosen ciphertext security from injective trapdoor functions
- New constructions of hinting PRGs, OWFs with encryption, and more
This page was built for publication: Trapdoor functions from the computational Diffie-Hellman assumption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784099)
