{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T12:27:20Z","timestamp":1767961640656,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":61,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642173721","type":"print"},{"value":"9783642173738","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17373-8_35","type":"book-chapter","created":{"date-parts":[[2010,12,2]],"date-time":"2010-12-02T15:22:55Z","timestamp":1291303375000},"page":"613-631","source":"Crossref","is-referenced-by-count":129,"title":["Efficient Public-Key Cryptography in the Presence of Key Leakage"],"prefix":"10.1007","author":[{"given":"Yevgeniy","family":"Dodis","sequence":"first","affiliation":[]},{"given":"Kristiyan","family":"Haralambiev","sequence":"additional","affiliation":[]},{"given":"Adriana","family":"L\u00f3pez-Alt","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Wichs","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"In: Proceedings of 44th Symposium on Foundations of Computer Science (FOCS 2003), IEEE Computer Society, Los Alamitos (2003)"},{"key":"35_CR2","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":"35_CR3","doi-asserted-by":"crossref","unstructured":"Alwen, J., Dodis, Y., Naor, M., Segev, G., Walfish, S., Wichs, D.: Public-key encryption in the bounded-retrieval model. In: Gilbert [28], pp. 113\u2013134 (2010)","DOI":"10.1007\/978-3-642-13190-5_6"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Alwen, J., Dodis, Y., Wichs, D.: Leakage-resilient public-key cryptography in the bounded-retrieval model. In: Halevi [35], pp. 36\u201354 (2009)","DOI":"10.1007\/978-3-642-03356-8_3"},{"key":"35_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-14496-7_1","volume-title":"Information Theoretic Security","author":"J. Alwen","year":"2010","unstructured":"Alwen, J., Dodis, Y., Wichs, D.: Survey: Leakage resilience and the bounded retrieval model. In: Kurosawa, K. (ed.) Information Theoretic Security. LNCS, vol.\u00a05973, pp. 1\u201318. Springer, Heidelberg (2010)"},{"key":"35_CR6","unstructured":"Ballard, L., Green, M., de Medeiros, B., Monrose, F.: Correlation-resistant storage via keyword-searchable encryption. Cryptology ePrint Archive, Report 2005\/417 (2005)"},{"key":"35_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/BFb0052259","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"E. Biham","year":"1997","unstructured":"Biham, E., Shamir, A.: Differential fault analysis of secret key cryptosystems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 513\u2013525. Springer, Heidelberg (1997)"},{"key":"35_CR8","first-page":"103","volume-title":"STOC","author":"M. Blum","year":"1988","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications (extended abstract). In: STOC, pp. 103\u2013112. ACM, New York (1988)"},{"key":"35_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-540-28628-8_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 41\u201355. Springer, Heidelberg (2004)"},{"key":"35_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-69053-0_4","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"D. Boneh","year":"1997","unstructured":"Boneh, D., DeMillo, R.A., Lipton, R.J.: On the importance of checking cryptographic protocols for faults (extended abstract). In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 37\u201351. Springer, Heidelberg (1997)"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Chandran, N., Shoup, V.: A public key encryption scheme secure against key dependent chosen plaintext and adaptive chosen ciphertext attacks. In: Joux [39], pp. 351\u2013368 (2009)","DOI":"10.1007\/978-3-642-01001-9_20"},{"key":"35_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-45539-6_33","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"R. Canetti","year":"2000","unstructured":"Canetti, R., Dodis, Y., Halevi, S., Kushilevitz, E., Sahai, A.: Exposure-resilient functions and all-or-nothing transforms. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 453\u2013469. Springer, Heidelberg (2000)"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: STOC, pp. 494\u2013503 (2002)","DOI":"10.1145\/509907.509980"},{"key":"35_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"R. Cramer","year":"1998","unstructured":"Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 13\u201325. Springer, Heidelberg (1998)"},{"key":"35_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-46035-7_4","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"R. Cramer","year":"2002","unstructured":"Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 45\u201364. Springer, Heidelberg (2002)"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Crescenzo, G.D., Lipton, R.J., Walfish, S.: Perfectly secure password protocols in the bounded retrieval model. In: Halevi [36], pp. 225\u2013244 (2006)","DOI":"10.1007\/11681878_12"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Goldwasser, S., Kalai, Y.T., Peikert, C., Vaikuntanathan, V.: Public-key encryption schemes with auxiliary inputs. In: Micciancio [47], pp. 361\u2013381 (2010)","DOI":"10.1007\/978-3-642-11799-2_22"},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Haralambiev, K., Lopez-Alt, A., Wichs, D.: Efficient public-key cryptography in the presence of key leakage. Cryptology ePrint Archive, Report 2010\/154 (2010)","DOI":"10.1007\/978-3-642-17373-8_35"},{"key":"35_CR19","first-page":"621","volume-title":"STOC","author":"Y. Dodis","year":"2009","unstructured":"Dodis, Y., Kalai, Y.T., Lovett, S.: On cryptography with auxiliary input. In: Mitzenmacher, M. (ed.) STOC, pp. 621\u2013630. ACM, New York (2009)"},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Sahai, A., Smith, A.: On perfect and adaptive security in exposure-resilient cryptography. In: Pfitzmann [52], pp. 301\u2013324 (2001)","DOI":"10.1007\/3-540-44987-6_19"},{"key":"35_CR21","doi-asserted-by":"crossref","unstructured":"Dziembowski, S.: Intrusion-resilience via the bounded-storage model. In: Halevi and Rabin [36], pp. 207\u2013224 (2006)","DOI":"10.1007\/11681878_11"},{"key":"35_CR22","first-page":"293","volume-title":"FOCS","author":"S. Dziembowski","year":"2008","unstructured":"Dziembowski, S., Pietrzak, K.: Leakage-resilient cryptography. In: FOCS, pp. 293\u2013302. IEEE Computer Society, Los Alamitos (2008)"},{"key":"35_CR23","doi-asserted-by":"crossref","unstructured":"Faust, S., Kiltz, E., Pietrzak, K., Rothblum, G.N.: Leakage-resilient signatures. In: Micciancio [47], pp. 343\u2013360 (2010)","DOI":"10.1007\/978-3-642-11799-2_21"},{"key":"35_CR24","doi-asserted-by":"crossref","unstructured":"Faust, S., Rabin, T., Reyzin, L., Tromer, E., Vaikuntanathan, V.: Protecting circuits from leakage: the computationally-bounded and noisy cases. In: Gilbert [28], pp. 135\u2013156 (2010)","DOI":"10.1007\/978-3-642-13190-5_7"},{"key":"35_CR25","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"35_CR26","doi-asserted-by":"crossref","unstructured":"Galbraith, S.D., Rotger, V.: Easy decision-diffie-hellman groups. LMS Journal of Computation and Mathematics\u00a07 (2004)","DOI":"10.1112\/S1461157000001108"},{"key":"35_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-44709-1_21","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2001","author":"K. Gandolfi","year":"2001","unstructured":"Gandolfi, K., Mourtel, C., Olivier, F.: Electromagnetic analysis: Concrete results. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol.\u00a02162, pp. 251\u2013261. Springer, Heidelberg (2001)"},{"key":"35_CR28","series-title":"Lecture Notes in Computer Science","volume-title":"EUROCRYPT 2010","year":"2010","unstructured":"Gilbert, H. (ed.): EUROCRYPT 2010. LNCS, vol.\u00a06110. Springer, Heidelberg (2010)"},{"key":"35_CR29","unstructured":"Goldwasser, S., Kalai, Y., Peikert, C., Vaikuntanathan, V.: Robustness of the learning with errors assumption. In: Innovations in Computer Science, ICS (2010)"},{"key":"35_CR30","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T.: On the (in)security of the fiat-shamir paradigm. In: FOCS [1], p. 102 (2003)","DOI":"10.1109\/SFCS.2003.1238185"},{"key":"35_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/11935230_29","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"J. Groth","year":"2006","unstructured":"Groth, J.: Simulation-sound nizk proofs for a practical language and constant size group signatures. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol.\u00a04284, pp. 444\u2013459. Springer, Heidelberg (2006)"},{"key":"35_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-540-76900-2_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"J. Groth","year":"2007","unstructured":"Groth, J.: Fully anonymous group signatures without random oracles. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 164\u2013180. Springer, Heidelberg (2007)"},{"key":"35_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-540-78967-3_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J. Groth","year":"2008","unstructured":"Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 415\u2013432. Springer, Heidelberg (2008)"},{"issue":"5","key":"35_CR34","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/1506409.1506429","volume":"52","author":"J.A. Halderman","year":"2009","unstructured":"Halderman, J.A., Schoen, S.D., Heninger, N., Clarkson, W., Paul, W., Calandrino, J.A., Feldman, A.J., Appelbaum, J., Felten, E.W.: Lest we remember: cold-boot attacks on encryption keys. ACM Commun.\u00a052(5), 91\u201398 (2009)","journal-title":"ACM Commun."},{"key":"35_CR35","series-title":"LNCS","volume-title":"CRYPTO 2009","year":"2009","unstructured":"Halevi, S. (ed.): CRYPTO 2009. LNCS, vol.\u00a05677. Springer, Heidelberg (2009)"},{"key":"35_CR36","series-title":"LNCS","volume-title":"TCC 2006","year":"2006","unstructured":"Halevi, S., Rabin, T. (eds.): TCC 2006. LNCS, vol.\u00a03876. Springer, Heidelberg (2006)"},{"key":"35_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-540-74143-5_31","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"D. Hofheinz","year":"2007","unstructured":"Hofheinz, D., Kiltz, E.: Secure hybrid encryption from weakened key encapsulation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 553\u2013571. Springer, Heidelberg (2007)"},{"key":"35_CR38","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":"35_CR39","series-title":"LNCS","volume-title":"EUROCRYPT 2009","year":"2009","unstructured":"Joux, A. (ed.): EUROCRYPT 2009. LNCS, vol.\u00a05479. Springer, Heidelberg (2009)"},{"key":"35_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-14623-7_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"A. Juma","year":"2010","unstructured":"Juma, A., Vahlis, Y.: Protecting cryptographic keys against continual leakage. In: Rabin, T. (ed.) Advances in Cryptology \u2013 CRYPTO 2010. LNCS, vol.\u00a06223, pp. 41\u201358. Springer, Heidelberg (2010)"},{"key":"35_CR41","doi-asserted-by":"crossref","unstructured":"Kamp, J., Zuckerman, D.: Deterministic extractors for bit-fixing sources and exposure-resilient cryptography. In: FOCS [1], pp. 92\u2013101 (2003)","DOI":"10.1109\/SFCS.2003.1238184"},{"key":"35_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/978-3-642-10366-7_41","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"J. Katz","year":"2009","unstructured":"Katz, J., Vaikuntanathan, V.: Signature schemes with bounded leakage resilience. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 703\u2013720. Springer, Heidelberg (2009)"},{"key":"35_CR43","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":"35_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/3-540-48405-1_25","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"P.C. Kocher","year":"1999","unstructured":"Kocher, P.C., Jaffe, J., Jun, B.: Differential power analysis. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 388\u2013397. Springer, Heidelberg (1999)"},{"issue":"3","key":"35_CR45","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s00145-005-0345-x","volume":"19","author":"Y. Lindell","year":"2006","unstructured":"Lindell, Y.: A simpler construction of cca2-secure public-keyencryption under general assumptions. J. Cryptology\u00a019(3), 359\u2013377 (2006)","journal-title":"J. Cryptology"},{"key":"35_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-24638-1_16","volume-title":"Theory of Cryptography","author":"S. Micali","year":"2004","unstructured":"Micali, S., Reyzin, L.: Physically observable cryptography (extended abstract). In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 278\u2013296. Springer, Heidelberg (2004)"},{"key":"35_CR47","series-title":"LNCS","volume-title":"TCC 2010","year":"2010","unstructured":"Micciancio, D. (ed.): TCC 2010. LNCS, vol.\u00a05978. Springer, Heidelberg (2010)"},{"key":"35_CR48","doi-asserted-by":"crossref","unstructured":"Naor, M., Segev, G.: Public-key cryptosystems resilient to key leakage. In: Halevi [35], pp. 18\u201335 (2009)","DOI":"10.1007\/978-3-642-03356-8_2"},{"key":"35_CR49","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1145\/100216.100273","volume-title":"STOC","author":"M. Naor","year":"1990","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: STOC, pp. 427\u2013437. ACM, New York (1990)"},{"key":"35_CR50","first-page":"563","volume-title":"FOCS","author":"R. Pass","year":"2005","unstructured":"Pass, R., Rosen, A.: Concurrent non-malleable commitments. In: FOCS, pp. 563\u2013572. IEEE Computer Society, Los Alamitos (2005)"},{"key":"35_CR51","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/1060590.1060670","volume-title":"STOC","author":"R. Pass","year":"2005","unstructured":"Pass, R., Rosen, A.: New and improved constructions of non-malleable cryptographic protocols. In: Gabow, H.N., Fagin, R. (eds.) STOC, pp. 533\u2013542. ACM, New York (2005)"},{"key":"35_CR52","series-title":"Lecture Notes in Computer Science","volume-title":"EUROCRYPT 2001","year":"2001","unstructured":"Pfitzmann, B. (ed.): EUROCRYPT 2001. LNCS, vol.\u00a02045. Springer, Heidelberg (2001)"},{"key":"35_CR53","doi-asserted-by":"crossref","unstructured":"Pietrzak, K.: A leakage-resilient mode of operation. In: Joux [39], pp. 462\u2013482 (2009)","DOI":"10.1007\/978-3-642-01001-9_27"},{"key":"35_CR54","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.P. (eds.) E-smart 2001. LNCS, vol.\u00a02140, pp. 200\u2013210. Springer, Heidelberg (2001)"},{"key":"35_CR55","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.R.: 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":"35_CR56","doi-asserted-by":"crossref","unstructured":"Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: FOCS, pp. 543\u2013553 (1999)","DOI":"10.1109\/SFFCS.1999.814628"},{"key":"35_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/3-540-44647-8_33","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"A.D. Santis","year":"2001","unstructured":"Santis, A.D., Crescenzo, G.D., Ostrovsky, R., Persiano, G., Sahai, A.: Robust non-interactive zero knowledge. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 566\u2013598. Springer, Heidelberg (2001)"},{"key":"35_CR58","first-page":"427","volume-title":"FOCS","author":"A.D. Santis","year":"1992","unstructured":"Santis, A.D., Persiano, G.: Zero-knowledge proofs of knowledge without interaction (extended abstract). In: FOCS, pp. 427\u2013436. IEEE, Los Alamitos (1992)"},{"key":"35_CR59","unstructured":"Scott, M.: Authenticated id-based key exchange and remote log-in with simple token and pin number. Cryptology ePrint Archive, Report 2002\/164 (2002)"},{"key":"35_CR60","unstructured":"Shacham, H.: A cramer-shoup encryption scheme from the linear assumption and from progressively weaker linear variants. Cryptology ePrint Archive, Report 2007\/074 (2007)"},{"issue":"4","key":"35_CR61","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s00145-004-0313-x","volume":"17","author":"E.R. Verheul","year":"2004","unstructured":"Verheul, E.R.: Evidence that xtr is more secure than supersingular elliptic curve cryptosystems. J. Cryptology\u00a017(4), 277\u2013296 (2004)","journal-title":"J. Cryptology"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17373-8_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T11:23:43Z","timestamp":1740741823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17373-8_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642173721","9783642173738"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17373-8_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}