Statistical ZAP arguments

DOI10.1007/978-3-030-45727-3_22MaRDI QIDQ2055672zbMATH OpenOpenAlexFDO

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

Publication date 1 December 2021

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

zbMATH Keywords

computational witness indistinguishabilitycryptographic primitivesmessage public coin witness indistinguishable proofs

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Statistical ZAPR arguments from bilinear maps
• Non-interactive Zaps and New Techniques for NIZK
• Statistical witness indistinguishability (and more) in two messages
• Zaps and Their Applications
• Applied Cryptography and Network Security

Cites work

• Distinguisher-dependent simulation in two rounds and its applications
• Efficient oblivious transfer protocols
• Fiat-Shamir: from practice to theory
• How to use indistinguishability obfuscation
• scientific article; zbMATH DE number 4037760 (Why is no real title available?)
• scientific article; zbMATH DE number 4101089 (Why is no real title available?)
• scientific article; zbMATH DE number 1406779 (Why is no real title available?)
• Non-interactive Zaps and New Techniques for NIZK
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• Smooth Projective Hashing and Two-Message Oblivious Transfer
• Smooth projective hashing and two-message oblivious transfer
• Statistical witness indistinguishability (and more) in two messages
• Two-message statistically sender-private OT from LWE
• Two-message witness indistinguishability and secure computation in the plain model from new assumptions
• ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
• Zaps and Their Applications

Cited in

(33)

• Statistical witness indistinguishability (and more) in two messages
• 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
• (Commit-and-prove) predictable arguments with privacy
• Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
• Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
• Compact ring signatures from learning with errors
• SNARGs for P from sub-exponential DDH and QR
• 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
• Dwork-Naor ZAP and its application in deniable authentication, revisited
• Applied Cryptography and Network Security
• ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
• 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
• Compact accountable ring signatures in the plain model
• Two-round concurrent 2PC from sub-exponential LWE
• Witness semantic security
• Sometimes-decryptable homomorphic encryption from sub-exponential DDH
• On the black-box complexity of correlation intractability
• A hidden-bits approach to statistical ZAPs from LWE
• Round-optimal compiler for semi-honest to malicious oblivious transfer via CIH

This page was built for publication: Statistical ZAP arguments

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