Statistical Zaps and new oblivious transfer protocols

DOI10.1007/978-3-030-45727-3_23zbMath1479.94180OpenAlexW3013529605MaRDI QIDQ2055674

Vipul Goyal, Giulio Malavolta, Abhishek Jain, Zhengzhong Jin

Publication date: 1 December 2021

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

zbMATH Keywords

interactive proof systemsoblivious transfer

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12)

Related Items (18)

Compact ring signatures from learning with errors ⋮ On the concurrent composition of quantum zero-knowledge ⋮ SNARGs for P from sub-exponential DDH and QR ⋮ Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge ⋮ 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 ⋮ Knowledge encryption and its applications to simulatable protocols with low round-complexity ⋮ A framework for statistically sender private OT with optimal rate ⋮ A note on non-interactive zero-knowledge from CDH ⋮ Cryptographic group actions and applications ⋮ 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 ⋮ Non-interactive zero knowledge from sub-exponential DDH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth projective hashing and two-message oblivious transfer
• Definitions and properties of zero-knowledge proof systems
• 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
• Statistical ZAPR arguments from bilinear maps
• Statistical ZAP arguments
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• Magic Functions
• Oblivious Transfer Is Symmetric
• Perfect Non-interactive Zero Knowledge for NP
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• The knowledge complexity of interactive proof-systems
• On the Composition of Zero-Knowledge Proof Systems
• Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
• Fiat-Shamir: from practice to theory
• ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
• Smooth Projective Hashing and Two-Message Oblivious Transfer
• Advances in Cryptology - CRYPTO 2003
• Zaps and Their Applications
• Non-interactive Zaps and New Techniques for NIZK
• Round-optimal secure multi-party computation

This page was built for publication: Statistical Zaps and new oblivious transfer protocols