{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T16:00:20Z","timestamp":1726070420664},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030420673"},{"type":"electronic","value":"9783030420680"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-42068-0_2","type":"book-chapter","created":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T00:02:15Z","timestamp":1583712135000},"page":"20-39","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimized Threshold Implementations: Minimizing the Latency of Secure Cryptographic Accelerators"],"prefix":"10.1007","author":[{"given":"Du\u0161an","family":"Bo\u017eilov","sequence":"first","affiliation":[]},{"given":"Miroslav","family":"Kne\u017eevi\u0107","sequence":"additional","affiliation":[]},{"given":"Ventzislav","family":"Nikov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,9]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-662-48800-3_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"S Banik","year":"2015","unstructured":"Banik, S., et al.: Midori: a block cipher for low energy. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9453, pp. 411\u2013436. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_17"},{"key":"2_CR2","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Assche, G.V.: The Keccak reference, January 2011. http:\/\/keccak.noekeon.org\/"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-662-45608-8_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"B Bilgin","year":"2014","unstructured":"Bilgin, B., Gierlichs, B., Nikova, S., Nikov, V., Rijmen, V.: Higher-order threshold implementations. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 326\u2013343. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_18"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-33027-8_5","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2012","author":"B Bilgin","year":"2012","unstructured":"Bilgin, B., Nikova, S., Nikov, V., Rijmen, V., St\u00fctz, G.: Threshold implementations of all $$3 \\times 3$$ and $$4 \\times 4$$ S-boxes. In: Prouff, E., Schaumont, P. (eds.) CHES 2012. LNCS, vol. 7428, pp. 76\u201391. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33027-8_5"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-540-74735-2_31","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2007","author":"A Bogdanov","year":"2007","unstructured":"Bogdanov, A., et al.: PRESENT: an ultra-lightweight block cipher. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol. 4727, pp. 450\u2013466. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74735-2_31"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-34961-4_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"J Borghoff","year":"2012","unstructured":"Borghoff, J., et al.: PRINCE \u2013 a low-latency block cipher for pervasive computing applications. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 208\u2013225. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_14"},{"key":"2_CR7","unstructured":"Cooper, J., DeMulder, E., Goodwill, G., Jaffe, J., Kenworthy, G., Rohatgi, P.: Test Vector Leakage Assessment (TVLA) methodology in practice. In: International Cryptographic Module Conference (2013)"},{"key":"2_CR8","first-page":"1","volume":"2","author":"H Gro\u00df","year":"2018","unstructured":"Gro\u00df, H., Iusupov, R., Bloem, R.: Generic low-latency masking in hardware. IACR Trans. Cryptogr. Hardw. Embed. Syst.-TCHES 2, 1\u201321 (2018)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst.-TCHES"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-66787-4_6","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2017","author":"H Gross","year":"2017","unstructured":"Gross, H., Mangard, S.: Reconciling $$d+1$$ masking in hardware and software. In: Fischer, W., Homma, N. (eds.) CHES 2017. LNCS, vol. 10529, pp. 115\u2013136. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66787-4_6"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Gro\u00df, H., Mangard, S., Korak, T.: Domain-oriented masking: compact masked hardware implementations with arbitrary protection order. In: Proceedings of the ACM Workshop on Theory of Implementation Security, TIS@CCS 2016, Vienna, Austria, p. 3, October 2016","DOI":"10.1145\/2996366.2996426"},{"key":"2_CR11","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. 2729, pp. 463\u2013481. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_27"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-642-33027-8_25","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2012","author":"M Kne\u017eevi\u0107","year":"2012","unstructured":"Kne\u017eevi\u0107, M., Nikov, V., Rombouts, P.: Low-latency encryption \u2013 is \u201cLightweight = Light + Wait\u201d? In: Prouff, E., Schaumont, P. (eds.) CHES 2012. LNCS, vol. 7428, pp. 426\u2013446. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33027-8_25"},{"key":"2_CR13","doi-asserted-by":"crossref","first-page":"256","DOI":"10.46586\/tches.v2019.i2.256-292","volume":"2","author":"T Moos","year":"2019","unstructured":"Moos, T., Moradi, A., Schneider, T., Standaert, F.X.: Glitch-resistant masking revisited - or why proofs in the robust probing model are needed. IACR Trans. Cryptogr. Hardw. Embed. Syst.-TCHES 2, 256\u2013292 (2019)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst.-TCHES"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-662-53887-6_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"A Moradi","year":"2016","unstructured":"Moradi, A., Schneider, T.: Side-channel analysis protection and low-latency in action. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 517\u2013547. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_19"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/11935308_38","volume-title":"Information and Communications Security","author":"S Nikova","year":"2006","unstructured":"Nikova, S., Rechberger, C., Rijmen, V.: Threshold Implementations against side-channel attacks and glitches. In: Ning, P., Qing, S., Li, N. (eds.) ICICS 2006. LNCS, vol. 4307, pp. 529\u2013545. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11935308_38"},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/s00145-010-9086-6","volume":"24","author":"Axel Poschmann","year":"2010","unstructured":"Poschmann, A., Moradi, A., Khoo, K., Lim, C.W., Wang, H., Ling, S.: Side-channel resistant crypto for less than 2,300 GE. J. Cryptol. 24(2), 322\u2013345 (2011). https:\/\/doi.org\/10.1007\/s00145-010-9086-6","journal-title":"Journal of Cryptology"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1007\/978-3-662-47989-6_37","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"O Reparaz","year":"2015","unstructured":"Reparaz, O., Bilgin, B., Nikova, S., Gierlichs, B., Verbauwhede, I.: Consolidating masking schemes. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 764\u2013783. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_37"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-319-66787-4_19","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2017","author":"O Reparaz","year":"2017","unstructured":"Reparaz, O., Gierlichs, B., Verbauwhede, I.: Fast leakage assessment. In: Fischer, W., Homma, N. (eds.) CHES 2017. LNCS, vol. 10529, pp. 387\u2013399. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66787-4_19"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Ueno, R., Homma, N., Aoki, T.: A systematic design of tamper-resistant Galois-field arithmetic circuits based on threshold implementation with (d\u00a0+\u00a01) input shares. In: 2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL), pp. 136\u2013141 (2017)","DOI":"10.1109\/ISMVL.2017.35"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-319-64647-3_4","volume-title":"Constructive Side-Channel Analysis and Secure Design","author":"R Ueno","year":"2017","unstructured":"Ueno, R., Homma, N., Aoki, T.: Toward more efficient DPA-resistant AES hardware architecture based on threshold implementation. In: Guilley, S. (ed.) COSADE 2017. LNCS, vol. 10348, pp. 50\u201364. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-64647-3_4"}],"container-title":["Lecture Notes in Computer Science","Smart Card Research and Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-42068-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,3]],"date-time":"2021-03-03T03:07:11Z","timestamp":1614740831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-42068-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030420673","9783030420680"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-42068-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CARDIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Smart Card Research and Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cardis2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cardis2019.fit.cvut.cz\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}