Statistical zapr arguments from bilinear maps
© International Association for Cryptologic Research 2020. Dwork and Naor (FOCS ’00) defined ZAPs as 2-message witness-indistinguishable proofs that are public-coin. We relax this to ZAPs with private randomness (ZAPRs), where the verifier can use private coins to sample the first message (independe...
Main Authors: | Lombardi, Alex, Vaikuntanathan, Vinod, Wichs, Daniel |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
Springer International Publishing
2022
|
Online Access: | https://hdl.handle.net/1721.1/137207.2 |
Similar Items
-
Statistical zapr arguments from bilinear maps
Published: (2021) -
Boosting Batch Arguments and RAM Delegation
by: Kalai, Yael, et al.
Published: (2023) -
Extracting Randomness from Extractor-Dependent Sources
by: Dodis, Yevgeniy, et al.
Published: (2021) -
Leveled Fully Homomorphic Signatures from Standard Lattices
by: Gorbunov, Sergey, et al.
Published: (2017) -
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing
by: Brakerski, Zvika, et al.
Published: (2022)