{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:13:42Z","timestamp":1740158022026,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T00:00:00Z","timestamp":1519344000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T00:00:00Z","timestamp":1519344000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s12652-018-0713-7","type":"journal-article","created":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T20:24:37Z","timestamp":1519417477000},"page":"1327-1337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Cut-and-choose bilateral oblivious transfer protocol based on DDH assumption"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4909-367X","authenticated-orcid":false,"given":"Han","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiuliang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changyuan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhihua","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingqiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,23]]},"reference":[{"key":"713_CR1","doi-asserted-by":"crossref","unstructured":"Afshar A, Mohassel P, Pinkas B, Riva B (2014) Non-interactive secure computation based on cut-and-choose. In: Advances in cryptology\u2013EUROCRYPT 2014, Springer, pp 387\u2013404","DOI":"10.1007\/978-3-642-55220-5_22"},{"key":"713_CR2","doi-asserted-by":"crossref","unstructured":"Brand\u00e3o LT (2013) Secure two-party computation with reusable bit-commitments, via a cut-and-choose with forge-and-lose technique. In: Advances in cryptology-ASIACRYPT 2013, Springer, pp 441\u2013463","DOI":"10.1007\/978-3-642-42045-0_23"},{"key":"713_CR3","doi-asserted-by":"crossref","unstructured":"Choi SG, Katz J, Malozemoff AJ, Zikas V (2014) Efficient three-party computation from cut-and-choose. In: Advances in cryptology\u2013CRYPTO 2014, Springer, pp 513\u2013530","DOI":"10.1007\/978-3-662-44381-1_29"},{"key":"713_CR4","unstructured":"Chuan Z, Han J, Xiaochao W, Qiuliang X, Zhao M (2015) Cut-and-choose bilateral oblivious transfer and its application. In: Proceedings of the 14th IEEE international conference on trust security and privacy in computing and communications, IEEE Computer Society, pp 384\u2013391"},{"key":"713_CR5","doi-asserted-by":"crossref","unstructured":"Frederiksen TK, Jakobsen TP, Nielsen JB, Nordholt PS, Orlandi C (2013) Minilego: efficient secure two-party computation from general assumptions. In: Advances in cryptology\u2013EUROCRYPT 2013, Springer, pp 537\u2013556","DOI":"10.1007\/978-3-642-38348-9_32"},{"key":"713_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of cryptography: volume 2, basic applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich O (2004) Foundations of cryptography: volume 2, basic applications. Cambridge University Press, Cambridge"},{"key":"713_CR7","doi-asserted-by":"crossref","unstructured":"Goldreich O, Micali S, Wigderson A (1987) How to play any mental game. In: Proceedings of the nineteenth annual ACM symposium on Theory of computing, ACM, pp 218\u2013229","DOI":"10.1145\/28395.28420"},{"key":"713_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14303-8","volume-title":"Efficient secure two-party protocols: Techniques and constructions","author":"C Hazay","year":"2010","unstructured":"Hazay C, Lindell Y (2010) Efficient secure two-party protocols: Techniques and constructions. Springer Science & Business Media, Berlin"},{"key":"713_CR9","doi-asserted-by":"crossref","unstructured":"Huang Y, Katz J, Evans D (2013) Efficient secure two-party computation using symmetric cut-and-choose. In: Advances in cryptology\u2013CRYPTO 2013, Springer, pp 18\u201335","DOI":"10.1007\/978-3-642-40084-1_2"},{"key":"713_CR10","doi-asserted-by":"crossref","unstructured":"Huang Y, Katz J, Kolesnikov V, Kumaresan R, Malozemoff AJ (2014) Amortizing garbled circuits. In: Advances in cryptology\u2013CRYPTO 2014, Springer, pp 458\u2013475","DOI":"10.1007\/978-3-662-44381-1_26"},{"key":"713_CR11","unstructured":"Kiraz M, Schoenmakers B (2006) A protocol issue for the malicious case of yaos garbled circuit construction. In: 27th symposium on information theory in the Benelux, pp 283\u2013290"},{"key":"713_CR12","doi-asserted-by":"crossref","unstructured":"Lindell Y (2013) Fast cut-and-choose based protocols for malicious and covert adversaries. In: Advances in cryptology\u2013CRYPTO 2013, Springer, pp 1\u201317","DOI":"10.1007\/978-3-642-40084-1_1"},{"issue":"2","key":"713_CR13","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/s00145-015-9198-0","volume":"29","author":"Y Lindell","year":"2016","unstructured":"Lindell Y (2016) Fast cut-and-choose-based protocols for malicious and covert adversaries. J Cryptol 29(2):456\u2013490","journal-title":"J Cryptol"},{"key":"713_CR14","doi-asserted-by":"crossref","unstructured":"Lindell Y, Pinkas B (2007) An efficient protocol for secure two-party computation in the presence of malicious adversaries. In: Advances in cryptology-EUROCRYPT 2007, Springer, pp 52\u201378","DOI":"10.1007\/978-3-540-72540-4_4"},{"key":"713_CR15","doi-asserted-by":"crossref","unstructured":"Lindell Y, Pinkas B (2011) Secure two-party computation via cut-and-choose oblivious transfer. In: Proceedings of the 8th conference on theory of cryptography, Springer, pp 329\u2013346","DOI":"10.1007\/978-3-642-19571-6_20"},{"key":"713_CR16","doi-asserted-by":"crossref","unstructured":"Lindell Y, Riva B (2014) Cut-and-choose yao-based secure computation in the online\/offline and batch settings. In: Advances in cryptology\u2013CRYPTO 2014, Springer, pp 476\u2013494","DOI":"10.1007\/978-3-662-44381-1_27"},{"key":"713_CR17","doi-asserted-by":"crossref","unstructured":"Mohassel P, Riva B (2013) Garbled circuits checking garbled circuits: more efficient and secure two-party computation. In: Advances in cryptology\u2013CRYPTO 2013, Springer, pp 36\u201353","DOI":"10.1007\/978-3-642-40084-1_3"},{"key":"713_CR18","doi-asserted-by":"crossref","unstructured":"Mohassel P, Rosulek M (2017) Non-interactive secure 2pc in the offline\/online and batch settings. In: Annual international conference on the theory and applications of cryptographic techniques, Springer, pp 425\u2013455","DOI":"10.1007\/978-3-319-56617-7_15"},{"key":"713_CR19","doi-asserted-by":"crossref","unstructured":"Nielsen JB, Orlandi C (2009) Lego for two-party secure computation. In: Theory of cryptography, Springer, pp 368\u2013386","DOI":"10.1007\/978-3-642-00457-5_22"},{"key":"713_CR20","doi-asserted-by":"crossref","unstructured":"Peikert C, Vaikuntanathan V, Waters B (2008) A framework for efficient and composable oblivious transfer. In: Advances in cryptology\u2013CRYPTO 2008, Springer, pp 554\u2013571","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"713_CR21","doi-asserted-by":"crossref","unstructured":"Pinkas B (2003) Fair secure two-party computation. In: Advances in cryptologyEurocrypt 2003, Springer, pp 87\u2013105","DOI":"10.1007\/3-540-39200-9_6"},{"key":"713_CR22","doi-asserted-by":"crossref","unstructured":"Shen Ch, et\u00a0al (2011) Two-output secure computation with malicious adversaries. In: Advances in cryptology\u2013EUROCRYPT 2011, Springer, pp 386\u2013405","DOI":"10.1007\/978-3-642-20465-4_22"},{"key":"713_CR23","unstructured":"Shen Ch, et\u00a0al (2013) Fast two-party secure computation with minimal assumptions. In: Proceedings of the 2013 ACM SIGSAC conference on computer & communications security, ACM, pp 523\u2013534"},{"key":"713_CR24","unstructured":"Vladimir K, Ranjit K (2015) On cut-and-choose oblivious transfer and its variants. In: Advances in cryptology\u2013ASIACRYPT 2015, Springer"},{"key":"713_CR25","doi-asserted-by":"crossref","unstructured":"Yao A (1986) How to generate and exchange secrets. In: Foundations of computer science, 1986., 27th annual symposium on, IEEE, pp 162\u2013167","DOI":"10.1109\/SFCS.1986.25"},{"key":"713_CR26","unstructured":"Zhu R, Huang Y, Katz J, Shelat A (2016) The cut-and-choose game and its application to cryptographic protocols. In: USENIX security symposium, pp 1085\u20131100"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12652-018-0713-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-018-0713-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-018-0713-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T16:30:30Z","timestamp":1709224230000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12652-018-0713-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,23]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["713"],"URL":"https:\/\/doi.org\/10.1007\/s12652-018-0713-7","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"type":"print","value":"1868-5137"},{"type":"electronic","value":"1868-5145"}],"subject":[],"published":{"date-parts":[[2018,2,23]]},"assertion":[{"value":"23 May 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}