{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:35:54Z","timestamp":1753601754735},"publisher-location":"Cham","reference-count":60,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319566139"},{"type":"electronic","value":"9783319566146"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-56614-6_12","type":"book-chapter","created":{"date-parts":[[2017,3,30]],"date-time":"2017-03-30T22:31:20Z","timestamp":1490913080000},"page":"351-377","source":"Crossref","is-referenced-by-count":4,"title":["Magic Adversaries Versus Individual Reduction: Science Wins Either Way"],"prefix":"10.1007","author":[{"given":"Yi","family":"Deng","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,1]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Adleman, L.M.: Two theorems on random polynomial time. In: Proceedings of the 19th Annual Symposium on Foundations of Computer Science, FOCS 1978, pp. 75\u201383. IEEE Computer Society (1978)","DOI":"10.1109\/SFCS.1978.37"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: Proceedings of the 42th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2001, pp. 106\u2013115. IEEE Computer Society (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-42033-7_16","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"P Baecher","year":"2013","unstructured":"Baecher, P., Brzuska, C., Fischlin, M.: Notions of black-box reductions, revisited. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8269, pp. 296\u2013315. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-42033-7_16"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Paneth, O., Rosen, A.: On the existence of extractable one-way functions. In: Proceedings of the 45th Annual ACM Symposium on the Theory of Computing, STOC 2014, pp. 505\u2013514. ACM Press (2014)","DOI":"10.1145\/2591796.2591859"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BFb0055735","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"M Bellare","year":"1998","unstructured":"Bellare, M., Halevi, S., Sahai, A., Vadhan, S.: Many-to-one trapdoor functions and their relation to public-key cryptosystems. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 283\u2013298. Springer, Heidelberg (1998). doi: 10.1007\/BFb0055735"},{"issue":"5","key":"12_CR6","doi-asserted-by":"crossref","first-page":"1325","DOI":"10.1137\/130928236","volume":"44","author":"N Bitansky","year":"2015","unstructured":"Bitansky, N., Paneth, O.: On non-black-box simulation and the impossibility of approximate obfuscation. SIAM J. Comput. 44(5), 1325\u20131383 (2015)","journal-title":"SIAM J. Comput."},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-89255-7_18","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"M Backes","year":"2008","unstructured":"Backes, M., Unruh, D.: Limits of constructive security proofs. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 290\u2013307. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-89255-7_18"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. 3378, pp. 17\u201333. Springer, Heidelberg (2005). doi: 10.1007\/978-3-540-30576-7_2"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-box concurrent zero-knowledge requires omega(log n) rounds. In: Proceedings of the 33rd Annual ACM Symposium Theory of Computing, STOC 2001, pp. 570\u2013579. ACM Press (2001)","DOI":"10.1145\/380752.380852"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Chung, K.-M., Lin, H., Mahmoody, M., Pass, R.: On the power of nonuniformity in proofs of security. In: ITCS 2013, pp. 389\u2013400 (2013)","DOI":"10.1145\/2422436.2422480"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party computation. In: Proceedings of the 34th Annual ACM Symposium on the Theory of Computing, STOC 2002, pp. 494\u2013503. ACM Press (2002)","DOI":"10.1145\/509907.509980"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-36594-2_5","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2013","unstructured":"Canetti, R., Lin, H., Paneth, O.: Public-coin concurrent zero-knowledge in the global hash model. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 80\u201399. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-36594-2_5"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Chung, K.-M., Lin, H., Pass, R.: Constant-round concurrent zero knowledge from p-certificates. In: Proceedings of the 54th Annual Symposium on Foundations of Computer Science, FOCS 2013, pp. 50\u201359. IEEE Computer Society (2013)","DOI":"10.1109\/FOCS.2013.14"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-662-47989-6_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"K-M Chung","year":"2015","unstructured":"Chung, K.-M., Lin, H., Pass, R.: Constant-round concurrent zero-knowledge from indistinguishability obfuscation. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 287\u2013307. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-47989-6_14"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-662-46494-6_4","volume-title":"Theory of Cryptography","author":"K-M Chung","year":"2015","unstructured":"Chung, K.-M., Lui, E., Pass, R.: From weak to strong zero-knowledge and applications. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9014, pp. 66\u201392. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-46494-6_4"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Cramer, R., Shoup, V.: Signature schemes based on the strong RSA assumption. In: ACM Conference on Computer and Communications Security, CCS 1999, pp. 46\u201352. ACM Press (1999)","DOI":"10.1145\/319709.319716"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/3-540-46766-1_36","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 91","author":"I Damg\u00e5rd","year":"1992","unstructured":"Damg\u00e5rd, I.: Towards practical public key systems secure against chosen ciphertext attacks. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 445\u2013456. Springer, Heidelberg (1992). doi: 10.1007\/3-540-46766-1_36"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Deng, Y.: Magic adversaries versus individual reduction: science wins either way. Cryptology ePrint Archive, Report 2016\/1107 (2016)","DOI":"10.1007\/978-3-319-56614-6_12"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-319-44618-9_13","volume-title":"Security and Cryptography for Networks","author":"Y Deng","year":"2016","unstructured":"Deng, Y., Garay, J., Ling, S., Wang, H., Yung, M.: On the implausibility of constant-round public-coin zero-knowledge proofs. In: Zikas, V., Prisco, R. (eds.) SCN 2016. LNCS, vol. 9841, pp. 237\u2013253. Springer, Cham (2016). doi: 10.1007\/978-3-319-44618-9_13"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Deng, Y., Goyal, V., Sahai, A.: Resolving the simultaneous resettability conjecture and a new non-black-box simulation strategy. In: Proceedings of the 50th Annual Symposium on Foundations of Computer Science, FOCS 2009, pp. 251\u2013260. IEEE Computer Society (2009)","DOI":"10.1109\/FOCS.2009.59"},{"issue":"6","key":"12_CR21","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theor. 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"6","key":"12_CR22","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/950620.950623","volume":"50","author":"C Dwork","year":"2003","unstructured":"Dwork, C., Naor, M., Reingold, O., Stockmeyer, L.J.: Magic functions. J. ACM 50(6), 852\u2013921 (2003)","journal-title":"J. ACM"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. In: Proceedings of the 30rd Annual ACM Symposium Theory of Computing, STOC 1998, pp. 409\u2013418. ACM Press (1998)","DOI":"10.1145\/276698.276853"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-662-53644-5_7","volume-title":"Theory of Cryptography","author":"D Dachman-Soled","year":"2016","unstructured":"Dachman-Soled, D.: Towards non-black-box separations of public key encryption and one way function. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 169\u2013191. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-53644-5_7"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/0-387-34805-0_46","volume-title":"Advances in Cryptology \u2014 CRYPTO\u201989 Proceedings","author":"U Feige","year":"1990","unstructured":"Feige, U., Shamir, A.: Zero knowledge proofs of knowledge in two rounds. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 526\u2013544. Springer, New York (1990). doi: 10.1007\/0-387-34805-0_46"},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-642-40084-1_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"V Goyal","year":"2013","unstructured":"Goyal, V., Gupta, D., Jain, A.: What information is leaked under concurrent composition? In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 220\u2013238. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-40084-1_13"},{"key":"12_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-29011-4_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"S Garg","year":"2012","unstructured":"Garg, S., Goyal, V., Jain, A., Sahai, A.: Concurrently secure computation in constant rounds. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 99\u2013116. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-29011-4_8"},{"key":"12_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-662-48000-7_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"V Goyal","year":"2015","unstructured":"Goyal, V., Gupta, D., Sahai, A.: Concurrent secure computation via non-black box simulation. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 23\u201342. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-48000-7_2"},{"issue":"3","key":"12_CR29","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O Goldreich","year":"1996","unstructured":"Goldreich, O., Kahan, A.: How to construct constant-round zero-knowledge proof systems for NP. J. Cryptology 9(3), 167\u2013190 (1996)","journal-title":"J. Cryptology"},{"key":"12_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-662-46494-6_12","volume-title":"Theory of Cryptography","author":"V Goyal","year":"2015","unstructured":"Goyal, V., Lin, H., Pandey, O., Pass, R., Sahai, A.: Round-efficient concurrently composable secure computation via a robust extraction lemma. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9014, pp. 260\u2013289. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-46494-6_12"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption and how to play mental poker keeping secret all partial information. In: Proceedings of the 14rd Annual ACM Symposium Theory of Computing, STOC 1982, pp. 365\u2013377. ACM Press (1982)","DOI":"10.1145\/800070.802212"},{"issue":"1","key":"12_CR32","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"12_CR33","unstructured":"Goldreich, O., Nisan, N., Wigderson, A.: On yao\u2019s xor-lemma. In: Electronic Colloquium on Computational Complexity, TR95-050 (1995)"},{"issue":"1","key":"12_CR34","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF02620230","volume":"6","author":"O Goldreich","year":"1993","unstructured":"Goldreich, O.: A uniform-complexity treatment of encryption and zero-knowledge. J. Cryptology 6(1), 21\u201353 (1993)","journal-title":"J. Cryptology"},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography, Basic Tools. Cambridge University Press, Cambridge (2001)","DOI":"10.1017\/CBO9780511546891"},{"key":"12_CR36","doi-asserted-by":"crossref","unstructured":"Goyal, V.: Non-black-box simulation in the fully concurrent setting. In: Proceedings of the 45th Annual ACM Symposium on the Theory of Computing, STOC 2013, pp. 221\u2013230. ACM Press (2013)","DOI":"10.1145\/2488608.2488637"},{"issue":"4","key":"12_CR37","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J Hastad","year":"1999","unstructured":"Hastad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"12_CR38","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/s00145-011-9115-0","volume":"26","author":"D Hofheinz","year":"2003","unstructured":"Hofheinz, D., Kiltz, E., Shoup, V.: Practical chosen ciphertext secure encryption from factoring. J. Cryptology 26(1), 102\u2013118 (2003)","journal-title":"J. Cryptology"},{"key":"12_CR39","doi-asserted-by":"crossref","unstructured":"Haitner, I., Reingold, O.: Statistically-hiding commitment from any one-way function. In: Proceedings of the 39rd Annual ACM Symposium Theory of Computing, STOC 2007, pp. 1\u201310. ACM Press (2007)","DOI":"10.1145\/1250790.1250792"},{"key":"12_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-19571-6_2","volume-title":"Theory of Cryptography","author":"T Holenstein","year":"2011","unstructured":"Holenstein, T., Schoenebeck, G.: General hardness amplification of predicates and puzzles. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 19\u201336. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-19571-6_2"},{"key":"12_CR41","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, FOCS 1989, pp. 230\u2013235. IEEE Computer Society (1989)","DOI":"10.1109\/SFCS.1989.63483"},{"key":"12_CR42","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R.: A personal view of average-case complexity. In: Proceedings of the 10th Annual IEEE Structure in Complexity Theory Conference, pp. 134\u2013147. IEEE Computer Society (1995)","DOI":"10.1109\/SCT.1995.514853"},{"key":"12_CR43","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: Proceedings of the 21th Annual ACM Symposium on the Theory of Computing, STOC 1989, pp. 44\u201361. ACM Press (1989)","DOI":"10.1145\/73007.73012"},{"key":"12_CR44","doi-asserted-by":"crossref","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography. Chapman and Hall\/CRC Press (2007)","DOI":"10.1201\/9781420010756"},{"key":"12_CR45","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E.: Concurrent and resettable zero-knowledge in poly-loalgorithm rounds. In: Proceedings of the 33rd Annual ACM Symposium Theory of Computing, STOC 2001, pp. 560\u2013569. ACM Press (2001)","DOI":"10.1145\/380752.380851"},{"key":"12_CR46","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: Bounded-concurrent secure two-party computation without setup assumptions. In: Proceedings of the 35rd Annual ACM Symposium Theory of Computing, STOC 2003, pp. 683\u2013692. ACM Press (2003)","DOI":"10.1145\/780542.780641"},{"key":"12_CR47","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: General composition and universal composability in secure multi-party computation. In: Proceedings of the 44th Annual Symposium on Foundations of Computer Science, FOCS 2003, pp. 394\u2013403. IEEE Computer Society (2003)","DOI":"10.1109\/SFCS.2003.1238213"},{"issue":"2","key":"12_CR48","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/s00145-007-9015-5","volume":"21","author":"Y Lindell","year":"2008","unstructured":"Lindell, Y.: Lower bounds and impossibility results for concurrent self composition. J. Cryptology 21(2), 200\u2013249 (2008)","journal-title":"J. Cryptology"},{"key":"12_CR49","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: Annual ACM Symposium on the Theory of Computing, STOC 1990, pp. 427\u2013437. ACM Press (1990)","DOI":"10.1145\/100216.100273"},{"key":"12_CR50","doi-asserted-by":"crossref","unstructured":"Pass, R.: Bounded-concurrent secure multi-party computation with a dishonest majority. In: Proceedings of the 36th Annual ACM Symposium on the Theory of Computing, STOC 2004, pp. 232\u2013241. ACM Press (2004)","DOI":"10.1145\/1007352.1007393"},{"key":"12_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/978-3-662-46497-7_25","volume-title":"Theory of Cryptography","author":"O Pandey","year":"2015","unstructured":"Pandey, O., Prabhakaran, M., Sahai, A.: Obfuscation-based non-black-box simulation and four message concurrent zero knowledge for NP. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 638\u2013667. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-46497-7_25"},{"key":"12_CR52","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: Bounded-concurrent secure two-party computation in a constant number of rounds. In: Proceedings of the 44th Annual Symposium on Foundations of Computer Science, FOCS 2003, pp. 404\u2013413. IEEE Computer Society (2003)","DOI":"10.1109\/SFCS.2003.1238214"},{"key":"12_CR53","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: Concurrent non-malleable commitments. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005, pp. 563\u2013572. IEEE Computer Society (2005)","DOI":"10.1109\/SFCS.2005.27"},{"key":"12_CR54","doi-asserted-by":"crossref","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round-complexity. In: Proceedings of the 43th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2002, pp. 366\u2013375. IEEE Computer Society (2002)","DOI":"10.1109\/SFCS.2002.1181961"},{"key":"12_CR55","unstructured":"Rabin, M.: Digitalized signatures and public-key encryptions as intractable as factorization. Technical Report MIT\/LCS\/TR-212, MIT Laboratory for Computer Science (1979)"},{"issue":"6","key":"12_CR56","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 1\u201340 (2009)","journal-title":"J. ACM"},{"key":"12_CR57","doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: Proceedings of the 22rd Annual ACM Symposium Theory of Computing, STOC 1990, pp. 387\u2013394. ACM Press (1990)","DOI":"10.1145\/100216.100269"},{"issue":"2","key":"12_CR58","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"12_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24638-1_1","volume-title":"Theory of Cryptography","author":"O Reingold","year":"2004","unstructured":"Reingold, O., Trevisan, L., Vadhan, S.: Notions of reducibility between cryptographic primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 1\u201320. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-24638-1_1"},{"key":"12_CR60","doi-asserted-by":"crossref","unstructured":"Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, FOCS 1999, pp. 543\u2013553. IEEE Computer Society (1999)","DOI":"10.1109\/SFFCS.1999.814628"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2017"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-56614-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T08:01:56Z","timestamp":1568966516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-56614-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319566139","9783319566146"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-56614-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}