{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:14:53Z","timestamp":1746159293386,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":75,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642542411"},{"type":"electronic","value":"9783642542428"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54242-8_7","type":"book-chapter","created":{"date-parts":[[2014,2,3]],"date-time":"2014-02-03T02:42:54Z","timestamp":1391395374000},"page":"146-166","source":"Crossref","is-referenced-by-count":11,"title":["Achieving Constant Round Leakage-Resilient Zero-Knowledge"],"prefix":"10.1007","author":[{"given":"Omkant","family":"Pandey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44987-6_8","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"W. Aiello","year":"2001","unstructured":"Aiello, W., Ishai, Y., Reingold, O.: Priced oblivious transfer: How to sell digital goods. In: EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 119\u2013135. Springer, Heidelberg (2001)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Secure computation with information leaking to an adversary. In: STOC, pp. 715\u2013724 (2011)","DOI":"10.1145\/1993636.1993731"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-642-00457-5_28","volume-title":"Theory of Cryptography","author":"A. Akavia","year":"2009","unstructured":"Akavia, A., Goldwasser, S., Vaikuntanathan, V.: Simultaneous hardcore bits and cryptography against memory attacks. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 474\u2013495. Springer, Heidelberg (2009)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-03356-8_3","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"J. Alwen","year":"2009","unstructured":"Alwen, J., Dodis, Y., Wichs, D.: Leakage-resilient public-key cryptography in the bounded-retrieval model. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 36\u201354. Springer, Heidelberg (2009)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-03356-8_3","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"J. Alwen","year":"2009","unstructured":"Alwen, J., Dodis, Y., Wichs, D.: Leakage-resilient public-key cryptography in the bounded-retrieval model. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 36\u201354. Springer, Heidelberg (2009)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Anderson, R.J., Kuhn, M.G.: Low cost attacks on tamper resistant devices. In: Security Protocols Workshop, pp. 125\u2013136 (1997)","DOI":"10.1007\/BFb0028165"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: FOCS, pp. 106\u2013115 (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Barak, B., Goldreich, O., Goldwasser, S., Lindell, Y.: Resettably-sound zero-knowledge and its applications. In: FOCS 2001, pp. 116\u2013125 (2001)","DOI":"10.1109\/SFCS.2001.959886"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Barak, B.: Constant-round coin-tossing with a man in the middle or realizing the shared random string model. In: FOCS (2002)","DOI":"10.1109\/SFCS.2002.1181957"},{"key":"#cr-split#-7_CR10.1","doi-asserted-by":"crossref","unstructured":"Barak, B., Goldreich, O.: Universal arguments and their applications. In: Annual IEEE Conference on Computational Complexity (CCC), vol.\u00a017 (2002);","DOI":"10.1109\/CCC.2002.1004355"},{"key":"#cr-split#-7_CR10.2","unstructured":"Preliminary full version available as Cryptology ePrint Archive, Report 2001\/105"},{"issue":"4","key":"7_CR11","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1137\/S0097539703427975","volume":"33","author":"B. Barak","year":"2004","unstructured":"Barak, B., Lindell, Y.: Strict polynomial-time in simulation and extraction. SIAM Journal on Computing\u00a033(4), 783\u2013818 (2004); Extended abstract appeared in STOC 2002","journal-title":"SIAM Journal on Computing"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-28914-9_15","volume-title":"Theory of Cryptography","author":"N. Bitansky","year":"2012","unstructured":"Bitansky, N., Canetti, R., Halevi, S.: Leakage-tolerant interactive protocols. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 266\u2013284. Springer, Heidelberg (2012)"},{"key":"7_CR13","unstructured":"Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the International Congress of Mathematicians, pp. 1444\u20131451 (1987)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-20465-4_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"E. Boyle","year":"2011","unstructured":"Boyle, E., Segev, G., Wichs, D.: Fully leakage-resilient signatures. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 89\u2013108. Springer, Heidelberg (2011)"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Kalai, Y.T., Katz, J., Vaikuntanathan, V.: Overcoming the hole in the bucket: Public-key cryptography resilient to continual memory leakage. In: FOCS, pp. 501\u2013510 (2010)","DOI":"10.1109\/FOCS.2010.55"},{"issue":"1","key":"7_CR16","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. Journal of Cryptology: The Journal of the International Association for Cryptologic Research\u00a013(1), 143\u2013202 (2000)","journal-title":"Journal of Cryptology: The Journal of the International Association for Cryptologic Research"},{"key":"#cr-split#-7_CR17.1","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: Werner, B. (ed.) Proc. 42nd FOCS, pp. 136\u2013147 (2001);","DOI":"10.1109\/SFCS.2001.959888"},{"key":"#cr-split#-7_CR17.2","unstructured":"Preliminary full version available as Cryptology ePrint Archive Report 2000\/067"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively secure multi-party computation. In: STOC, pp. 639\u2013648 (1996)","DOI":"10.1145\/237814.238015"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable zero-knowledge. In: Proc. 32th STOC, pp. 235\u2013244 (2000)","DOI":"10.1145\/335305.335334"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/3-540-44598-6_27","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"I. Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Improved non-committing encryption schemes based on a general complexity assumption. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 432\u2013450. Springer, Heidelberg (2000)"},{"issue":"3","key":"7_CR21","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s001459900026","volume":"10","author":"I. Damg\u00e5rd","year":"1997","unstructured":"Damg\u00e5rd, I., Pedersen, T.P., Pfitzmann, B.: On the existence of statistically hiding bit commitment schemes and fail-stop signatures. J. Cryptology\u00a010(3), 163\u2013194 (1997)","journal-title":"J. Cryptology"},{"key":"7_CR22","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: FOCS (2009)","DOI":"10.1109\/FOCS.2009.59"},{"issue":"6","key":"7_CR23","doi-asserted-by":"publisher","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 Transactions on Information Theory\u00a022(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Haralambiev, K., L\u00f3pez-Alt, A., Wichs, D.: Cryptography against continuous memory attacks. In: FOCS, pp. 511\u2013520 (2010)","DOI":"10.1109\/FOCS.2010.56"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-642-17373-8_35","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"Y. Dodis","year":"2010","unstructured":"Dodis, Y., Haralambiev, K., L\u00f3pez-Alt, A., Wichs, D.: Efficient public-key cryptography in the presence of key leakage. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 613\u2013631. Springer, Heidelberg (2010)"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Kalai, Y.T., Lovett, S.: On cryptography with auxiliary input. In: STOC, pp. 621\u2013630 (2009)","DOI":"10.1145\/1536414.1536498"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography (extended abstract). In: STOC, pp. 542\u2013552 (1991)","DOI":"10.1145\/103418.103474"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero knowledge. In: Proc. 30th STOC, pp. 409\u2013418 (1998)","DOI":"10.1145\/276698.276853"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Pietrzak, K.: Leakage-resilient cryptography. In: FOCS, pp. 293\u2013302 (2008)","DOI":"10.1109\/FOCS.2008.56"},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-13190-5_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"S. Faust","year":"2010","unstructured":"Faust, S., Rabin, T., Reyzin, L., Tromer, E., Vaikuntanathan, V.: Protecting circuits from leakage: the computationally-bounded and noisy cases. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 135\u2013156. Springer, Heidelberg (2010)"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Feige, U., Shamir, A.: Zero knowledge proofs of knowledge in two rounds. In: Brassard, G. (ed.) Advances in Cryptology - CRYPTO 1989. LNCS, vol.\u00a0435, pp. 526\u2013544. Springer, Heidelberg (1990)","DOI":"10.1007\/0-387-34805-0_46"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) Advances in Cryptology - CRYPTO 1984. LNCS, vol.\u00a0196, pp. 10\u201318. Springer, Heidelberg (1985)","DOI":"10.1007\/3-540-39568-7_2"},{"key":"7_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-22792-9_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"S. Garg","year":"2011","unstructured":"Garg, S., Jain, A., Sahai, A.: Leakage resilient zero knowledge. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 297\u2013315. Springer, Heidelberg (2011), http:\/\/www.cs.ucla.edu\/~abhishek\/papers\/lrzk.pdf"},{"issue":"3","key":"7_CR34","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1006\/jcss.1999.1689","volume":"60","author":"Y. Gertner","year":"2000","unstructured":"Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting data privacy in private information retrieval schemes. J. Comput. Syst. Sci.\u00a060(3), 592\u2013629 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"#cr-split#-7_CR35.1","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play ANY mental game. In: ACM (ed.) Proc. 19th STOC, pp. 218\u2013229 (1987);","DOI":"10.1145\/28395.28420"},{"key":"#cr-split#-7_CR35.2","unstructured":"For more details see (36, ch.\u00a07)"},{"key":"7_CR36","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Applications. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"issue":"3","key":"7_CR37","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\u00a0NP. Journal of Cryptology\u00a09(3), 167\u2013189 (1996)","journal-title":"Journal of Cryptology"},{"issue":"3","key":"7_CR38","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM\u00a038(3), 691\u2013729 (1991); Preliminary version in FOCS 1986","journal-title":"Journal of the ACM"},{"key":"7_CR39","first-page":"291","volume-title":"Proc. 17th STOC","author":"S. Goldwasser","year":"1985","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: Proc. 17th STOC, pp. 291\u2013304. ACM, Providence (1985)"},{"issue":"1","key":"7_CR40","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/s00145-010-9092-8","volume":"25","author":"S. Halevi","year":"2012","unstructured":"Halevi, S., Kalai, Y.T.: Smooth projective hashing and two-message oblivious transfer. J. Cryptology\u00a025(1), 158\u2013193 (2012)","journal-title":"J. Cryptology"},{"key":"7_CR41","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\u2013215. Springer, Heidelberg (1996)"},{"key":"7_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-642-17373-8_27","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"Y. Ishai","year":"2010","unstructured":"Ishai, Y., Kumarasubramanian, A., Orlandi, C., Sahai, A.: On invertible sampling and adaptive security. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 466\u2013482. Springer, Heidelberg (2010)"},{"key":"7_CR43","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R.: Efficient arguments without short pcps. In: IEEE Conference on Computational Complexity, pp. 278\u2013291 (2007)","DOI":"10.1109\/CCC.2007.10"},{"key":"7_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/11761679_19","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"Y. Ishai","year":"2006","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A., Wagner, D.: Private circuits ii: Keeping secrets in tamperable circuits. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 308\u2013327. Springer, Heidelberg (2006)"},{"key":"7_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-45146-4_27","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y. Ishai","year":"2003","unstructured":"Ishai, Y., Sahai, A., Wagner, D.: Private circuits: Securing hardware against probing attacks. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 463\u2013481. Springer, Heidelberg (2003)"},{"key":"7_CR46","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: Proc. 24th STOC, pp. 723\u2013732 (1992)","DOI":"10.1145\/129712.129782"},{"key":"7_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-642-17373-8_34","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"E. Kiltz","year":"2010","unstructured":"Kiltz, E., Pietrzak, K.: Leakage resilient elgamal encryption. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 595\u2013612. Springer, Heidelberg (2010)"},{"key":"7_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"P.C. Kocher","year":"1996","unstructured":"Kocher, P.C.: Timing attacks on implementations of diffie-hellman, rsa, dss, and other systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 104\u2013113. Springer, Heidelberg (1996)"},{"key":"7_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-19571-6_6","volume-title":"Theory of Cryptography","author":"A. Lewko","year":"2011","unstructured":"Lewko, A., Rouselakis, Y., Waters, B.: Achieving leakage resilience through dual system encryption. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 70\u201388. Springer, Heidelberg (2011)"},{"key":"7_CR50","doi-asserted-by":"crossref","unstructured":"Lewko, A.B., Waters, B.: On the insecurity of parallel repetition for leakage resilience. In: FOCS, pp. 521\u2013530 (2010)","DOI":"10.1109\/FOCS.2010.57"},{"key":"7_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-44647-8_10","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"Y. Lindell","year":"2001","unstructured":"Lindell, Y.: Parallel coin-tossing and constant-round secure two-party computation. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 171\u2013189. Springer, Heidelberg (2001)"},{"key":"7_CR52","doi-asserted-by":"crossref","unstructured":"Micali, S.: CS proofs. In: Proc. 35th FOCS, pp. 436\u2013453 (1994)","DOI":"10.1109\/SFCS.1994.365746"},{"key":"7_CR53","doi-asserted-by":"crossref","unstructured":"Micali, S., Pass, R.: Local zero knowledge. In: Kleinberg, J.M. (ed.) STOC, pp. 306\u2013315. ACM (2006)","DOI":"10.1145\/1132516.1132561"},{"key":"7_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/3-540-46766-1_32","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"S. Micali","year":"1992","unstructured":"Micali, S., Rogaway, P.: Secure computation. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 392\u2013404. Springer, Heidelberg (1992)"},{"key":"7_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/0-387-34805-0_13","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"M. Naor","year":"1990","unstructured":"Naor, M.: Bit commitment using pseudo-randomness (extended abstract). In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 128\u2013136. Springer, Heidelberg (1990)"},{"key":"7_CR56","unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SODA, pp. 448\u2013457 (2001)"},{"key":"7_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-03356-8_2","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"M. Naor","year":"2009","unstructured":"Naor, M., Segev, G.: Public-key cryptosystems resilient to key leakage. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 18\u201335. Springer, Heidelberg (2009)"},{"key":"7_CR58","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: Proc. 21st STOC, pp. 33\u201343 (1989)","DOI":"10.1145\/73007.73011"},{"key":"7_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11605805_1","volume-title":"Topics in Cryptology \u2013 CT-RSA 2006","author":"D.A. Osvik","year":"2006","unstructured":"Osvik, D.A., Shamir, A., Tromer, E.: Cache attacks and countermeasures: The case of aes. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, vol.\u00a03860, pp. 1\u201320. Springer, Heidelberg (2006)"},{"key":"7_CR60","unstructured":"Pandey, O.: Achieving constant round leakage-resilient zero-knowledge. IACR Cryptology ePrint Archive (2012), http:\/\/eprint.iacr.org\/2012\/362.pdf"},{"key":"7_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-39200-9_10","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"R. Pass","year":"2003","unstructured":"Pass, R.: Simulation in quasi-polynomial time, and its application to protocol composition. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 160\u2013176. Springer, Heidelberg (2003)"},{"key":"7_CR62","doi-asserted-by":"crossref","unstructured":"Pass, R.: Bounded-concurrent secure multi-party computation with a dishonest majority. In: Proc. 36th STOC, pp. 232\u2013241 (2004)","DOI":"10.1145\/1007352.1007393"},{"key":"7_CR63","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: New and improved constructions of non-malleable cryptographic protocols. In: STOC (2005)","DOI":"10.1145\/1060590.1060670"},{"key":"7_CR64","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-642-01001-9_27","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"K. Pietrzak","year":"2009","unstructured":"Pietrzak, K.: A leakage-resilient mode of operation. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 462\u2013482. Springer, Heidelberg (2009)"},{"key":"7_CR65","unstructured":"Prabhakaran, M.: New Notions of Security. PhD thesis, Department of Computer Science, Princeton University, Princeton, NJ, USA (2005)"},{"key":"7_CR66","doi-asserted-by":"crossref","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round-complexity. In: FOCS (2002)","DOI":"10.1109\/SFCS.2002.1181961"},{"key":"7_CR67","doi-asserted-by":"crossref","unstructured":"Prabhakaran, M., Sahai, A.: New notions of security: achieving universal composability without trusted setup. In: STOC, pp. 242\u2013251 (2004)","DOI":"10.1145\/1007352.1007394"},{"key":"7_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-45418-7_17","volume-title":"Smart Card Programming and Security","author":"J.-J. Quisquater","year":"2001","unstructured":"Quisquater, J.-J., Samyde, D.: Electromagnetic analysis (ema): Measures and counter-measures for smart cards. In: Attali, I., Jensen, T. (eds.) E-smart 2001. LNCS, vol.\u00a02140, pp. 200\u2013210. Springer, Heidelberg (2001)"},{"key":"7_CR69","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-44598-6_28","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"A. Rosen","year":"2000","unstructured":"Rosen, A.: A note on the round-complexity of concurrent zero-knowledge. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 451\u2013468. Springer, Heidelberg (2000)"},{"key":"7_CR70","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-540-24638-1_11","volume-title":"Theory of Cryptography","author":"A. Rosen","year":"2004","unstructured":"Rosen, A.: A note on constant-round zero-knowledge proofs for NP. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 191\u2013202. Springer, Heidelberg (2004)"},{"key":"7_CR71","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and applications of trapdoor functions. In: Proc. 23rd FOCS, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"},{"key":"7_CR72","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets. In: Proc. 27th FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54242-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T19:09:05Z","timestamp":1746126545000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54242-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642542411","9783642542428"],"references-count":75,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54242-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}