The SCEAS System
| |||||||

## Search the dblp DataBase
Michael Scott:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Michael Scott, Neil Costigan, Wesam Abdulwahab
**Implementing Cryptographic Pairings on Smartcards.**[Citation Graph (0, 0)][DBLP] CHES, 2006, pp:134-147 [Conf] - Paulo S. L. M. Barreto, Hae Yong Kim, Ben Lynn, Michael Scott
**Efficient Algorithms for Pairing-Based Cryptosystems.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2002, pp:354-368 [Conf] - Michael Scott, Paulo S. L. M. Barreto
**Compressed Pairings.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2004, pp:140-156 [Conf] - Michael Scott
**Computing the Tate Pairing.**[Citation Graph (0, 0)][DBLP] CT-RSA, 2005, pp:293-304 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] WHC, 2005, pp:56-62 [Conf] - Paul Davern, Michael Scott
**Fractal Based Image Steganography.**[Citation Graph (0, 0)][DBLP] Information Hiding, 1996, pp:279-294 [Conf] - Michael Scott
**Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism.**[Citation Graph (0, 0)][DBLP] INDOCRYPT, 2005, pp:258-269 [Conf] - Robert Ronan, Colm O'Eigeartaigh, Colin C. Murphy, Michael Scott, Tim Kerins, William P. Marnane
**An Embedded Processor for a Pairing-Based Cryptosystem.**[Citation Graph (0, 0)][DBLP] ITNG, 2006, pp:192-197 [Conf] - Paulo S. L. M. Barreto, Ben Lynn, Michael Scott
**On the Selection of Pairing-Friendly Groups.**[Citation Graph (0, 0)][DBLP] Selected Areas in Cryptography, 2003, pp:17-25 [Conf] - Paulo S. L. M. Barreto, Ben Lynn, Michael Scott
**Constructing Elliptic Curves with Prescribed Embedding Degrees.**[Citation Graph (0, 0)][DBLP] SCN, 2002, pp:257-267 [Conf] - Claire Whelan, Michael Scott
**Side Channel Analysis of Practical Pairing Implementations: Which Path Is More Secure?**[Citation Graph (0, 0)][DBLP] VIETCRYPT, 2006, pp:99-114 [Conf] - Michael Scott, Paulo S. L. M. Barreto
**Generating More MNT Elliptic Curves.**[Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2006, v:38, n:2, pp:209-217 [Journal] - Paulo S. L. M. Barreto, Ben Lynn, Michael Scott
**Efficient Implementation of Pairing-Based Cryptosystems.**[Citation Graph (0, 0)][DBLP] J. Cryptology, 2004, v:17, n:4, pp:321-334 [Journal] - Robert Ronan, Colm O'Eigeartaigh, Colin C. Murphy, Michael Scott, Tim Kerins
**Hardware acceleration of the Tate pairing on a genus 2 hyperelliptic curve.**[Citation Graph (0, 0)][DBLP] Journal of Systems Architecture, 2007, v:53, n:2-3, pp:85-98 [Journal] - Michael Scott
**Cryptanalysis of an ID-based password authentication scheme using smart cards and fingerprints.**[Citation Graph (0, 0)][DBLP] Operating Systems Review, 2004, v:38, n:2, pp:73-75 [Journal] - Colm O'Eigeartaigh, Michael Scott
**Pairing Calculation on Supersingular Genus 2 Curves.**[Citation Graph (0, 0)][DBLP] Selected Areas in Cryptography, 2006, pp:302-316 [Conf] - Augusto Jun Devegili, Michael Scott, Ricardo Dahab
**Implementing Cryptographic Pairings over Barreto-Naehrig Curves.**[Citation Graph (0, 0)][DBLP] Pairing, 2007, pp:197-207 [Conf] - Claire Whelan, Michael Scott
**The Importance of the Final Exponentiation in Pairings When Considering Fault Attacks.**[Citation Graph (0, 0)][DBLP] Pairing, 2007, pp:225-246 [Conf] - Paulo S. L. M. Barreto, Steven D. Galbraith, Colm O'Eigeartaigh, Michael Scott
**Efficient pairing computation on supersingular Abelian varieties.**[Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2007, v:42, n:3, pp:239-271 [Journal] **Secure Delegation of Elliptic-Curve Pairing.**[Citation Graph (, )][DBLP]**Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves.**[Citation Graph (, )][DBLP]**NanoECC: Testing the Limits of Elliptic Curve Cryptography in Sensor Networks.**[Citation Graph (, )][DBLP]**Adaptive Sweeping Techniques.**[Citation Graph (, )][DBLP]**Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions.**[Citation Graph (, )][DBLP]**Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field.**[Citation Graph (, )][DBLP]**Exponentiation in Pairing-Friendly Groups Using Homomorphisms.**[Citation Graph (, )][DBLP]**Fast Hashing to**[Citation Graph (, )][DBLP]*G*_{2}on Pairing-Friendly Curves.**On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves.**[Citation Graph (, )][DBLP]**Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography.**[Citation Graph (, )][DBLP]**On the application of pairing based cryptography to wireless sensor networks.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |