| 2026 | LREC | A Sociophonetic Analysis of Racial Bias in Commercial ASR Systems Using the Pacific Northwest English Corpus. | Michael Scott, Siyu Liang, Alicia Beckford Wassink, Gina-Anne Levow |
| 2024 | IWINAC | Multicenter Prospective Blind External Validation of a Machine Learning Model for Predicting Heart Failure Decompensation: A 3-Hospital Validation Study. | Jon Kerexeta, Esperana Llad Pascual, Cristina Martin, Nicola Goodfellow, Karina Anahi Ojanguren Carreira, Marco Manso, Barbara Guerra, Ladislav Stanke, Vohralk Toms, Esteban Fabello, Tatiana Silva, Michael Scott, Glenda Fleming, Andoni Beristain, Manuel Graa |
| 2019 | ITiCSE | Laughter over Dread: Early Collaborative Problem Solving through an Extended Induction using Robots. | Mark Zarb, Michael Scott |
| 2018 | WAIFI | A New Family of Pairing-Friendly Elliptic Curves. | Michael Scott, Aurore Guillevic |
| 2015 | PKC | Faster ECC over \mathbb F_2^521-1. | Robert Granger, Michael Scott |
| 2011 | SIGCSE | Nifty assignments. | Nick Parlante, Julie Zelenski, Keith Schwarz, Dave Feinberg, Michelle Craig, Stuart Hansen, Michael Scott, David J. Malan |
| 2010 | CARDIS | Secure Delegation of Elliptic-Curve Pairing. | Benot Chevallier-Mames, Jean-Sbastien Coron, Noel McCullagh, David Naccache, Michael Scott |
| 2010 | Pairing | Designing a Code Generator for Pairing Based Cryptographic Functions. | Luis J. Dominguez Perez, Michael Scott |
| 2010 | PKC | Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions. | Robert Granger, Michael Scott |
| 2010 | WAIFI | Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography. | Naomi Benger, Michael Scott |
| 2009 | EuroCrypt | Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves. | Steven D. Galbraith, Xibin Lin, Michael Scott |
| 2009 | Pairing | On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves. | Michael Scott, Naomi Benger, Manuel Charlemagne, Luis J. Dominguez Perez, Ezekiel J. Kachisa |
| 2009 | Pairing | Fast Hashing to | Michael Scott, Naomi Benger, Manuel Charlemagne, Luis J. Dominguez Perez, Ezekiel J. Kachisa |
| 2008 | EWSN | NanoECC: Testing the Limits of Elliptic Curve Cryptography in Sensor Networks. | Piotr Szczechowiak, Leonardo B. Oliveira, Michael Scott, Martin Collier, Ricardo Dahab |
| 2008 | Pairing | Exponentiation in Pairing-Friendly Groups Using Homomorphisms. | Steven D. Galbraith, Michael Scott |
| 2008 | Pairing | Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field. | Ezekiel J. Kachisa, Edward F. Schaefer, Michael Scott |
| 2007 | Pairing | Implementing Cryptographic Pairings over Barreto-Naehrig Curves. | Augusto Jun Devegili, Michael Scott, Ricardo Dahab |
| 2007 | Pairing | The Importance of the Final Exponentiation in Pairings When Considering Fault Attacks. | Claire Whelan, Michael Scott |
| 2006 | CHES | Implementing Cryptographic Pairings on Smartcards. | Michael Scott, Neil Costigan, Wesam Abdulwahab |
| 2005 | INDOCRYPT | Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism. | Michael Scott |
| 2004 | CRYPTO | Compressed Pairings. | Michael Scott, Paulo S. L. M. Barreto |
| 2002 | CRYPTO | Efficient Algorithms for Pairing-Based Cryptosystems. | Paulo S. L. M. Barreto, Hae Yong Kim, Ben Lynn, Michael Scott |
| 2002 | SCN | Constructing Elliptic Curves with Prescribed Embedding Degrees. | Paulo S. L. M. Barreto, Ben Lynn, Michael Scott |