S. Arora and S. Safra, Probabilistic checking of proofs: A new characterization of NP, J. ACM pp, pp.70-122, 1998.

E. Ben-sasson, A. Chiesa, D. Genkin, E. Tromer, and M. Virza, SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge, Advances in Cryptology -CRYPTO 2013. Proceedings, Part II, pp.90-108, 2013.
DOI : 10.1007/978-3-642-40084-1_6

URL : http://eprint.iacr.org/2013/507.pdf

J. Bringer, H. Chabanne, F. Kraiem, R. Lescuyer, and E. Soria-vazquez, Some applications of verifiable computation to biometric verification, 2015 IEEE International Workshop on Information Forensics and Security (WIFS), p.2015, 2015.
DOI : 10.1109/WIFS.2015.7368568

G. Cormode, M. Mitzenmacher, and J. Thaler, Practical verified computation with streaming interactive proofs, Proceedings of the 3rd Innovations in Theoretical Computer Science Conference on, ITCS '12, pp.90-112, 2012.
DOI : 10.1145/2090236.2090245

G. Cormode, J. Thaler, and K. Yi, Verifying computations with streaming interactive proofs, Conference on Very Large Data Bases ? VLDB'12, 2012.
DOI : 10.14778/2047485.2047488

C. Costello, C. Fournet, J. Howell, M. Kohlweiss, B. Kreuter et al., Geppetto: Versatile Verifiable Computation, 2015 IEEE Symposium on Security and Privacy, 2015.
DOI : 10.1109/SP.2015.23

J. Daugman, How Iris Recognition Works, IEEE Transactions on Circuits and Systems for Video Technology, vol.14, issue.1, pp.21-30, 2004.
DOI : 10.1109/TCSVT.2003.818350

URL : http://www.cl.cam.ac.uk/users/jgd1000/irisrecog.ps.gz

R. Gennaro, C. Gentry, B. Parno, and M. Raykova, Quadratic Span Programs and Succinct NIZKs without PCPs, EUROCRYPT 2013, 2013.
DOI : 10.1007/978-3-642-38348-9_37

URL : http://eprint.iacr.org/2012/215.pdf

S. Goldwasser, Y. T. Kalai, and G. N. Rothblum, Delegating computation: Interactive proofs for muggles, STOC '08, pp.113-122, 2008.
DOI : 10.1145/2699436

S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof-systems, Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, p.85, 1985.

Y. Ishai, E. Kushilevitz, and R. Ostrovsky, Efficient Arguments without Short PCPs, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 2007.
DOI : 10.1109/CCC.2007.10

URL : http://www.cs.ucla.edu/~rafail/PUBLIC/79.pdf

A. K. Jain, A. Ross, and S. Prabhakar, An Introduction to Biometric Recognition, IEEE Transactions on Circuits and Systems for Video Technology, vol.14, issue.1, pp.4-20, 2004.
DOI : 10.1109/TCSVT.2003.818349

URL : http://biometrics.cse.msu.edu/Publications/GeneralBiometrics/JainRossPrabhakar_BiometricIntro_CSVT04.pdf

Y. Lecun, L. Bottou, Y. Bengio, and P. Haffner, Gradient-based learning applied to document recognition, Proceedings of the IEEE, vol.86, issue.11, pp.2278-2324, 1998.
DOI : 10.1109/5.726791

C. Lund, L. Fortnow, H. Karloff, and N. Nisan, Algebraic methods for interactive proof systems, J. ACM pp, pp.859-868, 1992.
DOI : 10.1109/fscs.1990.89518

URL : http://csdl2.computer.org/comp/proceedings/sfcs/1990/2082/00/089518.pdf

S. Micali, Computationally sound proofs, SIAM J. Comput. pp, pp.1253-1298, 2000.
DOI : 10.1137/s0097539795284959

URL : http://people.csail.mit.edu/silvio/Selected%20Scientific%20Papers/Proof%20Systems/Computationally_Sound_Proofs.pdf

B. Parno, J. Howell, C. Gentry, and M. Raykova, Pinocchio, IEEE Symposium on Security and Privacy, p.13, 2013.
DOI : 10.1007/978-1-4614-1460-5

F. Schroff, D. Kalenichenko, and J. Philbin, FaceNet: A unified embedding for face recognition and clustering, 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2015.
DOI : 10.1109/CVPR.2015.7298682

URL : http://arxiv.org/abs/1503.03832

S. Setty, B. Braun, V. Vu, A. Blumberg, B. Parno et al., Resolving the conflict between generality and plausibility in verified computation, Proceedings of the 8th ACM European Conference on Computer Systems, EuroSys '13, p.EuroSys, 2013.
DOI : 10.1145/2465351.2465359

S. Setty, R. Mcpherson, A. J. Blumberg, and M. Walfish, Making argument systems for outsourced computation practical (sometimes), p.NDSS, 2012.

S. T. Setty, V. Vu, N. Panpalia, B. Braun, A. J. Blumberg et al., Taking proof-based verified computation a few steps closer to practicality, USENIX Security Symposium, pp.253-268, 2012.

Y. Taigman, M. Yang, M. A. Ranzato, and L. Wolf, DeepFace: Closing the Gap to Human-Level Performance in Face Verification, 2014 IEEE Conference on Computer Vision and Pattern Recognition, 2014.
DOI : 10.1109/CVPR.2014.220

J. Thaler, Time-Optimal Interactive Proofs for Circuit Evaluation, Advances in Cryptology ? CRYPTO 2013, pp.71-89, 2013.
DOI : 10.1007/978-3-642-40084-1_5

R. S. Wahby, S. Setty, Z. Ren, A. J. Blumberg, and M. Walfish, Efficient RAM and Control Flow in Verifiable Outsourced Computation, Proceedings 2015 Network and Distributed System Security Symposium, p.NDSS, 2015.
DOI : 10.14722/ndss.2015.23097

M. Walfish and A. J. Blumberg, Verifying computations without reexecuting them, Communications of the ACM, vol.58, issue.2, 2015.
DOI : 10.14722/ndss.2015.23097

URL : http://dl.acm.org/ft_gateway.cfm?id=2641562&type=pdf