Witness indistinguishability for any single-round argument with applications to access control
type: Item
instance of: scholarly article
title: Witness indistinguishability for any single-round argument with applications to access control
zbMATH Open document ID: 1481.94088
DOI: 10.1007/978-3-030-45388-6_4
author: Zvika Brakerski
author: Yael Kalai
publication date: 2021-12-01T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7436969
zbMATH Keywords: access policy
zbMATH Keywords: succinct single-round delegation scheme
MaRDI profile type: Publication
full work available at URL: 978-3-030-45388-6 4
OpenAlex ID: W3023943259
cites work: 3-Message Zero Knowledge Against Human Ignorance
cites work: Recursive composition and bootstrapping for SNARKS and proof-carrying data
cites work: Two-message statistically sender-private OT from LWE
cites work: Non-interactive delegation and batch NP verification from standard computational assumptions
cites work: Succinct delegation for low-space non-deterministic computation
cites work: Q3671884
cites work: Secure Two-Party Computation with Low Communication
cites work: Trapdoor hash functions and their applications
cites work: i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
cites work: Q3549691
cites work: Delegating Computation
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: Delegation for bounded space
cites work: How to delegate computations
cites work: Q5751927
cites work: Efficient oblivious transfer protocols
cites work: Maliciously Circuit-Private FHE
cites work: Constant-round interactive proofs for delegating computation
description: scientific article; zbMATH DE number 7436969