Steven D. Galbraith

Orcid: 0000-0001-7114-8377

Affiliations:
  • University of Auckland, Department of Mathematics, New Zealand


According to our database1, Steven D. Galbraith authored at least 114 papers between 1999 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Simpler and More Efficient Reduction of DLog to CDH for Abelian Group Actions.
IACR Cryptol. ePrint Arch., 2024

Climbing and descending tall volcanos.
IACR Cryptol. ePrint Arch., 2024

Failing to Hash Into Supersingular Isogeny Graphs.
Comput. J., 2024

2023
Guest editorial: Special issue on Mathematics of Zero-Knowledge.
Des. Codes Cryptogr., November, 2023

Proving knowledge of isogenies: a survey.
Des. Codes Cryptogr., November, 2023

CSIDH with Level Structure.
IACR Cryptol. ePrint Arch., 2023

Obfuscating Decision Trees.
IACR Cryptol. ePrint Arch., 2023

Auditable Obfuscation.
IACR Cryptol. ePrint Arch., 2023

Obfuscating Evasive Decision Trees.
Proceedings of the Progress in Cryptology - INDOCRYPT 2023, 2023

Preventing Reverse Engineering of Control Programs in Industrial Control Systems.
Proceedings of the 9th ACM Cyber-Physical System Security Workshop, 2023

2022
Obfuscation of Evasive Algebraic Set Membership.
IACR Cryptol. ePrint Arch., 2022

Attack on SHealS and HealS: the Second Wave of GPST.
IACR Cryptol. ePrint Arch., 2022

Trustless unknown-order groups.
CoRR, 2022

Post-Quantum Signal Key Agreement from SIDH.
Proceedings of the Post-Quantum Cryptography - 13th International Workshop, 2022

2021
Privacy-preserving Dynamic Symmetric Searchable Encryption with Controllable Leakage.
ACM Trans. Priv. Secur., 2021

An adaptive attack on 2-SIDH.
Int. J. Comput. Math. Comput. Syst. Theory, 2021

SIDH Proof of Knowledge.
IACR Cryptol. ePrint Arch., 2021

Post-Quantum Signal Key Agreement with SIDH.
IACR Cryptol. ePrint Arch., 2021

Small Superset and Big Subset Obfuscation.
Proceedings of the Information Security and Privacy - 26th Australasian Conference, 2021

2020
Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems.
J. Cryptol., 2020

Compact, Efficient and UC-Secure Isogeny-Based Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2020

Obfuscating Finite Automata.
IACR Cryptol. ePrint Arch., 2020

Big Subset and Small Superset Obfuscation.
IACR Cryptol. ePrint Arch., 2020

On Index Calculus Algorithms for Subfield Curves.
IACR Cryptol. ePrint Arch., 2020

Trustless Groups of Unknown Order with Hyperelliptic Curves.
IACR Cryptol. ePrint Arch., 2020

Advances in security research in the Asiacrypt region.
Commun. ACM, 2020

Towards a Theory of Special-Purpose Program Obfuscation.
Proceedings of the 19th IEEE International Conference on Trust, 2020

2019
Improved Combinatorial Algorithms for the Inhomogeneous Short Integer Solution Problem.
J. Cryptol., 2019

Obfuscated Fuzzy Hamming Distance and Conjunctions from Subset Product Problems.
IACR Cryptol. ePrint Arch., 2019

Safety in Numbers: On the Need for Robust Diffie-Hellman Parameter Validation.
IACR Cryptol. ePrint Arch., 2019

Integral Matrix Gram Root and Lattice Gaussian Sampling without Floats.
IACR Cryptol. ePrint Arch., 2019

Extending the Adaptive Attack to 2-SIDH.
IACR Cryptol. ePrint Arch., 2019

On the Degree-Insensitive SI-GDH problem and assumption.
IACR Cryptol. ePrint Arch., 2019

Privacy-preserving Searchable Databases with Controllable Leakage.
CoRR, 2019

When are Opaque Predicates Useful?
Proceedings of the 18th IEEE International Conference On Trust, 2019

2018
Computational problems in supersingular elliptic curve isogenies.
Quantum Inf. Process., 2018

Quantum Equivalence of the DLP and CDHP for Group Actions.
IACR Cryptol. ePrint Arch., 2018

Authenticated key exchange for SIDH.
IACR Cryptol. ePrint Arch., 2018

SeaSign: Compact isogeny signatures from class group actions.
IACR Cryptol. ePrint Arch., 2018

Finding Significant Fourier Coefficients: Clarifications, Simplifications, Applications and Limitations.
Chic. J. Theor. Comput. Sci., 2018

2017
Indistinguishable Predicates: A New Tool for Obfuscation.
IACR Cryptol. ePrint Arch., 2017

Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm.
Adv. Math. Commun., 2017

ObliviousDB: Practical and Efficient Searchable Encryption with Controllable Leakage.
Proceedings of the Foundations and Practice of Security - 10th International Symposium, 2017

Secure and Practical Searchable Encryption: A Position Paper.
Proceedings of the Information Security and Privacy - 22nd Australasian Conference, 2017

P-McDb: Privacy-Preserving Search Using Multi-Cloud Encrypted Databases.
Proceedings of the 2017 IEEE 10th International Conference on Cloud Computing (CLOUD), 2017

2016
Algorithms for the approximate common divisor problem.
LMS J. Comput. Math., 2016

Preventing Adaptive Key Recovery Attacks on the Gentry-Sahai-Waters Leveled Homomorphic Encryption Scheme.
IACR Cryptol. ePrint Arch., 2016

On the Security of Supersingular Isogeny Cryptosystems.
IACR Cryptol. ePrint Arch., 2016

Signature Schemes Based On Supersingular Isogeny Problems.
IACR Cryptol. ePrint Arch., 2016

Recent progress on the elliptic curve discrete logarithm problem.
Des. Codes Cryptogr., 2016

Computing isogenies between supersingular elliptic curves over 𝔽<sub>p</sub>.
Des. Codes Cryptogr., 2016

Preventing Adaptive Key Recovery Attacks on the GSW Levelled Homomorphic Encryption Scheme.
Proceedings of the Provable Security, 2016

2015
The Multivariate Hidden Number Problem.
IACR Cryptol. ePrint Arch., 2015

Adaptive key recovery attacks on NTRU-based somewhat homomorphic encryption schemes.
IACR Cryptol. ePrint Arch., 2015

Kangaroo Methods for Solving the Interval Discrete Logarithm Problem.
CoRR, 2015

2014
Constructing supersingular elliptic curves with a given endomorphism ring.
LMS J. Comput. Math., 2014

Erratum Self-pairings on hyperelliptic curves [J. Math. Cryptol. 7(2013), 31-42].
J. Math. Cryptol., 2014

Summation polynomial algorithms for elliptic curves in characteristic two.
IACR Cryptol. ePrint Arch., 2014

Improved Exponential-time Algorithms for Inhomogeneous-SIS.
IACR Cryptol. ePrint Arch., 2014

Sampling from discrete Gaussians for lattice-based cryptography on a constrained device.
Appl. Algebra Eng. Commun. Comput., 2014

2013
Computing discrete logarithms in an interval.
Math. Comput., 2013

Self-pairings on hyperelliptic curves.
J. Math. Cryptol., 2013

Lattice Decoding Attacks on Binary LWE.
IACR Cryptol. ePrint Arch., 2013

An improved compression technique for signatures based on learning with errors.
IACR Cryptol. ePrint Arch., 2013

Improved algorithm for the isogeny problem for ordinary elliptic curves.
Appl. Algebra Eng. Commun. Comput., 2013

2012
A non-uniform birthday problem with applications to discrete logarithms.
Discret. Appl. Math., 2012

Mathematics of Public Key Cryptography
Cambridge University Press, ISBN: 9781107013926, 2012

2011
Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves.
J. Cryptol., 2011

On the distribution of the coefficients of normal forms for Frobenius expansions.
Des. Codes Cryptogr., 2011

Point compression for Koblitz elliptic curves.
Adv. Math. Commun., 2011

2010
Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval.
IACR Cryptol. ePrint Arch., 2010

2009
Distortion maps for supersingular genus two curves.
J. Math. Cryptol., 2009

Computing pairings using <i>x</i> -coordinates only.
Des. Codes Cryptogr., 2009

An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems.
Proceedings of the Cryptography and Coding, 2009

2008
Aspects of Pairing Inversion.
IEEE Trans. Inf. Theory, 2008

Exponentiation in pairing-friendly groups using homomorphisms.
IACR Cryptol. ePrint Arch., 2008

Pairings on hyperelliptic curves with a real model.
IACR Cryptol. ePrint Arch., 2008

Computing Pairings Using x-Coordinates Only.
IACR Cryptol. ePrint Arch., 2008

Efficient Hyperelliptic Arithmetic using Balanced Representation for Divisors.
IACR Cryptol. ePrint Arch., 2008

Efficient arithmetic on elliptic curves using a mixed Edwards-Montgomery representation.
IACR Cryptol. ePrint Arch., 2008

Pairings for cryptographers.
Discret. Appl. Math., 2008

Computing L-polynomials of non-hyperelliptic genus 4 and 5 curves (abstract only).
ACM Commun. Comput. Algebra, 2008

An Analysis of the Vector Decomposition Problem.
Proceedings of the Public Key Cryptography, 2008

2007
Simplified pairing computation and security implications.
J. Math. Cryptol., 2007

Ordinary abelian varieties having small embedding degree.
Finite Fields Their Appl., 2007

Efficient pairing computation on supersingular Abelian varieties.
Des. Codes Cryptogr., 2007

The GPS Identification Scheme Using Frobenius Expansions.
Proceedings of the Research in Cryptology, Second Western European Workshop, 2007

Hyperelliptic Pairings.
Proceedings of the Pairing-Based Cryptography, 2007

Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction.
Proceedings of the Cryptography and Coding, 2007

2006
Discrete Logarithms in Generalized Jacobians.
IACR Cryptol. ePrint Arch., 2006

Distortion maps for genus two curves.
IACR Cryptol. ePrint Arch., 2006

Disguising tori and elliptic curves.
IACR Cryptol. ePrint Arch., 2006

Hidden Pairings and Trapdoor DDH Groups.
Proceedings of the Algorithmic Number Theory, 7th International Symposium, 2006

2005
The Weil pairing on elliptic curves over C.
IACR Cryptol. ePrint Arch., 2005

Algebraic curves and cryptography.
Finite Fields Their Appl., 2005

Pairings on Elliptic Curves over Finite Commutative Rings.
Proceedings of the Cryptography and Coding, 2005

Tunable Balancing of RSA.
Proceedings of the Information Security and Privacy, 10th Australasian Conference, 2005

2004
Easy Decision Diffie-Hellman Groups.
LMS J. Comput. Math., 2004

2003
Cryptanalysis of a Cryptosystem based on Drinfeld modules.
IACR Cryptol. ePrint Arch., 2003

Weil Descent of Jacobians.
Discret. Appl. Math., 2003

Invisibility and Anonymity of Undeniable and Confirmer Signatures.
Proceedings of the Topics in Cryptology, 2003

2002
Arithmetic on superelliptic curves.
Math. Comput., 2002

Elliptic Curve Paillier Schemes.
J. Cryptol., 2002

Public key signatures in the multi-user setting.
Inf. Process. Lett., 2002

Secure Bilinear Diffie-Hellman Bits.
IACR Cryptol. ePrint Arch., 2002

RSA-Based Undeniable Signatures for General Moduli.
Proceedings of the Topics in Cryptology, 2002

Implementing the Tate Pairing.
Proceedings of the Algorithmic Number Theory, 5th International Symposium, 2002

2001
Extending the GHS Weil Descent Attack.
IACR Cryptol. ePrint Arch., 2001

Supersingular Curves in Cryptography.
Proceedings of the Advances in Cryptology, 2001

1999
Constructing Isogenies between Elliptic Curves Over Finite Fields.
LMS J. Comput. Math., 1999

Rational Points on X<sub>O</sub> <sup>+</sup>(p).
Exp. Math., 1999

A Cryptographic Application of Weil Descent.
Proceedings of the Cryptography and Coding, 1999

Weaknesses in Shared RSA Key Generation Protocols.
Proceedings of the Cryptography and Coding, 1999

Cryptanalysis of Two Cryptosystems Based on Group Actions.
Proceedings of the Advances in Cryptology, 1999


  Loading...