{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T05:12:02Z","timestamp":1776661922931,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540245735","type":"print"},{"value":"9783540305767","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30576-7_15","type":"book-chapter","created":{"date-parts":[[2010,7,4]],"date-time":"2010-07-04T19:03:26Z","timestamp":1278270206000},"page":"264-282","source":"Crossref","is-referenced-by-count":213,"title":["How to Securely Outsource Cryptographic Computations"],"prefix":"10.1007","author":[{"given":"Susan","family":"Hohenberger","sequence":"first","affiliation":[]},{"given":"Anna","family":"Lysyanskaya","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0022-0000(89)90018-4","volume":"39","author":"M. Abadi","year":"1989","unstructured":"Abadi, M., Feigenbaum, J., Kilian, J.: On hiding information from an oracle. Journal of Comput. Syst. Sci.\u00a039(1), 21\u201350 (1989)","journal-title":"Journal of Comput. Syst. Sci."},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-52282-4_30","volume-title":"STACS 90","author":"Donald Beaver","year":"1990","unstructured":"Beaver, D., Feigenbaum, J.: Hiding instances in multioracle queries. In: Proceedings of STAC 1990, pp. 37\u201348 (1990)"},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s001459900017","volume":"10","author":"D. Beaver","year":"1997","unstructured":"Beaver, D., Feigenbaum, J., Kilian, J., Rogaway, P.: Locally random reductions: Improvements and applications. Journal of Cryptology\u00a010(1), 17\u201336 (1997)","journal-title":"Journal of Cryptology"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Kilian, J., Wigderson, A.: Multi-prover interactive proofs: How to remove intractability assumptions. In: Proceedings of STOC, pp. 113\u2013131 (1988)","DOI":"10.1145\/62212.62223"},{"issue":"1","key":"15_CR5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1145\/200836.200880","volume":"42","author":"Manuel Blum","year":"1995","unstructured":"Blum, M., Kannan, S.: Designing programs that check their work. Journal of the ACM, 269\u2013291 (1995)","journal-title":"Journal of the ACM"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Program result checking against adaptive programs and in cryptographic settings. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp.\u00a0107\u2013118 (1991)","DOI":"10.1090\/dimacs\/002\/06"},{"issue":"3","key":"15_CR7","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/0022-0000(93)90044-W","volume":"47","author":"Manuel Blum","year":"1993","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-testing\/correcting with applications to numerical problems. Journal of Computer and System Science, 549\u2013595 (1993)","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BFb0054129","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"V. Boyko","year":"1998","unstructured":"Boyko, V., Peinado, M., Venkatesan, R.: Speeding up discrete log and factoring based schemes via precomputations. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 221\u2013235. Springer, Heidelberg (1998), \n                    \n                      citeseer.ist.psu.edu\/boyko98speeding.html"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-47555-9_18","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"E.F. Brickell","year":"1993","unstructured":"Brickell, E.F., Gordon, D.M., McCurley, K.S., Wilson, D.B.: Fast exponentiation with precomputation. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 200\u2013207. Springer, Heidelberg (1993)"},{"issue":"10","key":"15_CR10","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1145\/4372.4373","volume":"28","author":"D. Chaum","year":"1985","unstructured":"Chaum, D.: Security without identification: transaction systems to make big brother obsolete. Communications of the ACM\u00a028(10), 1030\u20131044 (1985)","journal-title":"Communications of the ACM"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"D. Chaum","year":"1993","unstructured":"Chaum, D., Pedersen, T.P.: Wallet Databases with Observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 89\u2013105. Springer, Heidelberg (1993)"},{"key":"15_CR12","unstructured":"Clarke, D., Devadas, S., van Dijk, M., Gassend, B., Suh, G.E.: Speeding up Exponentiation using an Untrusted Computational Resource. Technical Report Memo 469, MIT CSAIL Computation Structures Group (August 2003)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Cramer, R., Shoup, V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM Journal of Computing (2003) (to appear), Available at \n                    \n                      http:\/\/www.shoup.net\/papers","DOI":"10.1137\/S0097539702403773"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/3-540-46416-6_6","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"P. Rooij de","year":"1991","unstructured":"de Rooij, P.: On the security of the Schnorr scheme using preprocessing. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 71\u201380. Springer, Heidelberg (1991)"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/3-540-48285-7_37","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"P. Rooij de","year":"1994","unstructured":"de Rooij, P.: On Schnorr\u2019s preprocessing for digital signature schemes. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 435\u2013439. Springer, Heidelberg (1994)"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/BFb0053453","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"P. Rooij de","year":"1995","unstructured":"de Rooij, P.: Efficient exponentiation using precomputation and vector addition chains. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 389\u2013399. Springer, Heidelberg (1995)"},{"issue":"1","key":"15_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s001459900016","volume":"10","author":"P. Rooij de","year":"1997","unstructured":"de Rooij, P.: On Schnorr\u2019s preprocessing for digital signature schemes. Journal of Cryptology\u00a010(1), 1\u201316 (1997)","journal-title":"Journal of Cryptology"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BFb0053425","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"M. Franklin","year":"1995","unstructured":"Franklin, M., Yung, M.: The blinding of weak signatures (extended abstract). In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 67\u201376. Springer, Heidelberg (1995)"},{"key":"15_CR19","unstructured":"Goldberg, I., Wagner, D., Thomas, R., Brewer, E.A.: A secure environment for untrusted helper applications. In: Proceedings of the 6th Usenix Security Symposium (1996)"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/3-540-68697-5_16","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"S. Halevi","year":"1996","unstructured":"Halevi, S., Micali, S.: Practical and provably-secure commitment schemes from collision-free hashing. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 201\u2013212. Springer, Heidelberg (1996)"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/3-540-48658-5_11","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"C.H. Lim","year":"1994","unstructured":"Lim, C.H., Lee, P.J.: More flexible exponentiation with precomputation. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 95\u2013107. Springer, Heidelberg (1994)"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/0-387-34799-2_35","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"T. Matsumoto","year":"1990","unstructured":"Matsumoto, T., Kato, K., Imai, H.: Speeding up secret computations with insecure auxiliary devices. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 497\u2013506. Springer, Heidelberg (1990)"},{"issue":"3","key":"15_CR23","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1145\/373243.360216","volume":"36","author":"G.C. Necula","year":"2001","unstructured":"Necula, G.C., Rahul, S.P.: Oracle-based checking of untrusted software. ACM SIGPLAN Notices\u00a036(3), 142\u2013154 (2001)","journal-title":"ACM SIGPLAN Notices"},{"key":"15_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/3-540-45682-1_2","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"P.Q. Nguyen","year":"2001","unstructured":"Nguyen, P.Q., Shparlinski, I.: On the insecurity of a server-aided RSA protocol. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 21\u201335. Springer, Heidelberg (2001)"},{"key":"15_CR25","unstructured":"Nguyen, P.Q., Shparlinski, I., Stern, J.: Distribution of modular sums and the security of server aided exponentiation. In: Proceedings of the Workshop on Comp. Number Theory and Crypt., pp. 1\u201316 (1999)"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/3-540-46766-1_35","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"C. Rackoff","year":"1992","unstructured":"Rackoff, C., Simon, D.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 433\u2013444. Springer, Heidelberg (1992)"},{"key":"15_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/0-387-34805-0_22","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"C.-P. Schnorr","year":"1990","unstructured":"Schnorr, C.-P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 239\u2013252. Springer, Heidelberg (1990)"},{"key":"15_CR28","first-page":"161","volume":"4","author":"C.-P. Schnorr","year":"1991","unstructured":"Schnorr, C.-P.: Efficient signature generation by smart cards. Journal of Cryptography\u00a04, 161\u2013174 (1991)","journal-title":"Journal of Cryptography"},{"key":"15_CR29","unstructured":"Trusted Computing Group. Trusted computing platform alliance, main specification version 1.1b (2004) (Date of Access: February 10 2004)"},{"key":"15_CR30","unstructured":"Wagner, D.A.: Janus: an approach for confinement of untrusted applications. Technical Report CSD-99-1056, UC Berkeley, 12 (1999)"},{"key":"15_CR31","doi-asserted-by":"crossref","unstructured":"Waters, B.R., Felten, E.W., Sahai, A.: Receiver anonymity via incomparable public keys. In: Proceedings of the 10th ACM CCS Conference, pp. 112\u2013121 (2003)","DOI":"10.1145\/948109.948127"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30576-7_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:30:55Z","timestamp":1620012655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30576-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245735","9783540305767"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30576-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}