{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T04:05:58Z","timestamp":1748837158196,"version":"3.41.0"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319315492"},{"type":"electronic","value":"9783319315508"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-31550-8_4","type":"book-chapter","created":{"date-parts":[[2016,3,22]],"date-time":"2016-03-22T14:26:20Z","timestamp":1458656780000},"page":"49-61","source":"Crossref","is-referenced-by-count":0,"title":["Universally Composable Oblivious Database in the Presence of Malicious Adversaries"],"prefix":"10.1007","author":[{"given":"Huafei","family":"Zhu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,16]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Asharov, G., Lindell, Y., Schneider, T., et al.: More efficient oblivious transfer and extensions for faster secure computation. In: ACM Conference on Computer and Communications Security, pp. 535\u2013548 (2013)","DOI":"10.1145\/2508859.2516738"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/3-540-47721-7_17","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"G Brassard","year":"1987","unstructured":"Brassard, G., Cr\u00e9peau, C., Robert, J.M.: All-or-nothing disclosure of secrets. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 234\u2013238. Springer, Heidelberg (1987)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/978-3-319-12280-9_10","volume-title":"Cryptology and Network Security","author":"B David","year":"2014","unstructured":"David, B., Dowsley, R., Nascimento, A.C.A.: Universally composable oblivious transfer based on a variant of LPN. In: Gritzalis, D., Kiayias, A., Askoxylakis, I. (eds.) CANS 2014. LNCS, vol. 8813, pp. 143\u2013158. Springer, Heidelberg (2014)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Canetti, R.: A new paradigm for cryptographic protocols. In: FOCS, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-540-76900-2_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"R Canetti","year":"2007","unstructured":"Canetti, R.: Obtaining universally compoable security: towards the bare bones of trust. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 88\u2013112. Springer, Heidelberg (2007)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"R Cramer","year":"1994","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Schoenmakers, B.: Proof of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174\u2013187. Springer, Heidelberg (1994)"},{"key":"4_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\/509978.509980"},{"key":"4_CR8","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, pp. 19\u201340. Springer, Heidelberg (2001)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-3-540-72540-4_33","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"JL Camenisch","year":"2007","unstructured":"Camenisch, J.L., Neven, G., Shelat, A.: Simulatable adaptive oblivious transfer. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 573\u2013590. Springer, Heidelberg (2007)"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-642-27954-6_26","volume-title":"Topics in Cryptology \u2013 CT-RSA 2012","author":"SG Choi","year":"2012","unstructured":"Choi, S.G., Hwang, K.-W., Katz, J., Malkin, T., Rubenstein, D.: Secure multi-party computation of boolean circuits with applications to privacy in on-line marketplaces. In: Dunkelman, O. (ed.) CT-RSA 2012. LNCS, vol. 7178, pp. 416\u2013432. Springer, Heidelberg (2012)"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-46035-7_4","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"R Cramer","year":"2002","unstructured":"Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, p. 45. Springer, Heidelberg (2002)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-48184-2_30","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"C Cr\u00e9peau","year":"1988","unstructured":"Cr\u00e9peau, C.: Equivalence between two flavours of oblivious transfers. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 350\u2013354. Springer, Heidelberg (1988)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/3-540-45708-9_37","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"IB Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I.B., Nielsen, J.B.: Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 581\u2013596. Springer, Heidelberg (2002)"},{"key":"4_CR14","unstructured":"Dubovitskaya, M.: Cryptographic protocols for privacy-preserving access control in databases. Doctoral dissertation, Diss., Eidgenosische Technische Hochschule ETH Zurich, no. 21835 (2014)"},{"key":"4_CR15","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-45067-X_30","volume-title":"Information Security and Privacy","author":"Ivan Damg\u00e5rd","year":"2003","unstructured":"Damg\u00e5rd, I., Jurik, M.: A length-flexible threshold cryptosystem with applications. In: ACISP, pp. 350\u2013364 (2003)"},{"issue":"6","key":"4_CR16","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28(6), 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"3615","DOI":"10.1002\/sec.1285","volume":"8","author":"V Guleria","year":"2015","unstructured":"Guleria, V., Dutta, R.: Universally composable issuer-free adaptive oblivious transfer with access policy. Secur. Commun. Netw. 8, 3615\u20133633 (2015)","journal-title":"Secur. Commun. Netw."},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1007\/978-3-662-46800-5_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"G Asharov","year":"2015","unstructured":"Asharov, G., Lindell, Y., Schneider, T., Zohner, M.: More efficient oblivious transfer extensions with security for malicious adversaries. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 673\u2013701. Springer, Heidelberg (2015)"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game-or-a completeness theorem for protocols with honest majority. In: STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Green, M., Hohenberger, S.: Blind identity-based encryption and simulatable oblivious transfer. In: ASIACRYPT, pp. 265\u2013282 (2007)","DOI":"10.1007\/978-3-540-76900-2_16"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Green, M., Hohenberger, S.: Universally composable adaptive oblivious transfer. In: ASIACRYPT (2008)","DOI":"10.1007\/978-3-540-89255-7_12"},{"key":"4_CR22","unstructured":"Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. In: 20th USENIX Security Symposium, San Francisco, CA, 8\u201312 August 2011"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: STOC, pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"issue":"2","key":"4_CR24","first-page":"312","volume":"28","author":"Y Lindell","year":"2015","unstructured":"Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. Commun. ACM 28(2), 312\u2013350 (2015)","journal-title":"Commun. ACM"},{"key":"4_CR25","first-page":"131","volume-title":"Intelligent Computing, Communication and Devices","author":"K Manoj","year":"2015","unstructured":"Manoj, K., Praveen, I.: A fully simulatable oblivious transfer scheme using vector decomposition. In: Jain, L.C., Patnaik, S., Ichalkaranje, N. (eds.) Intelligent Computing, Communication and Devices, pp. 131\u2013137. Springer, India (2015)"},{"key":"4_CR26","unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SODA, pp. 448\u2013457 (2001)"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/3-540-48405-1_36","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"M Naor","year":"1999","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer with adaptive queries. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 573\u2013590. Springer, Heidelberg (1999)"},{"key":"4_CR28","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)"},{"key":"4_CR29","unstructured":"Michael O.Rabin.: How to exchange secrets by oblivious transfer. Technical report TR-81, Aiken Computation Laboratory, Harvard University (1981)"},{"key":"4_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11426639_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"YT Kalai","year":"2005","unstructured":"Kalai, Y.T.: Smooth projective hashing and two-message oblivious transfer. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 78\u201395. Springer, Heidelberg (2005)"},{"key":"4_CR31","unstructured":"Andrew Chi-Chih Yao.: Protocols for secure computations (extended abstract). In: FOCS, pp. 160\u2013164 (1982)"},{"key":"4_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-540-88733-1_23","volume-title":"Provable Security","author":"H Zhu","year":"2008","unstructured":"Zhu, H.: Round optimal universally composable oblivious transfer protocols. In: Baek, J., Bao, F., Chen, K., Lai, X. (eds.) ProvSec 2008. LNCS, vol. 5324, pp. 328\u2013334. Springer, Heidelberg (2008)"},{"key":"4_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-11145-7_38","volume-title":"Information and Communications Security","author":"H Zhu","year":"2009","unstructured":"Zhu, H., Bao, F.: Adaptive and composable oblivious transfer protocols (short paper). In: Qing, S., Mitchell, C.J., Wang, G. (eds.) ICICS 2009. LNCS, vol. 5927, pp. 483\u2013492. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Trusted Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-31550-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T22:21:19Z","timestamp":1748816479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-31550-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319315492","9783319315508"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-31550-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}