共 91 条
- [31] Micali S., Computationally sound proofs, SIAM Journal on Computing, 30, 4, pp. 1253-1298, (2000)
- [32] Groth J., Short pairing-based non-interactive zero-knowledge arguments, Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, pp. 321-340, (2010)
- [33] Ishai Y, Kushilevitz E, Ostrovsky R., Efficient arguments without short PCPs, Proceedings of the 22nd Annual IEEE Conference on Computational Complexity, pp. 278-291, (2007)
- [34] Gennaro R, Gentry C, Parno B, Et al., Quadratic span programs and succinct NIZKs without PCPs, Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 626-645, (2013)
- [35] Lipmaa H., Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments, Proceedings of the Theory of Cryptography Conference, pp. 169-189, (2012)
- [36] Ben-Sasson E, Chiesa A, Genkin D, Et al., SNARKs for C: Verifying program executions succinctly and in zero knowledge, Proceedings of the Annual Cryptology Conference, pp. 90-108, (2013)
- [37] Ben-Sasson E, Chiesa A, Tromer E, Et al., Scalable zero knowledge via cycles of elliptic curves, Algorithmica, 79, 4, pp. 1102-1160, (2017)
- [38] Braun B, Feldman A J, Ren Z, Et al., Verifying computations with state, Proceedings of the 24th ACM Symposium on Operating Systems Principles, pp. 341-357, (2013)
- [39] Costello C, Fournet C, Howell J, Et al., Geppetto: Versatile verifiable computation, Proceedings of the 2015 IEEE Symposium on Security and Privacy, pp. 253-370, (2015)
- [40] Fiore D, Fournet C, Ghosh E, Et al., Hash first, argue later: Adaptive verifiable computations on outsourced data, Proceedings of the ACM SIGSAC Conference on Computer&Communications Security, pp. 1304-4316, (2016)