{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:29:11Z","timestamp":1740137351384,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T00:00:00Z","timestamp":1624665600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T00:00:00Z","timestamp":1624665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Guangdong Major Project of Basic and Applied Basic Research","award":["2019B030302008"],"award-info":[{"award-number":["2019B030302008"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672550","61972429"],"award-info":[{"award-number":["61672550","61972429"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s10207-021-00556-5","type":"journal-article","created":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T13:02:25Z","timestamp":1624712545000},"page":"341-356","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Topology-hiding garbled circuits without universal circuits"],"prefix":"10.1007","volume":"21","author":[{"given":"Zheng","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Shaohao","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Fangguo","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,26]]},"reference":[{"key":"556_CR1","doi-asserted-by":"crossref","unstructured":"Yao, A.: Protocols for secure computation. Proc. of 23rd FOCS, 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"556_CR2","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. Proc. of 19nd STOC, 218-229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"556_CR3","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. Proc. of 22nd STOC, 503-513 (1990)","DOI":"10.1145\/100216.100287"},{"key":"556_CR4","doi-asserted-by":"crossref","unstructured":"Katz, J., Ostrovsky, R., Smith, A.: Round Efficiency of Multi-party Computation with a Dishonest Majority. EUROCRYPT 2003, LNCS 2656, 578-595 (2003)","DOI":"10.1007\/3-540-39200-9_36"},{"key":"556_CR5","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: Parallel coin-tossing and constant-round secure two-party computation. CRYPTO 2001, LNCS 2139, 171-189 (2003)","DOI":"10.1007\/3-540-44647-8_10"},{"key":"556_CR6","doi-asserted-by":"crossref","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits, Proc. of 2012 CCS, 784\u2013796 (2012)","DOI":"10.1145\/2382196.2382279"},{"key":"556_CR7","doi-asserted-by":"crossref","unstructured":"Patra, A., Ravi, D.: On the exact round complexity of secure three-party computation. CRYPTO 2018, LNCS 10992, 425- 458 (2018)","DOI":"10.1007\/978-3-319-96881-0_15"},{"key":"556_CR8","unstructured":"Kamara, S., Mohassel, P., Raykova, M.: Outsourcing multi-party computation. IACR Cryptol. ePrint Arch. 272,(2011)"},{"key":"556_CR9","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.future.2015.11.004","volume":"62","author":"Y Wang","year":"2016","unstructured":"Wang, Y., Malluhi, Q.M., Khan, K.M.D.: Garbled computation in cloud. Future Gener. Comput. Syst. 62, 54\u201365 (2016)","journal-title":"Future Gener. Comput. Syst."},{"key":"556_CR10","doi-asserted-by":"crossref","unstructured":"Katz, J., Malka, L.: Secure text processing with applications to private DNA matching. Proc. of 17th CCS, 485-492 (2010)","DOI":"10.1145\/1866307.1866361"},{"key":"556_CR11","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. Electr. Commer. 99, 129\u2013139 (1999)","DOI":"10.1145\/336992.337028"},{"key":"556_CR12","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1126\/science.aam9710","volume":"357","author":"KA Jagadeesh","year":"2017","unstructured":"Jagadeesh, K.A., Wu, D.J., Birgmeier, J.A., Boneh, D., Bejerano, G.: Deriving genomic diagnoses without revealing patient genomes. Science 357, 692\u2013695 (2017)","journal-title":"Science"},{"issue":"2","key":"556_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Y Lindell","year":"2009","unstructured":"Lindell, Y., Pinkas, B.: A proof of security of Yao\u2019s protocol for two-party computation. J. Cryptol. 22(2), 161\u2013188 (2009)","journal-title":"J. Cryptol."},{"key":"556_CR14","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Schneider, T.: Improved garbled circuit: free XOR gates and applications. ICALP 2008: automata, languages and programming, LNCS 5126, 486\u2013498 (2008)","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"556_CR15","doi-asserted-by":"crossref","unstructured":"Zahur, S., Rosulek, M., Evans, D.: Two halves make a whole. EUROCRYPT 2015, LNCS 9057, 220\u2013250 (2015)","DOI":"10.1007\/978-3-662-46803-6_8"},{"key":"556_CR16","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Universal circuits (Preliminary Report). Proc. of 8th STOC, 196-203 (1976)","DOI":"10.1145\/800113.803649"},{"key":"556_CR17","doi-asserted-by":"crossref","unstructured":"Kiss, A., Schneider, T.: Valiant\u2019s universal circuit is practical. EUROCRYPT 2016, LNCS 9665, 699\u2013728 (2016)","DOI":"10.1007\/978-3-662-49890-3_27"},{"key":"556_CR18","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-540-85230-8_7","volume":"5143","author":"V Kolesnikov","year":"2008","unstructured":"Kolesnikov, V., Schneider, T.: A practical universal circuit construction and secure evaluation of private functions. Financ. Cryptogr. Data Secur. LNCS 5143, 83\u201397 (2008)","journal-title":"Financ. Cryptogr. Data Secur. LNCS"},{"key":"556_CR19","doi-asserted-by":"crossref","unstructured":"Paus, A., Sadeghi, A.-R., Schneider, T.: Practical secure evaluation of semi-private functions. 7th Intl. conference on applied cryptography and network security (ACNS), LNCS 5536, 89\u2013106 (2009)","DOI":"10.1007\/978-3-642-01957-9_6"},{"key":"556_CR20","first-page":"33","volume":"10402","author":"C Cho","year":"2017","unstructured":"Cho, C., D\u00f6ttling, N., Garg, S., et al.: Laconic oblivious transfer and its applications, CRYPTO 2017. LNCS 10402, 33\u201365 (2017)","journal-title":"LNCS"},{"key":"556_CR21","unstructured":"Schoenmakers, B.: Oblivious transfer. Encycl. Cryptogr. Secur"},{"issue":"1","key":"556_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02252866","volume":"2","author":"M Abadi","year":"1990","unstructured":"Abadi, M., Feigenbaum, J.: Secure circuit evaluation. J. Cryptol. 2(1), 1\u201312 (1990)","journal-title":"J. Cryptol."},{"key":"556_CR23","doi-asserted-by":"crossref","unstructured":"Katz, J., Malka, L.: Constant-round private function evaluation with linear complexity. ASIACRYPT 2011. LNCS 7073, 556\u2013571 (2011)","DOI":"10.1007\/978-3-642-25385-0_30"},{"key":"556_CR24","doi-asserted-by":"crossref","unstructured":"Mohassel, P., Sadeghian, S.: How to hide circuits in MPC an efficient framework for private function evaluation. EUROCRYPT 2013. LNCS 7881, 557\u2013574 (2013)","DOI":"10.1007\/978-3-642-38348-9_33"},{"key":"556_CR25","unstructured":"Wang, Y., Malluhi, Q.m.: Reducing garbled circuit size while preserving circuit gate privacy. https:\/\/eprint.iacr.org\/2017\/041.pdf"},{"key":"556_CR26","first-page":"149","volume":"9816","author":"B Hemenway","year":"2016","unstructured":"Hemenway, B., Jafargholi, Z., Ostrovsky, R., et al.: Adaptively secure garbled circuits from one-way functions, CRYPTO 2016. LNCS 9816, 149\u2013178 (2016)","journal-title":"LNCS"},{"key":"556_CR27","doi-asserted-by":"crossref","unstructured":"Garg, S., Srinivasan, A.: A simple construction of iO for turing machines. TCC 2018. LNCS 11240, pp. 425\u2013454 (2018)","DOI":"10.1007\/978-3-030-03810-6_16"},{"key":"556_CR28","doi-asserted-by":"crossref","unstructured":"Jafargholi, Z., Scafuro, A., Wichs, D.: Adaptively indistinguishable garbled circuits. TCC 2017, LNCS 10678, pp. 40\u201371 (2017)","DOI":"10.1007\/978-3-319-70503-3_2"},{"key":"556_CR29","doi-asserted-by":"crossref","unstructured":"Jakobsson, M., Leighton, T., Micali, S., Szydlo, M.: Fractal Merkle tree representation and traversal. CT-RSA 2003, LNCS 2612, 314\u2013326 (2003)","DOI":"10.1007\/3-540-36563-X_21"},{"key":"556_CR30","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. Proc. of 46th STOC, 475-484 (2014)","DOI":"10.1145\/2591796.2591825"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-021-00556-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10207-021-00556-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-021-00556-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T08:06:37Z","timestamp":1647849997000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10207-021-00556-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,26]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["556"],"URL":"https:\/\/doi.org\/10.1007\/s10207-021-00556-5","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"type":"print","value":"1615-5262"},{"type":"electronic","value":"1615-5270"}],"subject":[],"published":{"date-parts":[[2021,6,26]]},"assertion":[{"value":"26 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}