14 citations · 35 across the 11 of their papers we have counts for
12 papers
Trustless unknown-order groups
Samuel Dobson, Steven Galbraith, Benjamin Smith
Groups of unknown order are of major interest due to their applications including time-lock puzzles, verifiable delay functions, and accumulators. In this paper we focus on trustle…
Failing to hash into supersingular isogeny graphs
Jeremy Booher, Ross Bowden, Javad Doliskani +12
An important open problem in supersingular isogeny-based cryptography is to produce, without a trusted authority, concrete examples of "hard supersingular curves" that is, equation…
Towards a Theory of Special-purpose Program Obfuscation
Muhammad Rizwan Asghar, Steven Galbraith, Andrea Lanzi +2
Most recent theoretical literature on program obfuscation is based on notions like Virtual Black Box (VBB) obfuscation and indistinguishability Obfuscation (iO). These notions are…
Privacy-preserving Searchable Databases with Controllable Leakage
Shujie Cui, Xiangfu Song, Muhammad Rizwan Asghar +2
Searchable Encryption (SE) is a technique that allows Cloud Service Providers (CSPs) to search over encrypted datasets without learning the content of queries and records. In recen…
Quantum Equivalence of the DLP and CDHP for Group Actions
Steven Galbraith, Lorenz Panny, Benjamin Smith +1
In this short note we give a polynomial-time quantum reduction from the vectorization problem (DLP) to the parallelization problem (CDHP) for group actions. Combined with the trivi…
Finding Significant Fourier Coefficients: Clarifications, Simplifications, Applications and Limitations
Steven D. Galbraith, Joel Laity, Barak Shani
Ideas from Fourier analysis have been used in cryptography for the last three decades. Akavia, Goldwasser and Safra unified some of these ideas to give a complete algorithm that fi…