{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:21:51Z","timestamp":1757542911758},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540785231"},{"type":"electronic","value":"9783540785248"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78524-8_34","type":"book-chapter","created":{"date-parts":[[2008,2,25]],"date-time":"2008-02-25T09:18:12Z","timestamp":1203931092000},"page":"626-643","source":"Crossref","is-referenced-by-count":7,"title":["Degradation and Amplification of Computational Hardness"],"prefix":"10.1007","author":[{"given":"Shai","family":"Halevi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tal","family":"Rabin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-3-540-30576-7_2","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2005","unstructured":"Canetti, R., Halevi, S., Steiner, M.: Hardness amplification of weakly verifiable puzzles. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 17\u201333. Springer, Heidelberg (2005)"},{"key":"34_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/3-540-48910-X_5","volume-title":"Advances in Cryptology - EUROCRYPT 1999","author":"I. Damg\u00e5rd","year":"1999","unstructured":"Damg\u00e5rd, I., 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, pp. 56\u201373. Springer, Heidelberg (1999)"},{"issue":"6","key":"34_CR3","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. Communications of the ACM\u00a028(6), 637\u2013647 (1985)","journal-title":"Communications of the ACM"},{"key":"34_CR4","unstructured":"Goldreich, O., Nisan, N., Wigderson, A.: On Yao\u2019s xor-lemma. Electronic Colloquium on Computational Complexity (ECCC)\u00a02(50) (1995)"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1145\/1060590.1060689","volume-title":"STOC 2005","author":"T. Holenstein","year":"2005","unstructured":"Holenstein, T.: Key agreement from weak bit agreement. In: STOC 2005, pp. 664\u2013673. ACM Press, New York (2005)"},{"key":"34_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1007\/11535218_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"T. Holenstein","year":"2005","unstructured":"Holenstein, T., Renner, R.: One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 478\u2013493. Springer, Heidelberg (2005)"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1109\/SFCS.1989.63483","volume-title":"30th Annual Symposium on Foundations of Computer Science \u2013 FOCS 1989","author":"R. Impagliazzo","year":"1989","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography. In: 30th Annual Symposium on Foundations of Computer Science \u2013 FOCS 1989, pp. 230\u2013235. IEEE Computer Society Press, Los Alamitos (1989)"},{"key":"34_CR8","first-page":"30","volume-title":"STOC 1988","author":"J. Kilian","year":"1988","unstructured":"Kilian, J.: Founding Cryptography on Oblivious Transfer. In: STOC 1988, pp. 30\u201331. ACM Press, New York (1988)"},{"issue":"4","key":"34_CR9","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02579323","volume":"7","author":"L.A. Levin","year":"1987","unstructured":"Levin, L.A.: One-way functions and pseudorandom generators. Combinatorica\u00a07(4), 357\u2013363 (1987)","journal-title":"Combinatorica"},{"key":"34_CR10","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard (1981)"},{"key":"34_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-540-72540-4_32","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J. Wullschleger","year":"2007","unstructured":"Wullschleger, J.: Oblivious-Transfer Amplification. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 555\u2013572. Springer, Heidelberg (2007)"},{"key":"34_CR12","first-page":"80","volume-title":"23rd Annual Symposium on Foundations of Computer Science","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Theory and applications of trapdoor functions. In: 23rd Annual Symposium on Foundations of Computer Science, November 1982, pp. 80\u201391. IEEE Computer Society Press, Los Alamitos (1982)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78524-8_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:12:10Z","timestamp":1619521930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78524-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540785231","9783540785248"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78524-8_34","relation":{},"subject":[]}}