Author:
Bartusek James,Bronfman Liron,Holmgren Justin,Ma Fermi,Rothblum Ron D.
Publisher
Springer International Publishing
Reference44 articles.
1. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM (JACM) 45(3), 501–555 (1998)
2. Barak, B.: How to go beyond the black-box simulation barrier. In: FOCS (2001)
3. Bünz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: Short proofs for confidential transactions and more. In: 2018 IEEE Symposium on Security and Privacy, pp. 315–334. IEEE Computer Society Press, May 2018
4. Ben-Sasson, E., et al.: Computational integrity with a public random string from quasi-linear PCPs. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10212, pp. 551–579. Springer, Cham (2017).
https://doi.org/10.1007/978-3-319-56617-7_19
5. Bartusek, J., Bronfman, L., Holmgren, J., Ma, F., Rothblum, R.D.: On the (in)security of kilian-basen snargs. Cryptology ePrint Archive, Report 2019/997 (2019.
https://eprint.iacr.org/2018/997
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. When Arthur Has Neither Random Coins Nor Time to Spare: Superfast Derandomization of Proof Systems;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption;Advances in Cryptology – EUROCRYPT 2023;2023
3. SNARGs for $\mathcal{P}$ from LWE;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
4. SNARGs for P from Sub-exponential DDH and QR;Advances in Cryptology – EUROCRYPT 2022;2022
5. Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge);Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15