{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T05:38:17Z","timestamp":1736573897331,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540374329"},{"type":"electronic","value":"9783540374336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11818175_26","type":"book-chapter","created":{"date-parts":[[2006,9,23]],"date-time":"2006-09-23T06:21:52Z","timestamp":1158992512000},"page":"427-444","source":"Crossref","is-referenced-by-count":9,"title":["Oblivious Transfer and Linear Functions"],"prefix":"10.1007","author":[{"given":"Ivan B.","family":"Damg\u00e5rd","sequence":"first","affiliation":[]},{"given":"Serge","family":"Fehr","sequence":"additional","affiliation":[]},{"given":"Louis","family":"Salvail","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Schaffner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/3-540-44750-4_8","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"D. Beaver","year":"1995","unstructured":"Beaver, D.: Precomputing oblivious transfer. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 97\u2013109. Springer, Heidelberg (1995)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Bennett, C.H., Brassard, G., Cr\u00e9peau, C., Maurer, U.M.: Generalized privacy amplification. IEEE Transactions on Information Theory\u00a041(6) (1995)","DOI":"10.1109\/18.476316"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"G. Brassard","year":"1997","unstructured":"Brassard, G., Cr\u00e9peau, C.: Oblivious transfers and privacy amplification. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294. Springer, Heidelberg (1997)"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Brassard, G., Cr\u00e9peau, C., Wolf, S.: Oblivious transfer and privacy amplification. Journal of Cryptology\u00a016(4) (2003)","DOI":"10.1007\/s00145-002-0146-4"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BFb0054139","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"C. Cachin","year":"1998","unstructured":"Cachin, C.: On the foundations of oblivious transfer. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 361\u2013374. Springer, Heidelberg (1998)"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Cachin, C., Cr\u00e9peau, C., Marcil, J.: Oblivious transfer with a memory-bounded receiver. In: 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 493\u2013502 (1998)","DOI":"10.1109\/SFCS.1998.743500"},{"key":"26_CR7","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.\u00a0293, pp. 350\u2013354. Springer, Heidelberg (1988)"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions (extended abstract). In: 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (1988)","DOI":"10.1109\/SFCS.1988.21920"},{"key":"26_CR9","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.\u00a03352, pp. 47\u201359. Springer, Heidelberg (2005)"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/11761679_13","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C. Cr\u00e9peau","year":"2006","unstructured":"Cr\u00e9peau, C., Savvides, G.: Optimal reductions between oblivious transfers using interactive hashing. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 201\u2013221. Springer, Heidelberg (2006)"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1007\/11761679_32","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C. Cr\u00e9peau","year":"2006","unstructured":"Cr\u00e9peau, C., Savvides, G., Schaffner, C., Wullschleger, J.: Information-theoretic conditions for two-party secure function evaluation. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 538\u2013554. Springer, Heidelberg (2006); Full version: http:\/\/eprint.iacr.org"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-540-24638-1_20","volume-title":"Theory of Cryptography","author":"I.B. Damg\u00e5rd","year":"2004","unstructured":"Damg\u00e5rd, I.B., Fehr, S., Morozov, K., Salvail, L.: Unfair noisy channels and oblivious transfer. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 355\u2013373. Springer, Heidelberg (2004)"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I.B., Fehr, S., Renner, R., Salvail, L., Schaffner, C.: A tight high-order entropic uncertainty relation with applications in the bounded quantum-storage model (in preparation, 2006)","DOI":"10.1007\/978-3-540-74143-5_20"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I.B., Fehr, S., Salvail, L., Schaffner, C.: Cryptography in the bounded quantum-storage model. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (2005)","DOI":"10.7146\/brics.v12i20.21886"},{"key":"26_CR15","unstructured":"Damg\u00e5rd, I.B., Fehr, S., Salvail, L., Schaffner, C.: Oblivious transfer and linear functions (full version) (2006), Available at: http:\/\/eprint.iacr.org\/2005\/349"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/3-540-48910-X_5","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"I.B. Damg\u00e5rd","year":"1999","unstructured":"Damg\u00e5rd, I.B., Kilian, J., Salvail, L.: On the (Im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, p. 56. Springer, Heidelberg (1999)"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-44647-8_9","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"Y.Z. Ding","year":"2001","unstructured":"Ding, Y.Z.: Oblivious transfer in the bounded storage model. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, p. 155. Springer, Heidelberg (2001)"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-540-24638-1_25","volume-title":"Theory of Cryptography","author":"Y.Z. Ding","year":"2004","unstructured":"Ding, Y.Z., Harnik, D., Rosen, A., Shaltiel, R.: Constant-round oblivious transfer in the bounded storage model. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 446\u2013472. Springer, Heidelberg (2004)"},{"key":"26_CR19","volume-title":"Advances in Cryptology: Proceedings of CRYPTO 1982","author":"S. Even","year":"1982","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. In: Advances in Cryptology: Proceedings of CRYPTO 1982, Plenum Press, New York (1982)"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM Journal on Computing\u00a028(4) (1999)","DOI":"10.1137\/S0097539793244708"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions. In: 21st Annual ACM Symposium on Theory of Computing (STOC) (1989)","DOI":"10.1145\/73007.73009"},{"key":"26_CR22","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: 20th Annual ACM Symposium on Theory of Computing (STOC) (1988)","DOI":"10.1145\/62212.62215"},{"issue":"17","key":"26_CR23","doi-asserted-by":"publisher","first-page":"3410","DOI":"10.1103\/PhysRevLett.78.3410","volume":"78","author":"H.-K. Lo","year":"1997","unstructured":"Lo, H.-K., Chau, H.F.: Is quantum bit commitment really possible? Physical Review Letters\u00a078(17), 3410\u20133413 (1997)","journal-title":"Physical Review Letters"},{"issue":"17","key":"26_CR24","doi-asserted-by":"publisher","first-page":"3414","DOI":"10.1103\/PhysRevLett.78.3414","volume":"78","author":"D. Mayers","year":"1997","unstructured":"Mayers, D.: Unconditionally secure quantum bit commitment is impossible. Physical Review Letters\u00a078(17), 3414\u20133417 (1997)","journal-title":"Physical Review Letters"},{"key":"26_CR25","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory (1981)"},{"key":"26_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-540-30576-7_22","volume-title":"Theory of Cryptography","author":"R.S. Renner","year":"2005","unstructured":"Renner, R.S., K\u00f6nig, R.: Universally composable privacy amplification against quantum adversaries. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 407\u2013425. Springer, Heidelberg (2005); Also available at: http:\/\/arxiv.org\/abs\/quant-ph\/0403133"},{"key":"26_CR27","doi-asserted-by":"crossref","unstructured":"Wegman, M.N., Carter, J.L.: New classes and applications of hash functions. In: 20th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (1979)","DOI":"10.1109\/SFCS.1979.26"},{"key":"#cr-split#-26_CR28.1","doi-asserted-by":"crossref","unstructured":"Wiesner, S.: Conjugate coding. ACM Special Interest Group on Automata and Computability Theory (SIGACT News), 15 (1983);","DOI":"10.1145\/1008908.1008920"},{"key":"#cr-split#-26_CR28.2","unstructured":"Original manuscript written circa (1970)"},{"key":"26_CR29","doi-asserted-by":"crossref","unstructured":"Wolf, S.: Reducing oblivious string transfer to universal oblivious transfer. In: IEEE International Symposium on Information Theory (ISIT) (2000)","DOI":"10.1109\/ISIT.2000.866763"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11818175_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T23:44:44Z","timestamp":1736552684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11818175_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540374329","9783540374336"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11818175_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}