{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T15:49:56Z","timestamp":1783612196669,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662530146","type":"print"},{"value":"9783662530153","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","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":[[2016]]},"DOI":"10.1007\/978-3-662-53015-3_7","type":"book-chapter","created":{"date-parts":[[2016,7,20]],"date-time":"2016-07-20T10:10:25Z","timestamp":1469009425000},"page":"179-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Rate-1, Linear Time and Additively Homomorphic UC Commitments"],"prefix":"10.1007","author":[{"given":"Ignacio","family":"Cascudo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ivan","family":"Damg\u00e5rd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernardo","family":"David","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nico","family":"D\u00f6ttling","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jesper Buus","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1007\/978-3-662-46800-5_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"A Afshar","year":"2015","unstructured":"Afshar, A., Hu, Z., Mohassel, P., Rosulek, M.: How to efficiently evaluate RAM programs with malicious security. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 702\u2013729. Springer, Heidelberg (2015)"},{"key":"7_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1007\/978-3-642-38980-1_34","volume-title":"Applied Cryptography and Network Security","author":"O Blazy","year":"2013","unstructured":"Blazy, O., Chevalier, C., Pointcheval, D., Vergnaud, D.: Analysis and improvement of Lindell\u2019s UC-secure commitment schemes. In: Jacobson Jr., M.J., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 534\u2013551. Springer, Heidelberg (2013)"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-662-49387-8_12","volume-title":"Public-Key Cryptography \u2013 PKC 2016","author":"LTAN Brand\u00e3o","year":"2016","unstructured":"Brand\u00e3o, L.T.A.N.: Very-efficient simulatable flipping of many coins into a well. In: Cheng, C.M., et al. (eds.) PKC 2016. LNCS, vol. 9615, pp. 297\u2013326. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49387-8_12"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS, pp. 136\u2013145. IEEE Computer Society (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/978-3-662-46447-2_22","volume-title":"Public-Key Cryptography \u2013 PKC 2015","author":"I Cascudo","year":"2015","unstructured":"Cascudo, I., Damg\u00e5rd, I., David, B.M., Giacomelli, I., Nielsen, J.B., Trifiletti, R.: Additively homomorphic UC commitments with optimal amortized overhead. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 495\u2013515. Springer, Heidelberg (2015)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, p. 19. Springer, Heidelberg (2001)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: STOC, pp. 494\u2013503 (2002)","DOI":"10.1145\/509907.509980"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Capalbo, M.R., Reingold, O., Vadhan, S.P., Wigderson, A.: Randomness conductors and constant-degree lossless expanders. In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, 19\u201321 May 2002, Montr\u00e9al, Qu\u00e9bec, Canada, pp. 659\u2013668 (2002)","DOI":"10.1145\/509907.510003"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/978-3-662-45608-8_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"I Damg\u00e5rd","year":"2014","unstructured":"Damg\u00e5rd, I., David, B., Giacomelli, I., Nielsen, J.B.: Compact VSS and efficient homomorphic UC commitments. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014, Part II. LNCS, vol. 8874, pp. 213\u2013232. Springer, Heidelberg (2014)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Druk, E., Ishai, Y.: Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications. In: Naor, M. (ed.) Innovations in Theoretical Computer Science, ITCS 2014, Princeton, NJ, USA, 12\u201314 January 2014, pp. 169\u2013182. ACM (2014)","DOI":"10.1145\/2554797.2554815"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-642-38348-9_32","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"TK Frederiksen","year":"2013","unstructured":"Frederiksen, T.K., Jakobsen, T.P., Nielsen, J.B., Nordholt, P.S., Orlandi, C.: MiniLEGO: efficient secure two-party computation from general assumptions. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 537\u2013556. Springer, Heidelberg (2013)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/978-3-662-49096-9_23","volume-title":"Theory of Cryptography","author":"TK Frederiksen","year":"2016","unstructured":"Frederiksen, T.K., Jakobsen, T.P., Nielsen, J.B., Trifiletti, R.: On the complexity of additively homomorphic uc commitments. In: Kushilevitz, E., et al. (eds.) TCC 2016-A. LNCS, vol. 9562, pp. 542\u2013565. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49096-9_23"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Indyk, P.: Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets. In: Reif, J.H. (ed.) Proceedings on 34th Annual ACM Symposium on Theory of Computing, 19\u201321 May 2002, Montr\u00e9al, Qu\u00e9bec, Canada, pp. 812\u2013821. ACM (2002)","DOI":"10.1145\/509907.510023"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Indyk, P.: Linear time encodable and list decodable codes. In: Larmore and Goemans [LG03], pp. 126\u2013135","DOI":"10.1145\/780542.780562"},{"issue":"10","key":"7_CR15","doi-asserted-by":"publisher","first-page":"3393","DOI":"10.1109\/TIT.2005.855587","volume":"51","author":"V Guruswami","year":"2005","unstructured":"Guruswami, V., Indyk, P.: Linear-time encodable\/decodable codes with near-optimal rate. IEEE Trans. Inf. Theor. 51(10), 3393\u20133400 (2005)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-3-642-55220-5_37","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"JA Garay","year":"2014","unstructured":"Garay, J.A., Ishai, Y., Kumaresan, R., Wee, H.: On the complexity of UC commitments. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 677\u2013694. Springer, Heidelberg (2014)"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Cryptography with constant computational overhead. In: Dwork, C. (ed.) STOC, pp. 433\u2013442. ACM (2008)","DOI":"10.1145\/1374376.1374438"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer \u2013 efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572\u2013591. Springer, Heidelberg (2008)"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-642-00457-5_18","volume-title":"Theory of Cryptography","author":"Y Ishai","year":"2009","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Secure arithmetic computation with no honest majority. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 294\u2013314. Springer, Heidelberg (2009)"},{"key":"7_CR20","unstructured":"Larmore, L.L., Goemans, M.X. (eds.) Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 9\u201311 June 2003, San Diego, CA, USA. ACM (2003)"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-642-20465-4_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"Y Lindell","year":"2011","unstructured":"Lindell, Y.: Highly-efficient universally-composable commitments based on the DDH assumption. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 446\u2013466. Springer, Heidelberg (2011)"},{"issue":"2","key":"7_CR22","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. J. Cryptol. 4(2), 151\u2013158 (1991)","journal-title":"J. Cryptol."},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C Peikert","year":"2008","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 554\u2013571. Springer, Heidelberg (2008)"},{"issue":"6","key":"7_CR24","doi-asserted-by":"publisher","first-page":"1723","DOI":"10.1109\/18.556668","volume":"42","author":"DA Spielman","year":"1996","unstructured":"Spielman, D.A.: Linear-time encodable and decodable error-correcting codes. IEEE Trans. Inf. Theor. 42(6), 1723\u20131731 (1996)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Vadhan, S., Zheng, C.J.: Characterizing pseudoentropy and simplifying pseudorandom generator constructions. In: Proceedings of the 44th Symposium on Theory of Computing, pp. 817\u2013836. ACM (2012)","DOI":"10.1145\/2213977.2214051"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2016"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53015-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T03:00:00Z","timestamp":1749006000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53015-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662530146","9783662530153"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53015-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"21 July 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}