{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,19]],"date-time":"2026-09-19T23:51:47Z","timestamp":1789861907999,"version":"4.0.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,5,30]],"date-time":"2016-05-30T00:00:00Z","timestamp":1464566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ANR","award":["ARRAND"],"award-info":[{"award-number":["ARRAND"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,5,30]]},"DOI":"10.1145\/2897845.2897907","type":"proceedings-article","created":{"date-parts":[[2016,5,27]],"date-time":"2016-05-27T12:37:36Z","timestamp":1464352656000},"page":"641-650","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Fault Attacks on Efficient Pairing Implementations"],"prefix":"10.1145","author":[{"given":"Pierre-Alain","family":"Fouque","sequence":"first","affiliation":[{"name":"Universit\u00e9 Rennes, Rennes, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen","family":"Qian","sequence":"additional","affiliation":[{"name":"Ecole normale sup\u00e9rieure de Rennes, Rennes, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,5,30]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Workshop on Fault Diagnosis and Tolerance in Cryptography, FDTC 2014","year":"2014","unstructured":"2014 Workshop on Fault Diagnosis and Tolerance in Cryptography, FDTC 2014 , Busan, South Korea , September 23, 2014 . IEEE, 2014. 2014 Workshop on Fault Diagnosis and Tolerance in Cryptography, FDTC 2014, Busan, South Korea, September 23, 2014. IEEE, 2014."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-006-9033-6"},{"key":"e_1_3_2_1_3_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/3-540-45708-9_23","volume-title":"Ben Lynn, and Michael Scott. Efficient Algorithms for Pairing-Based Cryptosystems","author":"Barreto Paulo S. L. M.","year":"2002","unstructured":"Paulo S. L. M. Barreto , Hae Yong Kim , Ben Lynn, and Michael Scott. Efficient Algorithms for Pairing-Based Cryptosystems . In Moti Yung, editor, Advances in Cryptology - CRYPTO 2002 , 22nd Annual International Cryptology Conference, Santa Barbara, California, USA, August 18--22, 2002, Proceedings, volume 2442 of Lecture Notes in Computer Science , pages 354 -- 368 . Springer , 2002. Paulo S. L. M. Barreto, Hae Yong Kim, Ben Lynn, and Michael Scott. Efficient Algorithms for Pairing-Based Cryptosystems. In Moti Yung, editor, Advances in Cryptology - CRYPTO 2002, 22nd Annual International Cryptology Conference, Santa Barbara, California, USA, August 18--22, 2002, Proceedings, volume 2442 of Lecture Notes in Computer Science, pages 354--368. Springer, 2002."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11693383_22"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FDTC.2014.22"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1346796.1346799"},{"key":"e_1_3_2_1_7_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Rafail Ostrovsky, and Giuseppe Persiano. Public Key Encryption with Keyword Search","author":"Boneh Dan","year":"2004","unstructured":"Dan Boneh , Giovanni Di Crescenzo , Rafail Ostrovsky, and Giuseppe Persiano. Public Key Encryption with Keyword Search . In Christian Cachin and Jan Camenisch, editors, Advances in Cryptology - EUROCRYPT 2004 , International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2--6, 2004, Proceedings, volume 3027 of Lecture Notes in Computer Science , pages 506 -- 522 . Springer , 2004. Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky, and Giuseppe Persiano. Public Key Encryption with Keyword Search. In Christian Cachin and Jan Camenisch, editors, Advances in Cryptology - EUROCRYPT 2004, International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2--6, 2004, Proceedings, volume 3027 of Lecture Notes in Computer Science, pages 506--522. Springer, 2004."},{"key":"e_1_3_2_1_8_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology - CRYPTO","author":"Boneh Dan","year":"2001","unstructured":"Dan Boneh and Matthew K. Franklin . Identity-Based Encryption from the Weil Pairing . In Joe Kilian, editor, Advances in Cryptology - CRYPTO 2001 , 21st Annual International Cryptology Conference, Santa Barbara , California, USA, August 19--23, 2001, Proceedings, volume 2139 of Lecture Notes in Computer Science , pages 213 -- 229 . Springer , 2001. Dan Boneh and Matthew K. Franklin. Identity-Based Encryption from the Weil Pairing. In Joe Kilian, editor, Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19--23, 2001, Proceedings, volume 2139 of Lecture Notes in Computer Science, pages 213--229. Springer, 2001."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455834"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11496618_13"},{"key":"e_1_3_2_1_11_1","first-page":"197","volume-title":"Takagi et al.citeDBLP:conf\/pairing\/2007","author":"Devegili Augusto Jun","unstructured":"Augusto Jun Devegili , Michael Scott , and Ricardo Dahab . Implementing Cryptographic Pairings over Barreto-Naehrig Curves . In Takagi et al.citeDBLP:conf\/pairing\/2007 , pages 197 -- 207 . Augusto Jun Devegili, Michael Scott, and Ricardo Dahab. Implementing Cryptographic Pairings over Barreto-Naehrig Curves. In Takagi et al.citeDBLP:conf\/pairing\/2007, pages 197--207."},{"key":"e_1_3_2_1_12_1","series-title":"Lecture Notes in Computer Science","first-page":"111","volume-title":"Advances in Cryptology - ASIACRYPT","author":"Iwan","year":"2003","unstructured":"Iwan M. Duursma and Hyang-Sook Lee. Tate Pairing Implementation for Hyperelliptic Curves y^2 = x^p-x+d . In Chi-Sung Laih, editor, Advances in Cryptology - ASIACRYPT 2003 , 9th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, November 30 - December 4, 2003, Proceedings, volume 2894 of Lecture Notes in Computer Science , pages 111 -- 123 . Springer , 2003. Iwan M. Duursma and Hyang-Sook Lee. Tate Pairing Implementation for Hyperelliptic Curves y^2 = x^p-x+d. In Chi-Sung Laih, editor, Advances in Cryptology - ASIACRYPT 2003, 9th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, November 30 - December 4, 2003, Proceedings, volume 2894 of Lecture Notes in Computer Science, pages 111--123. Springer, 2003."},{"key":"e_1_3_2_1_13_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/3-540-45455-1_26","volume-title":"Algorithmic Number Theory, 5th International Symposium, ANTS-V","author":"Galbraith Steven D.","year":"2002","unstructured":"Steven D. Galbraith , Keith Harrison , and David Soldera . Implementing the Tate Pairing . In Claus Fieker and David R. Kohel, editors, Algorithmic Number Theory, 5th International Symposium, ANTS-V , Sydney, Australia , July 7--12, 2002 , Proceedings, volume 2369 of Lecture Notes in Computer Science , pages 324 -- 337 . Springer , 2002. Steven D. Galbraith, Keith Harrison, and David Soldera. Implementing the Tate Pairing. In Claus Fieker and David R. Kohel, editors, Algorithmic Number Theory, 5th International Symposium, ANTS-V, Sydney, Australia, July 7--12, 2002, Proceedings, volume 2369 of Lecture Notes in Computer Science, pages 324--337. Springer, 2002."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006431"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1112\/S1461157000001194"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881709"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-004-0312-y"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40349-1_21"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FDTC.2014.21"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.259647"},{"key":"e_1_3_2_1_21_1","volume-title":"Short programs for functions on curves. Technical report","author":"Miller Victor","year":"1986","unstructured":"Victor Miller . Short programs for functions on curves. Technical report , 1986 . Victor Miller. Short programs for functions on curves. Technical report, 1986."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-004-0315-8"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02617-1_13"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-014-0114-5"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/978-3-642-29656-7_13","volume-title":"Fault Analysis in Cryptography, Information Security and Cryptography","author":"Mrabet Nadia El","year":"2012","unstructured":"Nadia El Mrabet , Dan Page , and Frederik Vercauteren . Fault Attacks on Pairing-Based Cryptography . In Marc Joye and Michael Tunstall, editors, Fault Analysis in Cryptography, Information Security and Cryptography , pages 221 -- 236 . Springer , 2012 . Nadia El Mrabet, Dan Page, and Frederik Vercauteren. Fault Attacks on Pairing-Based Cryptography. In Marc Joye and Michael Tunstall, editors, Fault Analysis in Cryptography, Information Security and Cryptography, pages 221--236. Springer, 2012."},{"key":"e_1_3_2_1_26_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/978-3-540-68164-9_25","volume-title":"Progress in Cryptology - AFRICACRYPT","author":"Naehrig Michael","year":"2008","unstructured":"Michael Naehrig , Paulo S. L. M. Barreto , and Peter Schwabe . On Compressible Pairings and Their Computation . In Serge Vaudenay, editor, Progress in Cryptology - AFRICACRYPT 2008 , First International Conference on Cryptology in Africa, Casablanca, Morocco, June 11--14, 2008. Proceedings, volume 5023 of Lecture Notes in Computer Science , pages 371 -- 388 . Springer , 2008. Michael Naehrig, Paulo S. L. M. Barreto, and Peter Schwabe. On Compressible Pairings and Their Computation. In Serge Vaudenay, editor, Progress in Cryptology - AFRICACRYPT 2008, First International Conference on Cryptology in Africa, Casablanca, Morocco, June 11--14, 2008. Proceedings, volume 5023 of Lecture Notes in Computer Science, pages 371--388. Springer, 2008."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2006.134"},{"key":"e_1_3_2_1_28_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/978-3-540-28628-8_9","volume-title":"Advances in Cryptology - CRYPTO","author":"Scott Michael","year":"2004","unstructured":"Michael Scott and Paulo S. L. M. Barreto . Compressed pairings . In Matthew K. Franklin, editor, Advances in Cryptology - CRYPTO 2004 , 24th Annual International Cryptology Conference, Santa Barbara , California, USA, August 15--19, 2004, Proceedings, volume 3152 of Lecture Notes in Computer Science , pages 140 -- 156 . Springer , 2004. Michael Scott and Paulo S. L. M. Barreto. Compressed pairings. In Matthew K. Franklin, editor, Advances in Cryptology - CRYPTO 2004, 24th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15--19, 2004, Proceedings, volume 3152 of Lecture Notes in Computer Science, pages 140--156. Springer, 2004."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03298-1_6"},{"key":"e_1_3_2_1_30_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-73489-5","volume-title":"Pairing-Based Cryptography - Pairing","author":"Takagi Tsuyoshi","year":"2007","unstructured":"Tsuyoshi Takagi , Tatsuaki Okamoto , Eiji Okamoto , and Takeshi Okamoto , editors. Pairing-Based Cryptography - Pairing 2007 , First International Conference, Tokyo, Japan, July 2--4, 2007, Proceedings, volume 4575 of Lecture Notes in Computer Science . Springer , 2007. Tsuyoshi Takagi, Tatsuaki Okamoto, Eiji Okamoto, and Takeshi Okamoto, editors. Pairing-Based Cryptography - Pairing 2007, First International Conference, Tokyo, Japan, July 2--4, 2007, Proceedings, volume 4575 of Lecture Notes in Computer Science. Springer, 2007."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034881"},{"key":"e_1_3_2_1_32_1","first-page":"225","volume-title":"Takagi et al.citeDBLP:conf\/pairing\/2007","author":"Whelan Claire","unstructured":"Claire Whelan and Michael Scott . The importance of the final exponentiation in pairings when considering fault attacks . In Takagi et al.citeDBLP:conf\/pairing\/2007 , pages 225 -- 246 . Claire Whelan and Michael Scott. The importance of the final exponentiation in pairings when considering fault attacks. In Takagi et al.citeDBLP:conf\/pairing\/2007, pages 225--246."}],"event":{"name":"ASIA CCS '16: ACM Asia Conference on Computer and Communications Security","location":"Xi'an China","acronym":"ASIA CCS '16","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897845.2897907","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2897845.2897907","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:01Z","timestamp":1750223221000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897845.2897907"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,30]]},"references-count":32,"alternative-id":["10.1145\/2897845.2897907","10.1145\/2897845"],"URL":"https:\/\/doi.org\/10.1145\/2897845.2897907","relation":{},"subject":[],"published":{"date-parts":[[2016,5,30]]},"assertion":[{"value":"2016-05-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}