1. Ben-Sasson E, Bentov I, Horesh Y, Riabzev M (2018) Scalable, transparent, and post-quantum secure computational integrity. IACR Cryptol 46. ePrint Archive 2018. Available at https://eprint.iacr.org/2018/046.pdf
2. Groth J (2016) On the size of pairing-based non-interactive arguments. In: EUROCRYPT 2016. LNCS, vol 9666. Springer, Berlin, pp 305–326. https://doi.org/10.1007/978-3-662-49896-5_11
3. Parno B, Howell J, Gentry C, Raykova M (2013) Pinocchio: nearly practical verifiable computation. In: IEEE symposium on security and privacy. IEEE Computer Society, pp 238–252. https://doi.org/10.1109/SP.2013.47
4. Hopwood D, Bowe S, Hornby T, Wilcox N (2019) Zcash protocol specifcation: Version 2019.0-beta-37 [overwinter+sapling]. Technical Report, Zerocoin Electric Coin Company. Available at https://github.com/zcash/zips/blob/master/protocol/protocol.pdf
5. Grassi L, Kales D, Khovratovich D, Roy A, Rechberger C, Schofnegger M (2019) Starkad and poseidon: new hash functions for zero knowledge proof systems. IACR Cryptol 458. ePrint Archive 2019. Available at https://eprint.iacr.org/2019/458.pdf