Trapdoor hash functions and their applications

DOI10.1007/978-3-030-26954-8_1zbMath1436.94054OpenAlexW2950017470MaRDI QIDQ2304914

Tamer Mour, Yuval Ishai, Rafail Ostrovsky, Nico Döttling, Sanjam Garg, Giulio Malavolta

Publication date: 9 March 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-26954-8_1

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (39)

Large message homomorphic secret sharing from DCR and applications ⋮ Does Fiat-Shamir require a cryptographic hash function? ⋮ Non-interactive batch arguments for NP from standard assumptions ⋮ Somewhere statistically binding commitment schemes with applications ⋮ Asymptotically quasi-optimal cryptography ⋮ Single-server private information retrieval with sublinear amortized time ⋮ Batch-OT with optimal rate ⋮ Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles ⋮ Compressible FHE with applications to PIR ⋮ Efficient laconic cryptography from learning with errors ⋮ Algebraic restriction codes and their applications ⋮ Bounded functional encryption for Turing machines: adaptive security from general assumptions ⋮ Sublinear secure computation from new assumptions ⋮ Cumulatively all-lossy-but-one trapdoor functions from standard assumptions ⋮ How to build a trapdoor function from an encryption scheme ⋮ Statistically sender-private OT from LPN and derandomization ⋮ Round-optimal black-box MPC in the plain model ⋮ A framework for statistically sender private OT with optimal rate ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH ⋮ Correlation intractability and SNARGs from sub-exponential DDH ⋮ A note on non-interactive zero-knowledge from CDH ⋮ Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers ⋮ The round complexity of quantum zero-knowledge ⋮ Rate-1 quantum fully homomorphic encryption ⋮ Somewhere statistical soundness, post-quantum security, and SNARGs ⋮ On derandomizing Yao's weak-to-strong OWF construction ⋮ Laconic private set intersection and applications ⋮ Amortizing rate-1 OT and applications to PIR and PSI ⋮ Minicrypt primitives with algebraic structure and applications ⋮ Private information retrieval with sublinear online time ⋮ SPARKs: succinct parallelizable arguments of knowledge ⋮ New constructions of statistical NIZKs: dual-mode DV-NIZKs and more ⋮ Witness indistinguishability for any single-round argument with applications to access control ⋮ Non-interactive zero knowledge from sub-exponential DDH ⋮ The rise of Paillier: homomorphic secret sharing and public-key silent OT ⋮ New constructions of hinting PRGs, OWFs with encryption, and more ⋮ NIZK from LPN and trapdoor hash via correlation intractability for approximable relations ⋮ Password protected secret sharing from lattices

This page was built for publication: Trapdoor hash functions and their applications