Statistical ZAP arguments

DOI10.1007/978-3-030-45727-3_22zbMath1479.94120OpenAlexW2954950674MaRDI QIDQ2055672

Saikrishna Badrinarayanan, Dakshita Khurana, Amit Sahai, Fernando Rex, Aayush Jain

Publication date: 1 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-45727-3_22

zbMATH Keywords

cryptographic primitivescomputational witness indistinguishabilitymessage public coin witness indistinguishable proofs

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (21)

Compact ring signatures from learning with errors ⋮ SNARGs for P from sub-exponential DDH and QR ⋮ Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge ⋮ Maliciously-secure MrNISC in the plain model ⋮ Algebraic restriction codes and their applications ⋮ Logarithmic-size (linkable) threshold ring signatures in the plain model ⋮ Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) ⋮ Statistical security in two-party computation revisited ⋮ A framework for statistically sender private OT with optimal rate ⋮ A note on non-interactive zero-knowledge from CDH ⋮ Secure MPC: laziness leads to GOD ⋮ Post-quantum resettably-sound zero knowledge ⋮ The round complexity of quantum zero-knowledge ⋮ Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness ⋮ Statistical ZAPs from group-based assumptions ⋮ Statistical ZAPR arguments from bilinear maps ⋮ Statistical Zaps and new oblivious transfer protocols ⋮ Non-interactive zero knowledge from sub-exponential DDH ⋮ Post-quantum multi-party computation ⋮ Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth projective hashing and two-message oblivious transfer
• Two-message statistically sender-private OT from LWE
• Statistical witness indistinguishability (and more) in two messages
• Distinguisher-dependent simulation in two rounds and its applications
• Two-message witness indistinguishability and secure computation in the plain model from new assumptions
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• Fiat-Shamir: from practice to theory
• How to use indistinguishability obfuscation
• ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
• Smooth Projective Hashing and Two-Message Oblivious Transfer
• Zaps and Their Applications
• Non-interactive Zaps and New Techniques for NIZK

This page was built for publication: Statistical ZAP arguments