| 2008 |
|---|
| 23 | EE | Piotr Szczechowiak,
Leonardo B. Oliveira,
Michael Scott,
Martin Collier,
Ricardo Dahab:
NanoECC: Testing the Limits of Elliptic Curve Cryptography in Sensor Networks.
EWSN 2008: 305-320 |
| 22 | EE | Ezekiel J. Kachisa,
Edward F. Schaefer,
Michael Scott:
Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field.
Pairing 2008: 126-135 |
| 21 | EE | Steven D. Galbraith,
Michael Scott:
Exponentiation in Pairing-Friendly Groups Using Homomorphisms.
Pairing 2008: 211-224 |
| 2007 |
|---|
| 20 | EE | Ali-Reza Adl-Tabatabai,
David Dice,
Maurice Herlihy,
Nir Shavit,
Christos Kozyrakis,
Christoph von Praun,
Michael Scott:
Potential show-stoppers for transactional synchronization.
PPOPP 2007: 55 |
| 19 | EE | Augusto Jun Devegili,
Michael Scott,
Ricardo Dahab:
Implementing Cryptographic Pairings over Barreto-Naehrig Curves.
Pairing 2007: 197-207 |
| 18 | EE | Claire Whelan,
Michael Scott:
The Importance of the Final Exponentiation in Pairings When Considering Fault Attacks.
Pairing 2007: 225-246 |
| 17 | EE | Paulo S. L. M. Barreto,
Steven D. Galbraith,
Colm O'Eigeartaigh,
Michael Scott:
Efficient pairing computation on supersingular Abelian varieties.
Des. Codes Cryptography 42(3): 239-271 (2007) |
| 16 | EE | Robert Ronan,
Colm O'Eigeartaigh,
Colin C. Murphy,
Michael Scott,
Tim Kerins:
Hardware acceleration of the Tate pairing on a genus 2 hyperelliptic curve.
Journal of Systems Architecture 53(2-3): 85-98 (2007) |
| 2006 |
|---|
| 15 | EE | Michael Scott,
Neil Costigan,
Wesam Abdulwahab:
Implementing Cryptographic Pairings on Smartcards.
CHES 2006: 134-147 |
| 14 | EE | Robert Ronan,
Colm O'Eigeartaigh,
Colin C. Murphy,
Michael Scott,
Tim Kerins,
William P. Marnane:
An Embedded Processor for a Pairing-Based Cryptosystem.
ITNG 2006: 192-197 |
| 13 | EE | Colm O'Eigeartaigh,
Michael Scott:
Pairing Calculation on Supersingular Genus 2 Curves.
Selected Areas in Cryptography 2006: 302-316 |
| 12 | EE | Claire Whelan,
Michael Scott:
Side Channel Analysis of Practical Pairing Implementations: Which Path Is More Secure?
VIETCRYPT 2006: 99-114 |
| 11 | EE | Michael Scott,
Paulo S. L. M. Barreto:
Generating More MNT Elliptic Curves.
Des. Codes Cryptography 38(2): 209-217 (2006) |
| 2005 |
|---|
| 10 | EE | Michael Scott:
Computing the Tate Pairing.
CT-RSA 2005: 293-304 |
| 9 | EE | Michael Scott:
Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism.
INDOCRYPT 2005: 258-269 |
| 8 | EE | Anu Bhargava,
Michael Scott,
Ryan Traylor,
Roy Chung,
Kimberly Mrozek,
Jonathan Wolter,
Hong Z. Tan:
Effect of Cognitive Load on Tactor Location Identification in Zero-g.
WHC 2005: 56-62 |
| 2004 |
|---|
| 7 | EE | Michael Scott,
Paulo S. L. M. Barreto:
Compressed Pairings.
CRYPTO 2004: 140-156 |
| 6 | EE | Paulo S. L. M. Barreto,
Ben Lynn,
Michael Scott:
Efficient Implementation of Pairing-Based Cryptosystems.
J. Cryptology 17(4): 321-334 (2004) |
| 5 | EE | Michael Scott:
Cryptanalysis of an ID-based password authentication scheme using smart cards and fingerprints.
Operating Systems Review 38(2): 73-75 (2004) |
| 2003 |
|---|
| 4 | EE | Paulo S. L. M. Barreto,
Ben Lynn,
Michael Scott:
On the Selection of Pairing-Friendly Groups.
Selected Areas in Cryptography 2003: 17-25 |
| 2002 |
|---|
| 3 | EE | Paulo S. L. M. Barreto,
Hae Yong Kim,
Ben Lynn,
Michael Scott:
Efficient Algorithms for Pairing-Based Cryptosystems.
CRYPTO 2002: 354-368 |
| 2 | EE | Paulo S. L. M. Barreto,
Ben Lynn,
Michael Scott:
Constructing Elliptic Curves with Prescribed Embedding Degrees.
SCN 2002: 257-267 |
| 1996 |
|---|
| 1 | | Paul Davern,
Michael Scott:
Fractal Based Image Steganography.
Information Hiding 1996: 279-294 |
