{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T22:40:08Z","timestamp":1748904008784,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662498958"},{"type":"electronic","value":"9783662498965"}],"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"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49896-5_8","type":"book-chapter","created":{"date-parts":[[2016,4,27]],"date-time":"2016-04-27T04:45:32Z","timestamp":1461732332000},"page":"213-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["All Complete Functionalities are Reversible"],"prefix":"10.1007","author":[{"given":"Dakshita","family":"Khurana","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Kraschewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hemanta K.","family":"Maji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manoj","family":"Prabhakaran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,28]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-48405-1_6","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"A Beimel","year":"1999","unstructured":"Beimel, A., Malkin, T., Micali, S.: The all-or-nothing nature of two-party secure computation. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 80\u201397. Springer, Heidelberg (1999)"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Brassard, G., Cr\u00e9peau, C., Robert, J.M.: Information theoretic reductions among disclosure problems. In: 27th Annual Symposium on Foundations of Computer Science, Toronto, Ontario, Canada, 27\u201329 October 1986, pp. 168\u2013173. IEEE Computer Society Press (1986)","DOI":"10.1109\/SFCS.1986.26"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: 34th Annual ACM Symposium on Theory of Computing, Montr\u00e9al, Qu\u00e9bec, Canada, 19\u201321 May 2002, pp. 494\u2013503. ACM Press (2002)","DOI":"10.1145\/509907.509980"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions (extended abstract). In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, 24\u201326 October 1988, pp. 42\u201352. IEEE Computer Society Press (1988)","DOI":"10.1109\/SFCS.1988.21920"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-30598-9_4","volume-title":"Security in Communication Networks","author":"C Cr\u00e9peau","year":"2005","unstructured":"Cr\u00e9peau, C., Morozov, K., Wolf, S.: Efficient unconditional oblivious transfer from almost any noisy channel. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol. 3352, pp. 47\u201359. Springer, Heidelberg (2005)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/3-540-46416-6_9","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"C Cr\u00e9peau","year":"1991","unstructured":"Cr\u00e9peau, C., S\u00e1ntha, M.: On the reversibility of oblivious transfer. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 106\u2013113. Springer, Heidelberg (1991)"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97\u2013139 (2008). http:\/\/dx.org\/10.1137\/060651380","journal-title":"SIAM J. Comput."},{"key":"8_CR9","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: Aho, A. (ed.) 19th Annual ACM Symposium on Theory of Computing, New York City, New York, USA, 25\u201327 May 1987, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/3-540-48184-2_6","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"O Goldreich","year":"1988","unstructured":"Goldreich, O., Vainish, R.: How to solve any protocol problem - an efficiency improvement. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 73\u201386. Springer, Heidelberg (1988)"},{"key":"8_CR11","unstructured":"Haber, S., Micali, S.: Unpublished manuscript (1986)"},{"key":"8_CR12","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 - efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572\u2013591. Springer, Heidelberg (2008)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, USA, 2\u20134 May 1988, pp. 20\u201331. ACM Press (1988)","DOI":"10.1145\/62212.62215"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A general completeness theorem for two-party games. In: 23rd Annual ACM Symposium on Theory of Computing, New Orleans, Louisiana, USA, 6\u20138 May 1991, pp. 553\u2013560. ACM Press (1991)","DOI":"10.1145\/103418.103475"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Kilian, J.: More general completeness theorems for secure two-party computation. In: 32nd Annual ACM Symposium on Theory of Computing, Portland, Oregon, USA, 21\u201323 May 2000, pp. 316\u2013324. ACM Press (2000)","DOI":"10.1145\/335305.335342"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/978-3-642-55220-5_36","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"D Kraschewski","year":"2014","unstructured":"Kraschewski, D., Maji, H.K., Prabhakaran, M., Sahai, A.: A full characterization of completeness for two-party randomized function evaluation. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 659\u2013676. Springer, Heidelberg (2014)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-19571-6_22","volume-title":"Theory of Cryptography","author":"D Kraschewski","year":"2011","unstructured":"Kraschewski, D., M\u00fcller-Quade, J.: Completeness theorems with constructive proofs for finite deterministic 2-party functions. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 364\u2013381. Springer, Heidelberg (2011)"},{"key":"8_CR18","unstructured":"Lindell, Y.: Adaptively secure two-party computation with erasures. Cryptology ePrint Archive, Report 2009\/031 (2009). http:\/\/eprint.iacr.org\/2009\/031"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-34931-7_4","volume-title":"Progress in Cryptology - INDOCRYPT 2012","author":"HK Maji","year":"2012","unstructured":"Maji, H.K., Prabhakaran, M., Rosulek, M.: A unified characterization of completeness and triviality for secure function evaluation. In: Galbraith, S.D., Nandi, M. (eds.) INDOCRYPT 2012. LNCS, vol. 7668, pp. 40\u201359. Springer, Heidelberg (2012)"},{"key":"8_CR20","unstructured":"Rabin, M.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory (1981)"},{"issue":"1","key":"8_CR21","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/1008908.1008920","volume":"15","author":"Stephen Wiesner","year":"1983","unstructured":"Wiesner, S.: Conjugate coding. SIGACT News 15, 78\u201388. http:\/\/doi.acm.org\/10.1145\/1008908.1008920","journal-title":"ACM SIGACT News"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/11761679_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2006","author":"S Wolf","year":"2006","unstructured":"Wolf, S., Wullschleger, J.: Oblivious transfer is symmetric. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 222\u2013232. Springer, Heidelberg (2006)"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Protocols for secure computations (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, 3\u20135 November 1982, pp. 160\u2013164. IEEE Computer Society Press (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2016"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49896-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T22:03:35Z","timestamp":1748901815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49896-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662498958","9783662498965"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49896-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"28 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}