{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T08:32:33Z","timestamp":1772008353932,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,2,29]],"date-time":"2016-02-29T00:00:00Z","timestamp":1456704000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptogr Eng"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s13389-016-0121-x","type":"journal-article","created":{"date-parts":[[2016,2,29]],"date-time":"2016-02-29T18:50:22Z","timestamp":1456771822000},"page":"229-238","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Implementation of a leakage-resilient ElGamal key encapsulation mechanism"],"prefix":"10.1007","volume":"6","author":[{"given":"David","family":"Galindo","sequence":"first","affiliation":[]},{"given":"Johann","family":"Gro\u00dfsch\u00e4dl","sequence":"additional","affiliation":[]},{"given":"Zhe","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Praveen Kumar","family":"Vadnala","sequence":"additional","affiliation":[]},{"given":"Srinivas","family":"Vivek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,29]]},"reference":[{"key":"121_CR1","doi-asserted-by":"crossref","unstructured":"Akavia, A., Goldwasser, S., Vaikuntanathan, V.: Simultaneous hardcore bits and cryptography against memory attacks. In: Reingold, O. (ed.) TCC, LNCS, vol. 5444, pp. 474\u2013495. Springer (2009)","DOI":"10.1007\/978-3-642-00457-5_28"},{"key":"121_CR2","doi-asserted-by":"crossref","unstructured":"Alwen, J., Dodis, Y., Wichs, D.: Leakage-resilient public-key cryptography in the bounded-retrieval model. In: CRYPTO, pp. 36\u201354 (2009)","DOI":"10.1007\/978-3-642-03356-8_3"},{"key":"121_CR3","doi-asserted-by":"crossref","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S.E. (eds.) Selected Areas in Cryptography, LNCS, vol. 3897, pp. 319\u2013331. Springer (2005)","DOI":"10.1007\/11693383_22"},{"key":"121_CR4","doi-asserted-by":"crossref","unstructured":"Bela\u00efd, S., Grosso, V., Standaert, F.X.: Masking and leakage-resilient primitives: one, the other(s) or both? Cryptology ePrint archive, report 2014\/053 (2014)","DOI":"10.1007\/s12095-014-0113-6"},{"key":"121_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546570","volume-title":"Advances in Elliptic Curve Cryptography, London Mathematical Society Lecture Notes Series","author":"IF Blake","year":"2005","unstructured":"Blake, I.F., Seroussi, G., Smart, N.P.: Advances in Elliptic Curve Cryptography, London Mathematical Society Lecture Notes Series, vol. 317. Cambridge University Press, Cambridge (2005)"},{"key":"121_CR6","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyen, X., Goh, E.J.: Hierarchical Identity Based Encryption with constant size ciphertext. In: Cramer, R. (ed.) EUROCRYPT, LNCS, vol. 3494, pp. 440\u2013456. Springer (2005)","DOI":"10.1007\/11426639_26"},{"key":"121_CR7","doi-asserted-by":"publisher","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) Advances in Cryptology\u2014ASIACRYPT 2001, 7th International Conference on the Theory and Application of Cryptology and Information Security, Gold Coast, Australia, 9\u201313 December 2001, Proceedings, Lecture Notes in Computer Science, vol. 2248, pp. 514\u2013532. Springer (2001). doi: 10.1007\/3-540-45682-1_30","DOI":"10.1007\/3-540-45682-1_30"},{"key":"121_CR8","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, D. (ed.) TCC, LNCS, vol. 5978, pp. 361\u2013381. Springer (2010)","DOI":"10.1007\/978-3-642-11799-2_22"},{"issue":"1","key":"121_CR9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97\u2013139 (2008)","journal-title":"SIAM J. Comput."},{"key":"121_CR10","doi-asserted-by":"crossref","unstructured":"Fouque, P.A., Tibouchi, M.: Indifferentiable hashing to Barreto\u2013Naehrig curves. In: LATINCRYPT, pp. 1\u201317 (2012)","DOI":"10.1007\/978-3-642-33481-8_1"},{"key":"121_CR11","unstructured":"Galindo, D., Gro\u00dfsch\u00e4dl, J., Liu, Z., Vadnala, P.K., Vivek, S.: Implementation and evaluation of a leakage-resilient elgamal key encapsulation mechanism. Cryptology ePrint archive, report 2014\/835 (2014)"},{"key":"121_CR12","doi-asserted-by":"crossref","unstructured":"Galindo, D., Vivek, S.: A leakage-resilient pairing-based variant of the Schnorr signature scheme. In: Stam, M. (ed.) IMA International Conference, LNCS, vol. 8308, pp. 173\u2013192. Springer (2013)","DOI":"10.1007\/978-3-642-45239-0_11"},{"key":"121_CR13","doi-asserted-by":"crossref","unstructured":"Galindo, D., Vivek, S.: A practical leakage-resilient signature scheme in the generic group model. In: SAC 2012, LNCS, vol. 7707, pp. 50\u201365. Springer (2013)","DOI":"10.1007\/978-3-642-35999-6_4"},{"issue":"4","key":"121_CR14","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/j.ipl.2013.11.014","volume":"114","author":"D Galindo","year":"2014","unstructured":"Galindo, D., Vivek, S.: Limits of a conjecture on a leakage-resilient cryptosystem. Inf. Process. Lett. 114(4), 192\u2013196 (2014)","journal-title":"Inf. Process. Lett."},{"key":"121_CR15","doi-asserted-by":"crossref","unstructured":"Gandolfi, K., Mourtel, C., Olivier, F.: Electromagnetic analysis: Concrete results. In: \u00c7etin Kaya Ko\u00e7, D. Naccache, C. Paar (eds.) CHES, LNCS, vol. 2162, pp. 251\u2013261. Springer (2001)","DOI":"10.1007\/3-540-44709-1_21"},{"key":"121_CR16","doi-asserted-by":"crossref","unstructured":"Gro\u00dfsch\u00e4dl, J., Oswald, E., Page, D., Tunstall, M.: Side-channel analysis of cryptographic software via early-terminating multiplications. In: Lee, D., Hong, S. (eds.) Information Security and Cryptology\u2014ICISC 2009, LNCS, vol. 5984, pp. 176\u2013192. Springer (2010)","DOI":"10.1007\/978-3-642-14423-3_13"},{"key":"121_CR17","doi-asserted-by":"crossref","unstructured":"Icart, T.: How to hash into elliptic curves. In: CRYPTO, pp. 303\u2013316 (2009)","DOI":"10.1007\/978-3-642-03356-8_18"},{"key":"121_CR18","doi-asserted-by":"crossref","unstructured":"Kiltz, E., Pietrzak, K.: Leakage resilient ElGamal encryption. In: Abe, M. (ed.) ASIACRYPT, LNCS, vol. 6477, pp. 595\u2013612. Springer (2010)","DOI":"10.1007\/978-3-642-17373-8_34"},{"key":"121_CR19","doi-asserted-by":"crossref","unstructured":"Kiltz, E., Pietrzak, K.: Leakage resilient ElGamal encryption. Full version of [18]. http:\/\/homepage.ruhr-uni-bochum.de\/Eike.Kiltz\/papers\/elgamal_leak.pdf . Accessed 4 June 2014 (2010)","DOI":"10.1007\/978-3-642-17373-8_34"},{"key":"121_CR20","doi-asserted-by":"crossref","unstructured":"Kocher, P.C.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In: Koblitz, N. (ed.) CRYPTO, LNCS, vol. 1109, pp. 104\u2013113. Springer (1996)","DOI":"10.1007\/3-540-68697-5_9"},{"key":"121_CR21","doi-asserted-by":"crossref","unstructured":"Kocher, P.C., Jaffe, J., Jun, B.: Differential power analysis. In: Wiener, M.J. (ed.) CRYPTO, LNCS, vol. 1666, pp. 388\u2013397. Springer (1999)","DOI":"10.1007\/3-540-48405-1_25"},{"key":"121_CR22","doi-asserted-by":"crossref","unstructured":"Micali, S., Reyzin, L.: Physically observable cryptography (extended abstract). In: Naor, M. (ed.) TCC, LNCS, vol. 2951, pp. 278\u2013296. Springer (2004)","DOI":"10.1007\/978-3-540-24638-1_16"},{"issue":"170","key":"121_CR23","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"PL Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44(170), 519\u2013521 (1985)","journal-title":"Math. Comput."},{"key":"121_CR24","doi-asserted-by":"crossref","unstructured":"Moradi, A.: Statistical tools flavor side-channel collision attacks. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT, LNCS, vol. 7237, pp. 428\u2013445. Springer (2012)","DOI":"10.1007\/978-3-642-29011-4_26"},{"key":"121_CR25","first-page":"283","volume":"2004","author":"D Page","year":"2004","unstructured":"Page, D., Vercauteren, F.: Fault and side-channel attacks on pairing based cryptography. IACR Cryptol. ePrint Arch. 2004, 283 (2004)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"8","key":"121_CR26","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.1016\/j.jss.2011.03.083","volume":"84","author":"GC Pereira","year":"2011","unstructured":"Pereira, G.C., Simpl\u00edcio, M.A., Naehrig, M., Barreto, P.S.: A family of implementation-friendly BN elliptic curves. J. Syst. Softw. 84(8), 1319\u20131326 (2011)","journal-title":"J. Syst. Softw."},{"key":"121_CR27","doi-asserted-by":"crossref","unstructured":"Prouff, E., Rivain, M.: Masking against side-channel attacks: a formal security proof. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT, LNCS, vol. 7881, pp. 142\u2013159. Springer (2013)","DOI":"10.1007\/978-3-642-38348-9_9"},{"issue":"4","key":"121_CR28","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"JT Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27(4), 701\u2013717 (1980)","journal-title":"J. ACM"},{"key":"121_CR29","doi-asserted-by":"crossref","unstructured":"Scott, M.: Computing the tate pairing. In: Menezes, A. (ed.) CT-RSA, LNCS, vol. 3376, pp. 293\u2013304. Springer (2005)","DOI":"10.1007\/978-3-540-30574-3_20"},{"key":"121_CR30","doi-asserted-by":"crossref","unstructured":"Shallue, A., van de Woestijne, C.: Construction of rational points on elliptic curves over finite fields. In: Hess, F., Pauli, S., Pohst, M.E. (eds.) ANTS, LNCS, vol. 4076, pp. 510\u2013524. Springer (2006)","DOI":"10.1007\/11792086_36"},{"key":"121_CR31","doi-asserted-by":"crossref","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT, LNCS, vol. 1233, pp. 256\u2013266. Springer (1997)","DOI":"10.1007\/3-540-69053-0_18"},{"key":"121_CR32","doi-asserted-by":"crossref","unstructured":"Standaert, F.X., Pereira, O., Yu, Y.: Leakage-resilient symmetric cryptography under empirically verifiable assumptions. In: Canetti, R., Garay, J.A. (eds.) CRYPTO (1), LNCS, vol. 8042, pp. 335\u2013352. Springer (2013)","DOI":"10.1007\/978-3-642-40041-4_19"},{"key":"121_CR33","doi-asserted-by":"crossref","unstructured":"Stebila, D., Th\u00e9riault, N.: Unified point addition formul\u00e6 and side-channel attacks. In: Goubin, L., Matsui, M. (eds.) Cryptographic Hardware and Embedded Systems\u2014CHES 2006, LNCS, vol. 4249, pp. 354\u2013368. Springer (2006)","DOI":"10.1007\/11894063_28"},{"key":"121_CR34","unstructured":"Tibouchi, M.: A note on hashing to bn curves. In: 29th Japanese Symposium on Cryptography and Information Security\u2014SCIS 2012. http:\/\/www.normalesup.org\/~tibouchi\/papers\/bnhash-scis.pdf (2012). Accessed 27 Feb 2016"},{"key":"121_CR35","doi-asserted-by":"crossref","unstructured":"Walter, C.D.: Simple power analysis of unified code for ECC double and add. In: Joye, M., Quisquater, J.J. (eds.) Cryptographic Hardware and Embedded Systems\u2014CHES 2004, LNCS, vol. 3156, pp. 191\u2013204. Springer (2004)","DOI":"10.1007\/978-3-540-28632-5_14"},{"key":"121_CR36","doi-asserted-by":"crossref","unstructured":"Walter, C.D., Thompson, S.: Distinguishing exponent digits by observing modular subtractions. In: Naccache, D. (ed.) Topics in Cryptology\u2014CT-RSA 2001, LNCS, vol. 2020, pp. 192\u2013207. Springer (2001)","DOI":"10.1007\/3-540-45353-9_15"},{"key":"121_CR37","doi-asserted-by":"crossref","unstructured":"Whelan, C., Scott, M.: Side channel analysis of practical pairing implementations: Which path is more secure? In: Nguyen, P.Q. (ed.) VIETCRYPT, LNCS, vol. 4341, pp. 99\u2013114. Springer (2006)","DOI":"10.1007\/11958239_7"},{"key":"121_CR38","doi-asserted-by":"crossref","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, E.W. (ed.) EUROSAM, LNCS, vol. 72, pp. 216\u2013226. Springer (1979)","DOI":"10.1007\/3-540-09519-5_73"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-016-0121-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13389-016-0121-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-016-0121-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,5]],"date-time":"2022-06-05T19:58:42Z","timestamp":1654459122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13389-016-0121-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,29]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["121"],"URL":"https:\/\/doi.org\/10.1007\/s13389-016-0121-x","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"value":"2190-8508","type":"print"},{"value":"2190-8516","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,29]]}}}