Witness indistinguishability for any single-round argument with applications to access control

DOI10.1007/978-3-030-45388-6_4zbMath1481.94088OpenAlexW3023943259MaRDI QIDQ2055687

Zvika Brakerski, Yael Kalai

Publication date: 1 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-45388-6_4

zbMATH Keywords

access policysuccinct single-round delegation scheme

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

SNARGs for P from sub-exponential DDH and QR ⋮ Non-interactive publicly-verifiable delegation of committed programs ⋮ Verifiable private information retrieval ⋮ Round-optimal black-box commit-and-prove with succinct communication

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Trapdoor hash functions and their applications
• Maliciously Circuit-Private FHE
• Secure Two-Party Computation with Low Communication
• Delegating Computation
• 3-Message Zero Knowledge Against Human Ignorance
• i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
• Non-interactive delegation and batch NP verification from standard computational assumptions
• Succinct delegation for low-space non-deterministic computation
• How to delegate computations
• Constant-round interactive proofs for delegating computation
• Smooth Projective Hashing and Two-Message Oblivious Transfer
• Recursive composition and bootstrapping for SNARKS and proof-carrying data
• Delegation for bounded space

This page was built for publication: Witness indistinguishability for any single-round argument with applications to access control