NIZK from LPN and trapdoor hash via correlation intractability for approximable relations

Publication date: 7 December 2022

Related Items

Does Fiat-Shamir require a cryptographic hash function? ⋮ Non-interactive batch arguments for NP from standard assumptions ⋮ One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ SNARGs for P from sub-exponential DDH and QR ⋮ SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption ⋮ A generic transform from multi-round interactive proof to NIZK ⋮ Triply adaptive UC NIZK ⋮ Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head ⋮ Statistically sender-private OT from LPN and derandomization ⋮ PPAD is as hard as LWE and iterated squaring ⋮ Universal ring signatures in the standard model ⋮ A framework for statistically sender private OT with optimal rate ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ Correlation intractability and SNARGs from sub-exponential DDH ⋮ A note on non-interactive zero-knowledge from CDH ⋮ Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge) ⋮ Amortizing rate-1 OT and applications to PIR and PSI ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings ⋮ Non-interactive zero knowledge from sub-exponential DDH ⋮ NIZK from LPN and trapdoor hash via correlation intractability for approximable relations

Cites Work