{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T02:10:30Z","timestamp":1742523030079,"version":"3.40.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642252051"},{"type":"electronic","value":"9783642252068"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-25206-8_18","type":"book-chapter","created":{"date-parts":[[2012,2,17]],"date-time":"2012-02-17T14:28:07Z","timestamp":1329488887000},"page":"274-288","source":"Crossref","is-referenced-by-count":1,"title":["Universally Composable Non-committing Encryptions in the Presence of Adaptive Adversaries"],"prefix":"10.1007","author":[{"given":"Huafei","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tadashi","family":"Araragi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takashi","family":"Nishide","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kouichi","family":"Sakurai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BFb0052228","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"D. Beaver","year":"1997","unstructured":"Beaver, D.: Plug and Play Encryption. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 75\u201389. Springer, Heidelberg (1997)"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/3-540-47555-9_26","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"D. Beaver","year":"1993","unstructured":"Beaver, D., Haber, S.: Cryptographic Protocols Provably Secure Against Dynamic Adversaries. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 307\u2013323. Springer, Heidelberg (1993)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Canetti, R.: A new paradigm for cryptographic protocols. In: FOCS 2001, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"18_CR4","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.\u00a02139, pp. 19\u201340. Springer, Heidelberg (2001)"},{"key":"18_CR5","unstructured":"Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols, eprint.iacr.org (December 14, 2005)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively Secure Multi-Party Computation. In: STOC 1996, pp. 639\u2013648 (1996)","DOI":"10.1145\/237814.238015"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-642-10366-7_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"S.G. Choi","year":"2009","unstructured":"Choi, S.G., Dachman-Soled, D., Malkin, T., Wee, H.: Improved Non-committing Encryption with Applications to Adaptively Secure Protocols. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 287\u2013302. Springer, Heidelberg (2009)"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/3-540-44598-6_27","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"I. Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Improved Non-committing Encryption Schemes Based on a General Complexity Assumption. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 432\u2013450. Springer, Heidelberg (2000)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-30576-7_17","volume-title":"Theory of Cryptography","author":"M.J. Freedman","year":"2005","unstructured":"Freedman, M.J., Ishai, Y., Pinkas, B., Reingold, O.: Keyword Search and Oblivious Pseudorandom Functions. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 303\u2013324. Springer, Heidelberg (2005)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-03356-8_30","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"J.A. Garay","year":"2009","unstructured":"Garay, J.A., Wichs, D., Zhou, H.-S.: Somewhat Non-Committing Encryption and Efficient Adaptively Secure Oblivious Transfer. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 505\u2013523. Springer, Heidelberg (2009)"},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00145-001-0019-2","volume":"15","author":"Y. Lindell","year":"2002","unstructured":"Lindell, Y., Pinkas, B.: Privacy Preserving Data Mining. J. Cryptology\u00a015(3), 177\u2013206 (2002)","journal-title":"J. Cryptology"},{"key":"18_CR12","unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SODA 2001, pp. 448\u2013457 (2001)"},{"key":"18_CR13","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.\u00a05157, pp. 554\u2013571. Springer, Heidelberg (2008)"},{"issue":"2","key":"18_CR14","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/772862.772865","volume":"4","author":"B. Pinkas","year":"2002","unstructured":"Pinkas, B.: Cryptographic Techniques for Privacy-Preserving Data Mining. SIGKDD Explorations\u00a04(2), 12\u201319 (2002)","journal-title":"SIGKDD Explorations"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-45708-9_8","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J.B. Nielsen","year":"2002","unstructured":"Nielsen, J.B.: Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 111\u2013126. Springer, Heidelberg (2002)"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-14081-5_9","volume-title":"Information Security and Privacy","author":"H. Zhu","year":"2010","unstructured":"Zhu, H., Araragi, T., Nishide, T., Sakurai, K.: Adaptive and Composable Non-committing Encryptions. In: Steinfeld, R., Hawkes, P. (eds.) ACISP 2010. LNCS, vol.\u00a06168, pp. 135\u2013144. Springer, Heidelberg (2010)"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-642-10628-6_27","volume-title":"Progress in Cryptology - INDOCRYPT 2009","author":"H. Zhu","year":"2009","unstructured":"Zhu, H., Bao, F.: Non-committing Encryptions Based on Oblivious Naor-Pinkas Cryptosystems. In: Roy, B., Sendrier, N. (eds.) INDOCRYPT 2009. LNCS, vol.\u00a05922, pp. 418\u2013429. Springer, Heidelberg (2009)"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/978-3-642-21518-6_4","volume-title":"INSCRYPT 2010","author":"H. Zhu","year":"2011","unstructured":"Zhu, H., Bao, F.: Error-free, Multi-bit Non-committing Encryption with Constant Round Complexity. In: Lai, X., Yung, M., Lin, D. (eds.) INSCRYPT 2010. LNCS, vol.\u00a06584, pp. 52\u201361. Springer, Heidelberg (2011)"}],"container-title":["Communications in Computer and Information Science","e-Business and Telecommunications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25206-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T01:55:54Z","timestamp":1742522154000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25206-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642252051","9783642252068"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25206-8_18","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2012]]}}}