On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-interactive Arguments-Reference-Cited by-同舟云学术

On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-interactive Arguments

Published:2017 Issue: Volume: Page:283-315
ISSN:0302-9743
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Paneth Omer,Rothblum Guy N.

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-70503-3_9

Reference48 articles.

1. Lecture Notes in Computer Science;W Aiello,2000

2. Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: Recursive composition and bootstrapping for SNARKS and proof-carrying data. In: STOC, pp. 111–120 (2013)

3. Lecture Notes in Computer Science;N Bitansky,2013

4. Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking computations in polylogarithmic time. In: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 5–8 May 1991, New Orleans, Louisiana, USA, pp. 21–31 (1991)

5. Bitansky, N., Garg, S., Lin, H., Pass, R., Telang, S.: Succinct randomized encodings and their applications. In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, 14–17 June 2015, pp. 439–448 (2015)

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

1. Succinct Functional Commitments for Circuits from k-$$\textsf{Lin}$$;Lecture Notes in Computer Science;2024

2. Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance;Lecture Notes in Computer Science;2024

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

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

5. On Black-Box Knowledge-Sound Commit-And-Prove SNARKs;Advances in Cryptology – ASIACRYPT 2023;2023