{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:06:43Z","timestamp":1742951203942,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030171377"},{"type":"electronic","value":"9783030171384"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17138-4_8","type":"book-chapter","created":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T14:04:43Z","timestamp":1554213883000},"page":"175-196","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On the Formalisation of $$\\varSigma $$ -Protocols and Commitment Schemes"],"prefix":"10.1007","author":[{"given":"David","family":"Butler","sequence":"first","affiliation":[]},{"given":"David","family":"Aspinall","sequence":"additional","affiliation":[]},{"given":"Adri\u00e0","family":"Gasc\u00f3n","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,3]]},"reference":[{"key":"8_CR1","unstructured":"https:\/\/github.com\/alan-turing-institute\/Crypto-Commit-Sigma-Isabelle"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Bacelar Almeida, J., Barbosa, M., Bangerter, E., Barthe, G., Krenn, S., Zanella B\u00e9guelin, S.: Full proof cryptography: verifiable compilation of efficient zero-knowledge protocols. In: ACM Conference on Computer and Communications Security, pp. 488\u2013500. ACM (2012)","DOI":"10.1145\/2382196.2382249"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Barthe, G., Gr\u00e9goire, B., Zanella B\u00e9guelin, S.: Formal certification of code-based cryptographic proofs. In: POPL, pp. 90\u2013101. ACM (2009)","DOI":"10.1145\/1594834.1480894"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-22792-9_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"G Barthe","year":"2011","unstructured":"Barthe, G., Gr\u00e9goire, B., Heraud, S., Zanella B\u00e9guelin, S.: Computer-aided security proofs for the working cryptographer. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 71\u201390. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-22792-9_5"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Barthe, G., Hedin, D., Zanella B\u00e9guelin, S., Gr\u00e9goire, B., Heraud, S.: A machine-checked formalization of sigma-protocols. In: CSF, pp. 246\u2013260. IEEE Computer Society (2010)","DOI":"10.1109\/CSF.2010.24"},{"key":"8_CR6","unstructured":"Basin, D.A., Lochbihler, A., Sefidgar, S.R.: CryptHOL: game-based proofs in higher-order logic. IACR Cryptology ePrint Archive, p. 753 (2017)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-319-66107-0_8","volume-title":"Interactive Theorem Proving","author":"D Butler","year":"2017","unstructured":"Butler, D., Aspinall, D., Gasc\u00f3n, A.: How to simulate it in Isabelle: towards formal proof for secure multi-party computation. In: Ayala-Rinc\u00f3n, M., Mu\u00f1oz, C.A. (eds.) ITP 2017. LNCS, vol. 10499, pp. 114\u2013130. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-66107-0_8"},{"key":"8_CR8","unstructured":"Damgard, I.: On \n                    \n                      \n                    \n                    $$\\varSigma $$\n                  -protocols. Lecture Notes, University of Aarhus, Department for Computer Science (2002)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-48969-X_3","volume-title":"Lectures on Data Security","author":"I Damg\u00e5rd","year":"1999","unstructured":"Damg\u00e5rd, I.: Commitment schemes and zero-knowledge protocols. In: Damg\u00e5rd, I.B. (ed.) EEF School 1998. LNCS, vol. 1561, pp. 63\u201386. Springer, Heidelberg (1999). \n                    https:\/\/doi.org\/10.1007\/3-540-48969-X_3"},{"key":"8_CR10","volume-title":"Introduction to HOL a Theorem Proving Environment for Higher Order Logic","author":"MJC Gordon","year":"1993","unstructured":"Gordon, M.J.C., Melham, T.F.: Introduction to HOL a Theorem Proving Environment for Higher Order Logic. Cambridge University Press, New York (1993)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Haagh, H., Karbyshev, A., Oechsner, S., Spitters, B., Strub, P.-Y.: Computer-aided proofs for multiparty computation with active security. In: CSF, pp. 119\u2013131. IEEE Computer Society (2018)","DOI":"10.1109\/CSF.2018.00016"},{"key":"8_CR12","unstructured":"Halevi, S.: A plausible approach to computer-aided cryptographic proofs. IACR Cryptology ePrint Archive 2005:181 (2005)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-319-22102-1_16","volume-title":"Interactive Theorem Proving","author":"O Kun\u010dar","year":"2015","unstructured":"Kun\u010dar, O., Popescu, A.: A consistent foundation for Isabelle\/HOL. In: Urban, C., Zhang, X. (eds.) ITP 2015. LNCS, vol. 9236, pp. 234\u2013252. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-22102-1_16"},{"key":"8_CR14","unstructured":"Lochbihler, A.: CryptHOL. Archive of Formal Proofs (2017)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/978-3-662-49498-1_20","volume-title":"Programming Languages and Systems","author":"A Lochbihler","year":"2016","unstructured":"Lochbihler, A.: Probabilistic functions and cryptographic oracles in higher order logic. In: Thiemann, P. (ed.) ESOP 2016. LNCS, vol. 9632, pp. 503\u2013531. Springer, Heidelberg (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-662-49498-1_20"},{"key":"8_CR16","unstructured":"Lochbihler, A., Sefidgar, S.R., Bhatt, B.: Game-based cryptography in HOL. Archive of Formal Proofs (2017)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-319-65127-9_22","volume-title":"Computer Network Security","author":"R Metere","year":"2017","unstructured":"Metere, R., Dong, C.: Automated cryptographic analysis of the Pedersen commitment scheme. In: Rak, J., Bay, J., Kotenko, I., Popyack, L., Skormin, V., Szczypiorski, K. (eds.) MMM-ACNS 2017. LNCS, vol. 10446, pp. 275\u2013287. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-65127-9_22"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-662-46666-7_4","volume-title":"Principles of Security and Trust","author":"A Petcher","year":"2015","unstructured":"Petcher, A., Morrisett, G.: The foundational cryptography framework. In: Focardi, R., Myers, A. (eds.) POST 2015. LNCS, vol. 9036, pp. 53\u201372. Springer, Heidelberg (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-662-46666-7_4"},{"key":"8_CR19","unstructured":"Schneider, J., Eberl, M., Lochbihler, A.: Monad normalisation. Archive of Formal Proofs (2017)"},{"key":"8_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21936-3","volume-title":"Cryptography Made Simple. Information Security and Cryptography","author":"NP Smart","year":"2016","unstructured":"Smart, N.P.: Cryptography Made Simple. Information Security and Cryptography. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-21936-3\n                    \n                  . \n                    https:\/\/www.cs.umd.edu\/~waa\/414-F11\/IntroToCrypto"}],"container-title":["Lecture Notes in Computer Science","Principles of Security and Trust"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17138-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:17:36Z","timestamp":1558343856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-17138-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030171377","9783030171384"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17138-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"POST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles of Security and Trust","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"post2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2019\/post","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}