Succinct delegation for low-space non-deterministic computation-Reference-Cited by-同舟云学术

Succinct delegation for low-space non-deterministic computation

Published:2018-06-20 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Badrinarayanan Saikrishna¹,Kalai Yael Tauman²,Khurana Dakshita¹,Sahai Amit¹,Wichs Daniel³

Affiliation:

1. University of California at Los Angeles, USA

2. Microsoft Research, USA / Massachusetts Institute of Technology, USA

3. Northeastern University, USA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3188745.3188924

Reference47 articles.

1. Prabhanjan Ananth Yu-Chi Chen Kai-Min Chung Huijia Lin and Wei-Kai Lin. 2015. Prabhanjan Ananth Yu-Chi Chen Kai-Min Chung Huijia Lin and Wei-Kai Lin. 2015.

2. Non-deterministic exponential time has two-prover interactive protocols

3. Michael Ben-Or Shafi Goldwasser Joe Kilian and Avi Wigderson. 1988. Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions. 113–131. 10.1145/62212.62223 Michael Ben-Or Shafi Goldwasser Joe Kilian and Avi Wigderson. 1988. Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions. 113–131. 10.1145/62212.62223

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. No-Signaling Linear PCPs;Journal of Cryptology;2023-03-22

2. Holographic SNARGs for P and Batch-NP from (Polynomially Hard) Learning with Errors;Theory of Cryptography;2023

3. Locally Verifiable Distributed SNARGs;Theory of Cryptography;2023

4. Impossibilities in Succinct Arguments: Black-Box Extraction and More;Progress in Cryptology - AFRICACRYPT 2023;2023

5. Non-Interactive Publicly-Verifiable Delegation of Committed Programs;Lecture Notes in Computer Science;2023