Aniket Kate, Gregory M. Zaverucha, and Ian Goldberg. Constant-size commitments to polynomials and their applications. In Masayuki Abe, editor, ASIACRYPT 2010, volume 6477 of LNCS, pages 177194. Springer, Heidelberg, December 2010.

Jens Groth. On the size of pairing-based non-interactive arguments. In Marc Fischlin and Jean-S ́ebastien Coron, editors, EUROCRYPT 2016, Part II, volume 9666 of LNCS, pages 305–326. Springer, Heidelberg, May 2016. doi:10.1007/978-3-662-49896-5_11.

Ariel Gabizon, Zachary J. Williamson, and Oana Ciobotaru. Plonk: Permutations over Lagrange bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, Report 2019/953, 2019.

Miguel Ambrona, Marc Beunardeau, Anne-Laure Schmitt, and Raphaël R.Toledo, aPlonK: Aggregated PlonK from Multi-Polynomial Commitment Schemes,, 2022.

Gailly, N., Maller, M., Nitulescu, A. (2022). SnarkPack: Practical SNARK Aggregation. In: Eyal, I., Garay, J. (eds) Financial Cryptography and Data Security. FC 2022. Lecture Notes in Computer Science, vol 13411. Springer, Cham. 031-18283-9_10.

Benedikt Bünz, Mary Maller, Pratyush Mishra, Nirvan Tyagi, and PsiVesely. Proofs for inner pairing products and applications. In Mehdi Tibouchi and Huaxiong Wang, editors, ASIACRYPT 2021, Part III, volume 13092 of LNCS, pages 6597. Springer, Heidelberg, December 2021.

Last updated