{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T16:29:30Z","timestamp":1730305770222,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1109\/wifs.2015.7368568","type":"proceedings-article","created":{"date-parts":[[2016,1,4]],"date-time":"2016-01-04T16:34:47Z","timestamp":1451925287000},"page":"1-6","source":"Crossref","is-referenced-by-count":4,"title":["Some applications of verifiable computation to biometric verification"],"prefix":"10.1109","author":[{"given":"Julien","family":"Bringer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herve","family":"Chabanne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Firas","family":"Kraiem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roch","family":"Lescuyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Soria-Vazquez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"113","author":"goldwasser","year":"0","journal-title":"Delegating computation interactive proofs for muggles In ACM Symposium on Theory of Computing - STOC'08"},{"key":"ref11","first-page":"186","volume":"18","author":"goldwasser","year":"1989","journal-title":"The knowledge complexity of interactive proof systems SIAM J Comput"},{"key":"ref12","first-page":"278","author":"ishai","year":"2007","journal-title":"Efficient arguments without short PCPs In IEEE CCC"},{"journal-title":"ISO\/IEC 19794–2 Information technology - Biometric data interchange formats - part 2 Finger minutiae data","year":"0","key":"ref13"},{"key":"ref14","first-page":"765","author":"kosba","year":"0","journal-title":"TRUESET faster verifiable set computations In Proceedings of the 23rd USENIX Security Symposium"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-85729-932-1"},{"key":"ref16","first-page":"238","author":"parno","year":"0","journal-title":"Pinocchio Nearly practical verifiable computation In IEEE Symposium on Security and Privacy - SP'13"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/34.531800"},{"journal-title":"Making argument systems for outsourced computation practical (sometimes) In NDSS'12 The Internet Society","year":"2012","author":"setty","key":"ref18"},{"key":"ref19","volume":"15","author":"wahby","year":"2015","journal-title":"Efficient RAM and control flow in verifiable outsourced computation In NDSS’"},{"key":"ref4","first-page":"11","volume":"16","author":"blanton","year":"2013","journal-title":"Secure and verifiable outsourcing of large-scale biometric computations ACM Trans Inf Syst Secur"},{"key":"ref3","first-page":"90","volume":"8043","author":"ben-sasson","year":"2013","journal-title":"SNARKs for C Verifying program executions succinctly and in zero knowledge In CRYPTO"},{"key":"ref6","first-page":"253","author":"costello","year":"0","journal-title":"Geppetto Versatile verifiable computation In IEEE Symposium on Security and Privacy - SP'15"},{"key":"ref5","first-page":"341","author":"benjamin","year":"2013","journal-title":"Verifying computations with state In ACM SIGOPS SOSP"},{"key":"ref8","first-page":"844","author":"fiore","year":"2014","journal-title":"Efficiently verifiable computation on encrypted data In ACM CCS'14"},{"key":"ref7","volume":"14","author":"daugman","year":"2004","journal-title":"How iris recognition works IEEE Trans Circuits Syst Video Technol"},{"key":"ref2","first-page":"319","volume":"3897","author":"barreto","year":"2006","journal-title":"Pairing-friendly elliptic curves of prime order In Selected Areas in Cryptography - SAC'05"},{"key":"ref1","first-page":"70","volume":"45","author":"arora","year":"1998","journal-title":"Probabilistic checking of proofs A new characterization of NP J ACM"},{"key":"ref9","first-page":"626","volume":"7881","author":"gennaro","year":"2013","journal-title":"Quadratic span programs and succinct NIZKs without PCPs In Advances in Cryptology - EUROCRYPT'13"},{"key":"ref20","first-page":"165","volume":"20","author":"walfish","year":"2013","journal-title":"Verifying computations without reexecuting them from theoretical possibility to near-practicality (ECCC)"}],"event":{"name":"2015 IEEE International Workshop on Information Forensics and Security (WIFS)","start":{"date-parts":[[2015,11,16]]},"location":"Roma, Italy","end":{"date-parts":[[2015,11,19]]}},"container-title":["2015 IEEE International Workshop on Information Forensics and Security (WIFS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7364553\/7368550\/07368568.pdf?arnumber=7368568","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T23:28:43Z","timestamp":1490398123000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7368568\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/wifs.2015.7368568","relation":{},"subject":[],"published":{"date-parts":[[2015,11]]}}}