New techniques for efficient trapdoor functions and applications

DOI10.1007/978-3-030-17659-4_2MaRDI QIDQ2292685zbMATH OpenOpenAlexFDO

Authors Sanjam Garg, Romain Gay, Mohammad Hajiabadi

Publication date 4 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-17659-4_2

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Rate-1 trapdoor functions from the Diffie-Hellman problem
• Trapdoor functions from the computational Diffie-Hellman assumption
• Lossy Trapdoor Functions and Their Applications
• Lossy trapdoor functions and their applications
• Efficient range-trapdoor functions and applications: rate-1 OT and more

Cited in

(18)

• Trapdoor functions from the computational Diffie-Hellman assumption
• Efficient range-trapdoor functions and applications: rate-1 OT and more
• New constructions of hinting PRGs, OWFs with encryption, and more
• Chosen ciphertext security from injective trapdoor functions
• Targeted lossy functions and applications
• Rate-1 trapdoor functions from the Diffie-Hellman problem
• Trapdoor hash functions and their applications
• Laconic private set intersection and applications
• Amortizing rate-1 OT and applications to PIR and PSI
• Shrinking the keys of discrete-log-type lossy trapdoor functions
• Use of trapdoor structures in cryptography
• Fine-grained cryptography revisited
• CCA security and trapdoor functions via key-dependent-message security
• Minicrypt primitives with algebraic structure and applications
• Cumulatively all-lossy-but-one trapdoor functions from standard assumptions
• How to build a trapdoor function from an encryption scheme
• Laconic branching programs from the Diffie-Hellman assumption
• Adaptive TDF from any TDF via pseudorandom-ciphertext PKE

This page was built for publication: New techniques for efficient trapdoor functions and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292685)