Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Michael Scott

dblp:s/MichaelScott · DBLP profile ↗
← Back
35ranked-venue papers
11as first author
3since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 23 · 9 first-author · 1 since 2021Systems, architecture and hardware · 2Human-computer interaction and ubiquitous computing · 2Theory of computation · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 1 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Computer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
8 papers
Systems and software security · 70% Cryptographic primitives and cryptanalysis · 30%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Embedded and real-time systems · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

Topics — the 9 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Systems and software security › vulnerability discovery › fuzzing
embedded OS fuzzing
0.812024
Fuzzing BusyBox: Leveraging LLM and Crash Reuse for Embedded Bug Unearthing · USENIX Security Symposium 2024
Systems and software security
vulnerability discovery
0.812024
Fuzzing BusyBox: Leveraging LLM and Crash Reuse for Embedded Bug Unearthing · USENIX Security Symposium 2024
Cryptographic primitives and cryptanalysis › public-key cryptography
elliptic curve cryptography
0.332011
Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves · J. Cryptol. 2011
A Taxonomy of Pairing-Friendly Elliptic Curves · J. Cryptol. 2010
Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves · EUROCRYPT 2009
Cryptographic primitives and cryptanalysis
pairing-based cryptography
0.242006
Implementing Cryptographic Pairings on Smartcards · CHES 2006
Efficient Implementation of Pairing-Based Cryptosystems · J. Cryptol. 2004
Compressed Pairings · CRYPTO 2004
Cryptographic primitives and cryptanalysis › public-key cryptography › elliptic curve cryptography
pairing-friendly curves
0.112010
A Taxonomy of Pairing-Friendly Elliptic Curves · J. Cryptol. 2010
Medical and health informatics › medical imaging
molecular imaging
0.112008
Perfluorocarbon Nanoparticles for Molecular Imaging and Targeted Therapeutics · Proc. IEEE 2008
Cryptographic primitives and cryptanalysis › pairing-based cryptography
pairing computation
0.012002
Efficient Algorithms for Pairing-Based Cryptosystems · CRYPTO 2002
Medical and health informatics
drug delivery
0.012008
Perfluorocarbon Nanoparticles for Molecular Imaging and Targeted Therapeutics · Proc. IEEE 2008
Embedded and real-time systems › resource-constrained systems
smart card
0.012006
Implementing Cryptographic Pairings on Smartcards · CHES 2006

Methods — techniques the papers use, named apart from their topics

large language model · 1.5fuzzing · 1.5crash reuse · 1.5endomorphisms · 0.1GLV method · 0.1ultrasound imaging · 0.1single photon emission computed tomography · 0.1positron emission tomography · 0.1perfluorocarbon nanoparticle platform · 0.1magnetic resonance imaging · 0.1pairing-based cryptography · 0.0
YearPublicationVenuePosition
2026 A Sociophonetic Analysis of Racial Bias in Commercial ASR Systems Using the Pacific Northwest English Corpus
Michael Scott, Alicia Beckford Wassink, Gina-Anne Levow
LREC1
2024 Fuzzing BusyBox: Leveraging LLM and Crash Reuse for Embedded Bug Unearthing
Asmita 0001, Yaroslav Oliinyk, Michael Scott, Ryan Tsang, Chongzhou Fang, Houman Homayoun
USENIX Security Symposium3
2021 Divergence-Free Constrained Phase Unwrapping and Denoising for 4D Flow MRI Using Weighted Least-Squares
abstract
A novel divergence-free constrained phase unwrapping method was proposed and evaluated for 4D flow MRI. The unwrapped phase field was obtained by integrating the phase variations estimated from the wrapped phase data using weighted least-squares. The divergence-free constraint for incompressible blood flow was incorporated to regulate and denoise the resulting phase field. The proposed method was tested on synthetic phase data of left ventricular flow and in vitro 4D flow measurement of Poiseuille flow. The method was additionally applied to in vivo 4D flow measurements in the thoracic aorta from 30 human subjects. The performance of the proposed method was compared to the state-of-the-art 4D single-step Laplacian algorithm. The synthetic phase data were completely unwrapped by the proposed method for all the cases with velocity encoding (venc) as low as 20% of the maximum velocity and signal-to-noise ratio as low as 5. The in vitro Poiseuille flow data were completely unwrapped with a 60% increase in the velocity-to-noise ratio. For the in-vivo aortic datasets with venc ratio less than 0.4, the proposed method significantly improved the success rate by as much as 40% and reduced the velocity error levels by a factor of 10 compared to the state-of-the-art method. The divergence-free constrained method exhibits reliability and robustness on phase unwrapping and shows improved accuracy of velocity and hemodynamic quantities by unwrapping the low-venc 4D flow MRI data.
Sean Rothenberger, Melissa C. Brindise, Michael Scott, Haben Berhane, Justin J. Baraboo, Michael Markl 0001, Vitaliy L. Rayz, Pavlos P. Vlachos
IEEE Trans. Medical Imaging4
2019 Laughter over Dread: Early Collaborative Problem Solving through an Extended Induction using Robots
abstract
Software development companies want new hires with strong interpersonal and problem solving skills. To ensure the development of such skills, they must be embedded throughout the curriculum. However, many students struggle to collaborate with peers and in self-regulated practice during the early stages of their course. Explicit scaffolding can, however, motivate such engagement. This tips and techniques session shows how an ice-breaker using LEGO EV3 robots at two UK institutions enhanced peer interaction and increased self-regulated practice over the first four weeks of 2016-17 and 2017-18.
Mark Zarb, Michael Scott
ITiCSE2
2019 Visual analysis of regional myocardial motion anomalies in longitudinal studies
Ali Sheharyar, Alexander Ruh, Maria Aristova, Michael Scott, Kelly Jarvis, Mohammed S. M. ElBaz, Ryan Dolan, Susanne Schnell, James Carr, Michael Markl 0001, Othmane Bouhali, Lars Linsen
Comput. Graph.4
2018 A New Family of Pairing-Friendly Elliptic Curves
Michael Scott, Aurore Guillevic
WAIFI1
2017 A Note on the Implementation of the Number Theoretic Transform
Michael Scott
IMACC1
2011 On the Efficient Implementation of Pairing-Based Protocols
Michael Scott
IMACC1
2011 Nifty assignments
abstract
I worry over topics for the syllabus, fretting over demos and presentations. And yet, I always come back to the fact that most of what my students learn and remember from my course comes from the assignments. Great assignments are hard to dream up and time-consuming to develop. With that in mind, the Nifty Assignments session is all about promoting and sharing the ideas and concrete materials of successful assignments.
Nick Parlante, Julie Zelenski, Keith Schwarz, Dave Feinberg, Michelle Craig, Stuart A. Hansen, Michael Scott, David J. Malan
SIGCSE7
2011 TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks
Leonardo B. Oliveira, Diego F. Aranha, Conrado Porto Lopes Gouvêa, Michael Scott, Danilo F. Câmara, Julio López 0002, Ricardo Dahab
Comput. Commun.4
2011 Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
Steven D. Galbraith, Xibin Lin, Michael Scott
J. Cryptol.3
2010 Secure Delegation of Elliptic-Curve Pairing
Benoît Chevallier-Mames, Jean-Sébastien Coron, Noel McCullagh, David Naccache, Michael Scott
CARDIS5
2010 Designing a Code Generator for Pairing Based Cryptographic Functions
Luis J. Dominguez Perez, Michael Scott
Pairing2
2010 Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography
Naomi Benger, Michael Scott
WAIFI2
2010 A Taxonomy of Pairing-Friendly Elliptic Curves
abstract
Elliptic curves with small embedding degree and large prime-order subgroup are key ingredients for implementing pairing-based cryptographic systems. Such “pairing-friendly” curves are rare and thus require specific constructions. In this paper we give a single coherent framework that encompasses all of the constructions of pairing-friendly elliptic curves currently existing in the literature. We also include new constructions of pairing-friendly curves that improve on the previously known constructions for certain embedding degrees. Finally, for all embedding degrees up to 50, we provide recommendations as to which pairing-friendly curves to choose to best satisfy a variety of performance and security requirements.
David Mandell Freeman, Michael Scott, Edlyn Teske
J. Cryptol.2
2009 Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
Steven D. Galbraith, Xibin Lin, Michael Scott
EUROCRYPT3
2009 On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
Michael Scott, Naomi Benger, Manuel Charlemagne, Luis J. Dominguez Perez, Ezekiel J. Kachisa
Pairing1
2009 Fast Hashing to G2 on Pairing-Friendly Curves
Michael Scott, Naomi Benger, Manuel Charlemagne, Luis J. Dominguez Perez, Ezekiel J. Kachisa
Pairing1
2009 On the application of pairing based cryptography to wireless sensor networks
abstract
Recent research results have shown that Elliptic Curve Cryptography (ECC) is feasible on resource constrained sensor nodes. In this work we demonstrate that the related but more complex primitives of Pairing Based Cryptography(PBC) are also well suited for sensor devices.We present the first in-depth study on the application and implementation of PBC to Wireless Sensor Networks (WSNs). Our implementations are all the fastest yet reported, and have been implemented across a range of WSN processors. On a system level we investigate the application of a simple non-interactive key exchange scheme that is particularly suitable for many WSN scenarios. We also present a novel variant of the key exchange protocol which can be useful in even more demanding applications, and which partially solves the problem of node compromise attacks.
Piotr Szczechowiak, Anton Kargl, Michael Scott, Martin Collier
WISEC3
2008 NanoECC: Testing the Limits of Elliptic Curve Cryptography in Sensor Networks
Piotr Szczechowiak, Leonardo B. Oliveira, Michael Scott, Martin Collier, Ricardo Dahab
EWSN3
2008 Exponentiation in Pairing-Friendly Groups Using Homomorphisms
Steven D. Galbraith, Michael Scott
Pairing2
2008 Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
Ezekiel J. Kachisa, Edward F. Schaefer, Michael Scott
Pairing3
2008 Perfluorocarbon Nanoparticles for Molecular Imaging and Targeted Therapeutics
abstract
Molecular imaging is a novel tool that has allowed noninvasive diagnostic imaging to transition from gross anatomical description to identification of specific tissue epitopes and observation of biological processes at the cellular level. Until recently, this technique was confined to the field of nuclear imaging; however, advances in nanotechnology have extended this research to include magnetic resonance (MR) imaging, positron emission tomography (PET), single photon emission computed tomography (SPECT), and ultrasound (US), among others. The application of nanotechnology to MR, SPECT, and US molecular imaging has generated several candidate contrast agents. We discuss the application of one multimodality platform, a targeted perfluorocarbon nanoparticle. Our results show that it is useful for noninvasive detection with all three imaging modalities and may additionally be used for local drug delivery.
Shelton D. Caruthers, Trung Tran, Jon N. Marsh, Kirk D. Wallace, Tillman Cyrus, Kathryn Partlow, Michael Scott, Michal Lijowski, Anne Neubauer, Patrick Winter, Grace Hu, Hyuing Zhang, John E. McCarthy, Brian Maurizi, John Allen, Cordellia Caradine, Robert Neumann, Jeffrey Arbeit, Gregory M. Lanza, Samuel A. Wickline
Proc. IEEE8
2007 Implementing Cryptographic Pairings over Barreto-Naehrig Curves
Augusto Jun Devegili, Michael Scott, Ricardo Dahab
Pairing2
2007 The Importance of the Final Exponentiation in Pairings When Considering Fault Attacks
Claire Whelan, Michael Scott
Pairing2
2007 Efficient pairing computation on supersingular Abelian varieties
Paulo S. L. M. Barreto, Steven D. Galbraith, Colm O'hEigeartaigh, Michael Scott
Des. Codes Cryptogr.4
2007 Hardware acceleration of the Tate pairing on a genus 2 hyperelliptic curve
Robert Ronan, Colm O'hEigeartaigh, Colin C. Murphy, Michael Scott, Tim Kerins
J. Syst. Archit.4
2006 Implementing Cryptographic Pairings on Smartcards
Michael Scott, Neil Costigan, Wesam Abdulwahab
CHES1
2006 FPGA acceleration of the tate pairing in characteristic 2
abstract
This paper presents a dedicated hardware implementation of the cryptographic Tate pairing on an elliptic curve of characteristic 2 using theetaTmethod. Efficient techniques for pairing computation are discussed and optimised hardware architectures are presented. A hardware pipelining scheme is described, which provides a dramatic reduction in pairing computation time. A cryptographic processor for computation of the bilinear pairing is presented and implemented on an FPGA. It is demonstrated that an FPGA forms an ideal basis for pairing processor implementation due to ease of reconfigurability and the opportunity for rapid prototyping. Implementation results are provided for pairing calculation on an FPGA over the base field
Robert Ronan, Colm O'hEigeartaigh, Colin C. Murphy, Michael Scott, Tim Kerins
FPT4
2006 Generating More MNT Elliptic Curves
Michael Scott, Paulo S. L. M. Barreto
Des. Codes Cryptogr.1
2005 Computing the Tate Pairing
Michael Scott
CT-RSA1
2004 Compressed Pairings
Michael Scott, Paulo S. L. M. Barreto
CRYPTO1
2004 Efficient Implementation of Pairing-Based Cryptosystems
Paulo S. L. M. Barreto, Ben Lynn, Michael Scott
J. Cryptol.3
2002 Efficient Algorithms for Pairing-Based Cryptosystems
Paulo S. L. M. Barreto, Hae Yong Kim, Ben Lynn, Michael Scott
CRYPTO4
1989 Potential liability for the development or use of a defective patient care system
Michael Scott
Comput. Law Secur. Rev.1