{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T20:03:17Z","timestamp":1769976197493,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,10,16]],"date-time":"2012-10-16T00:00:00Z","timestamp":1350345600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,10,16]]},"DOI":"10.1145\/2382196.2382249","type":"proceedings-article","created":{"date-parts":[[2012,10,15]],"date-time":"2012-10-15T17:13:12Z","timestamp":1350321192000},"page":"488-500","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Full proof cryptography"],"prefix":"10.1145","author":[{"given":"Jos\u00e9","family":"Bacelar Almeida","sequence":"first","affiliation":[{"name":"Universidade do Minho, Minho, Portugal"}]},{"given":"Manuel","family":"Barbosa","sequence":"additional","affiliation":[{"name":"Universidade do Minho, Minho, Portugal"}]},{"given":"Endre","family":"Bangerter","sequence":"additional","affiliation":[{"name":"Bern University of Applied Sciences, Bern, Switzerland"}]},{"given":"Gilles","family":"Barthe","sequence":"additional","affiliation":[{"name":"IMDEA Software Institute, Madrid, Spain"}]},{"given":"Stephan","family":"Krenn","sequence":"additional","affiliation":[{"name":"IST Austria, Klosterneuburg, Austria"}]},{"given":"Santiago","family":"Zanella B\u00e9guelin","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2012,10,16]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"https:\/\/abc4trust.eu\/","author":"Trust EU","year":"2011","unstructured":"ABC4 Trust EU Project . Official Website. https:\/\/abc4trust.eu\/ , 2011 . ABC4Trust EU Project. Official Website. https:\/\/abc4trust.eu\/, 2011."},{"key":"e_1_3_2_1_2_1","series-title":"LNCS","volume-title":"ESORICS '10","author":"Almeida J. B.","year":"2010","unstructured":"Almeida , J. B. , Bangerter , E. , Barbosa , M. , Krenn , S. , Sadeghi , A.-R. , and Schneider , T . A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on \u03a3-Protocols . In ESORICS '10 ( 2010 ), vol. 6345 of LNCS , Springer . Almeida, J. B., Bangerter, E., Barbosa, M., Krenn, S., Sadeghi, A.-R., and Schneider, T. A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on \u03a3-Protocols. In ESORICS '10 (2010), vol. 6345 of LNCS, Springer."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455816"},{"key":"e_1_3_2_1_4_1","first-page":"6","volume-title":"FSTTCS 2011","volume":"13","author":"Bain A.","year":"2011","unstructured":"Bain , A. , Mitchell , J. C. , Sharma , R. , Stefan , D. , and Zimmerman , J . A Domain-Specific Language for Computing on Encrypted Data (Invited Talk) . In FSTTCS 2011 ( 2011 ), vol. 13 of LIPIcs, Schloss Dagstuhl , pp. 6 -- 24 . Bain, A., Mitchell, J. C., Sharma, R., Stefan, D., and Zimmerman, J. A Domain-Specific Language for Computing on Encrypted Data (Invited Talk). In FSTTCS 2011 (2011), vol. 13 of LIPIcs, Schloss Dagstuhl, pp. 6--24."},{"key":"e_1_3_2_1_5_1","first-page":"09","author":"Bangerter E.","year":"2009","unstructured":"Bangerter , E. , Barzan , S. , Krenn , S. , Sadeghi , A.-R. , Schneider , T. , and Tsay , J.-K. Bringing zero-knowledge proofs of knowledge to practice. In SPW 09 ( 2009 ). Bangerter, E., Barzan, S., Krenn, S., Sadeghi, A.-R., Schneider, T., and Tsay, J.-K. Bringing zero-knowledge proofs of knowledge to practice. In SPW 09 (2009).","journal-title":"SPW"},{"key":"e_1_3_2_1_6_1","first-page":"09","author":"Bangerter E.","year":"2009","unstructured":"Bangerter , E. , Briner , T. , Heneka , W. , Krenn , S. , Sadeghi , A.-R. , and Schneider , T. Automatic generation of \u03a3-protocols. In EuroPKI 09 ( 2009 ). Bangerter, E., Briner, T., Heneka, W., Krenn, S., Sadeghi, A.-R., and Schneider, T. Automatic generation of \u03a3-protocols. In EuroPKI 09 (2009).","journal-title":"EuroPKI"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISSA.2011.6027533"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480894"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28641-4_12"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033036.2033043"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2010.24"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103670"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1029179.1029200"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1030083.1030103"},{"key":"e_1_3_2_1_16_1","volume-title":"ETH Zurich","author":"Briner T.","year":"2004","unstructured":"Briner , T. Compiler for zero-knowledge proof-of-knowledge protocols. Master's thesis , ETH Zurich , 2004 . Briner, T. Compiler for zero-knowledge proof-of-knowledge protocols. Master's thesis, ETH Zurich, 2004."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586114"},{"key":"e_1_3_2_1_18_1","series-title":"LNCS","first-page":"268","volume-title":"SCN 02","author":"Camenisch J.","year":"2002","unstructured":"Camenisch , J. , and Lysyanskaya , A . A Signature Scheme with Efficient Protocols . In SCN 02 ( 2002 ), vol. 2576 of LNCS , Springer , pp. 268 -- 289 . Camenisch, J., and Lysyanskaya, A. A Signature Scheme with Efficient Protocols. In SCN 02 (2002), vol. 2576 of LNCS, Springer, pp. 268--289."},{"key":"e_1_3_2_1_19_1","series-title":"LNCS","volume-title":"CRYPTO 03","author":"Camenisch J.","year":"2003","unstructured":"Camenisch , J. , and Shoup , V . Practical Verifiable Encryption and Decryption of Discrete Logarithms . In CRYPTO 03 ( 2003 ), vol. 2729 of LNCS , Springer . Camenisch, J., and Shoup, V. Practical Verifiable Encryption and Decryption of Discrete Logarithms. In CRYPTO 03 (2003), vol. 2729 of LNCS, Springer."},{"key":"e_1_3_2_1_20_1","series-title":"LNCS","first-page":"410","volume-title":"CRYPTO 97","author":"Camenisch J.","year":"1997","unstructured":"Camenisch , J. , and Stadler , M . Efficient group signature schemes for large groups . In CRYPTO 97 ( 1997 ), vol. 1294 of LNCS , Springer , pp. 410 -- 424 . Camenisch, J., and Stadler, M. Efficient group signature schemes for large groups. In CRYPTO 97 (1997), vol. 1294 of LNCS, Springer, pp. 410--424."},{"key":"e_1_3_2_1_21_1","volume-title":"IBM Research","author":"Camenisch","year":"2010","unstructured":"Camenisch phet al., J. Specification of the Identity Mixer Cryptographic Library (Version 2.3.0). Research Report RZ 3730 (#99740) , IBM Research , 2010 . Camenisch phet al., J. Specification of the Identity Mixer Cryptographic Library (Version 2.3.0). Research Report RZ 3730 (#99740), IBM Research, 2010."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/4372.4373"},{"key":"e_1_3_2_1_23_1","series-title":"LNCS","first-page":"118","volume-title":"CRYPTO","author":"Chaum D.","year":"1986","unstructured":"Chaum , D. , and Evertse , J . -H. A secure and privacy-protecting protocol for transmitting personal information between organizations . In CRYPTO ( 1986 ), vol. 263 of LNCS , Springer , pp. 118 -- 167 . Chaum, D., and Evertse, J.-H. A secure and privacy-protecting protocol for transmitting personal information between organizations. In CRYPTO (1986), vol. 263 of LNCS, Springer, pp. 118--167."},{"key":"e_1_3_2_1_25_1","series-title":"LNCS","first-page":"174","volume-title":"CRYPTO 94","author":"Cramer R.","year":"1994","unstructured":"Cramer , R. , Damg\u00e5rd , I. , and Schoenmakers , B . Proofs of partial knowledge and simplified design of witness hiding protocols . In CRYPTO 94 ( 1994 ), vol. 839 of LNCS , Springer , pp. 174 -- 187 . Cramer, R., Damg\u00e5rd, I., and Schoenmakers, B. Proofs of partial knowledge and simplified design of witness hiding protocols. In CRYPTO 94 (1994), vol. 839 of LNCS, Springer, pp. 174--187."},{"key":"e_1_3_2_1_26_1","volume-title":"Lecture on Cryptologic Protocol Theory","author":"Damg\u00e5rd I.","unstructured":"Damg\u00e5rd , I. On \u03a3-protocols, 2004. Lecture on Cryptologic Protocol Theory ; Faculty of Science, University of Aarhus. Damg\u00e5rd, I. On \u03a3-protocols, 2004. Lecture on Cryptologic Protocol Theory; Faculty of Science, University of Aarhus."},{"key":"e_1_3_2_1_27_1","series-title":"LNCS","first-page":"77","volume-title":"ASIACRYPT 02","author":"Damg\u00e5rd I.","year":"2002","unstructured":"Damg\u00e5rd , I. , and Fujisaki , E . A statistically-hiding integer commitment scheme based on groups with hidden order . In ASIACRYPT 02 ( 2002 ), vol. 2501 of LNCS , Springer , pp. 77 -- 85 . Damg\u00e5rd, I., and Fujisaki, E. A statistically-hiding integer commitment scheme based on groups with hidden order. In ASIACRYPT 02 (2002), vol. 2501 of LNCS, Springer, pp. 77--85."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00468-1_10"},{"key":"e_1_3_2_1_29_1","series-title":"LNCS","volume-title":"CRYPTO 86","author":"Fiat A.","year":"1987","unstructured":"Fiat , A. , and Shamir , A . How to prove yourself: practical solutions to identification and signature problems . In CRYPTO 86 ( 1987 ), vol. 263 of LNCS , Springer . Fiat, A., and Shamir, A. How to prove yourself: practical solutions to identification and signature problems. In CRYPTO 86 (1987), vol. 263 of LNCS, Springer."},{"key":"e_1_3_2_1_30_1","series-title":"LNCS","volume-title":"CRYPTO 97","author":"Fujisaki E.","year":"1997","unstructured":"Fujisaki , E. , and Okamoto , T . Statistical zero knowledge protocols to prove modular polynomial relations . In CRYPTO 97 ( 1997 ), vol. 1294 of LNCS , Springer . Fujisaki, E., and Okamoto, T. Statistical zero knowledge protocols to prove modular polynomial relations. In CRYPTO 97 (1997), vol. 1294 of LNCS, Springer."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653705"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116852"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22178"},{"key":"e_1_3_2_1_35_1","volume-title":"INRIA","author":"Gonthier G.","year":"2008","unstructured":"Gonthier , G. , Mahboubi , A. , and Tassi , E . A Small Scale Reflection Extension for the Coq system. Rapport de recherche RR-6455 , INRIA , 2008 . Gonthier, G., Mahboubi, A., and Tassi, E. A Small Scale Reflection Extension for the Coq system. Rapport de recherche RR-6455, INRIA, 2008."},{"key":"e_1_3_2_1_36_1","series-title":"LNCS","first-page":"216","volume-title":"CRYPTO 88","author":"Guillou L.","year":"1990","unstructured":"Guillou , L. , and Quisquater , J . -J. A \"paradoxical\" identity-based signature scheme resulting from zero-knowledge . In CRYPTO 88 ( 1990 ), vol. 403 of LNCS , Springer , pp. 216 -- 231 . Guillou, L., and Quisquater, J.-J. A \"paradoxical\" identity-based signature scheme resulting from zero-knowledge. In CRYPTO 88 (1990), vol. 403 of LNCS, Springer, pp. 216--231."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISA.2008.13"},{"key":"e_1_3_2_1_38_1","unstructured":"Lagrange J. L. \u00d8E uvres 1770.  Lagrange J. L. \u00d8E uvres 1770."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111042"},{"key":"e_1_3_2_1_40_1","series-title":"LNCS","first-page":"398","volume-title":"ASIACRYPT 03","author":"Lipmaa H.","year":"2003","unstructured":"Lipmaa , H. On diophantine complexity and statistical zeroknowledge arguments . In ASIACRYPT 03 ( 2003 ), vol. 2894 of LNCS , Springer , pp. 398 -- 415 . Lipmaa, H. On diophantine complexity and statistical zeroknowledge arguments. In ASIACRYPT 03 (2003), vol. 2894 of LNCS, Springer, pp. 398--415."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/948109.948139"},{"key":"e_1_3_2_1_42_1","volume-title":"USENIX Security Symposium","author":"Malkhi D.","year":"2004","unstructured":"Malkhi , D. , Nisan , N. , Pinkas , B. , and Sella , Y . Fairplay -- Secure two-party computation system . In USENIX Security Symposium ( 2004 ), USENIX Association. Malkhi, D., Nisan, N., Pinkas, B., and Sella, Y. Fairplay -- Secure two-party computation system. In USENIX Security Symposium (2004), USENIX Association."},{"key":"e_1_3_2_1_43_1","first-page":"193","volume-title":"ZKPDL: A Language-Based System for Efficient Zero-Knowledge Proofs and Electronic Cash. In USENIX Security Symposium","author":"Meiklejohn S.","year":"2010","unstructured":"Meiklejohn , S. , Erway , C. , K\u00fcp\u00e7\u00fc , A. , Hinkle , T. , and Lysyanskaya , A . ZKPDL: A Language-Based System for Efficient Zero-Knowledge Proofs and Electronic Cash. In USENIX Security Symposium ( 2010 ), USENIX Association , pp. 193 -- 206 . Meiklejohn, S., Erway, C., K\u00fcp\u00e7\u00fc, A., Hinkle, T., and Lysyanskaya, A. ZKPDL: A Language-Based System for Efficient Zero-Knowledge Proofs and Electronic Cash. In USENIX Security Symposium (2010), USENIX Association, pp. 193--206."},{"key":"e_1_3_2_1_44_1","volume-title":"http:\/\/www.microsoft.com\/u-prove","author":"Microsoft","year":"2011","unstructured":"Microsoft . U-Prove. http:\/\/www.microsoft.com\/u-prove , 2011 . Microsoft. U-Prove. http:\/\/www.microsoft.com\/u-prove, 2011."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/277650.277752"},{"key":"e_1_3_2_1_46_1","unstructured":"Nipkow T. and Paulson L. Isabelle web site. http:\/\/isabelle.in.tun.de 2010.  Nipkow T. and Paulson L. Isabelle web site. http:\/\/isabelle.in.tun.de 2010."},{"key":"e_1_3_2_1_47_1","volume-title":"Privacy-preserving smart metering","author":"Rial A.","year":"2011","unstructured":"Rial , A. , and Danezis , G . Privacy-preserving smart metering , 2011 . Rial, A., and Danezis, G. Privacy-preserving smart metering, 2011."},{"key":"e_1_3_2_1_48_1","series-title":"LNCS","volume-title":"ASIACRYPT 01","author":"Rivest R.","year":"2001","unstructured":"Rivest , R. , Shamir , A. , and Tauman , Y . How to Leak a Secret - Theory and Applications of Ring Signatures . In ASIACRYPT 01 ( 2001 ), vol. 2248 of LNCS , Springer . Rivest, R., Shamir, A., and Tauman, Y. How to Leak a Secret - Theory and Applications of Ring Signatures. In ASIACRYPT 01 (2001), vol. 2248 of LNCS, Springer."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196725"},{"key":"e_1_3_2_1_50_1","first-page":"09","author":"Schr\u00f6pfer A.","year":"2009","unstructured":"Schr\u00f6pfer , A. , Kerschbaum , F. , Biswas , D. , Gei\u00dfinger , S. , and Sch\u00fctz , C. L1 - Faster Development and Benchmarking of Cryptographic Protocols. In SPEED-CC 09 ( 2009 ). Schr\u00f6pfer, A., Kerschbaum, F., Biswas, D., Gei\u00dfinger, S., and Sch\u00fctz, C. L1 - Faster Development and Benchmarking of Cryptographic Protocols. In SPEED-CC 09 (2009).","journal-title":"Faster Development and Benchmarking of Cryptographic Protocols. In SPEED-CC"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2008.11.011"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-005-3402-z"}],"event":{"name":"CCS'12: the ACM Conference on Computer and Communications Security","location":"Raleigh North Carolina USA","acronym":"CCS'12","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2012 ACM conference on Computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2382196.2382249","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2382196.2382249","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:48Z","timestamp":1750239288000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2382196.2382249"}},"subtitle":["verifiable compilation of efficient zero-knowledge protocols"],"short-title":[],"issued":{"date-parts":[[2012,10,16]]},"references-count":49,"alternative-id":["10.1145\/2382196.2382249","10.1145\/2382196"],"URL":"https:\/\/doi.org\/10.1145\/2382196.2382249","relation":{},"subject":[],"published":{"date-parts":[[2012,10,16]]},"assertion":[{"value":"2012-10-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}