Statistical Zaps and new oblivious transfer protocols
type: Item
instance of: scholarly article
title: Statistical Zaps and new oblivious transfer protocols
zbMATH Open document ID: 1479.94180
DOI: 10.1007/978-3-030-45727-3_23
author: Vipul Goyal
author: Abhishek Jain
author: Zhengzhong Jin
author: Giulio Malavolta
publication date: 2021-12-01T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 68M12
zbMATH DE Number: 7436961
zbMATH Keywords: interactive proof systems
zbMATH Keywords: oblivious transfer
MaRDI profile type: Publication
full work available at URL: 978-3-030-45727-3 23
OpenAlex ID: W3013529605
cites work: Q2778845
cites work: Statistical ZAP arguments
cites work: Two-message witness indistinguishability and secure computation in the plain model from new assumptions
cites work: Advances in Cryptology - CRYPTO 2003
cites work: ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
cites work: Two-message statistically sender-private OT from LWE
cites work: Fiat-Shamir: from practice to theory
cites work: Q4542539
cites work: Q4940695
cites work: Q4737235
cites work: Q3789104
cites work: Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
cites work: Zaps and Their Applications
cites work: Magic Functions
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: On the Composition of Zero-Knowledge Proof Systems
cites work: Definitions and properties of zero-knowledge proof systems
cites work: The knowledge complexity of interactive proof-systems
cites work: Non-interactive Zaps and New Techniques for NIZK
cites work: Perfect Non-interactive Zero Knowledge for NP
cites work: Round-optimal secure multi-party computation
cites work: Smooth projective hashing and two-message oblivious transfer
cites work: Distinguisher-dependent simulation in two rounds and its applications
cites work: Smooth Projective Hashing and Two-Message Oblivious Transfer
cites work: Statistical witness indistinguishability (and more) in two messages
cites work: Statistical ZAPR arguments from bilinear maps
cites work: Efficient oblivious transfer protocols
cites work: Q4434874
cites work: Noninteractive zero knowledge for NP from (Plain) Learning With Errors
cites work: Oblivious Transfer Is Symmetric
description: scientific article; zbMATH DE number 7436961