Stacey Jeffery

According to our database1, Stacey Jeffery authored at least 30 papers between 2009 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 





Span Programs and Quantum Space Complexity.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Secure Multi-party Quantum Computation with a Dishonest Majority.
IACR Cryptology ePrint Archive, 2019

Verifier-on-a-Leash: new schemes for verifiable delegated quantum computation, with quasilinear resources.
IACR Cryptology ePrint Archive, 2019

A Unified Framework of Quantum Walk Search.
CoRR, 2019

Quadratic speedup for finding marked vertices by quantum walks.
CoRR, 2019

Approximate Span Programs.
Algorithmica, 2019

The Power of Block-Encoded Matrix Powers: Improved Regression Techniques via Faster Hamiltonian Simulation.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

On Quantum Chosen-Ciphertext Attacks and Learning with Errors.
IACR Cryptology ePrint Archive, 2018

How Classical Beings Can Test Quantum Devices.
ERCIM News, 2018

On non-adaptive quantum chosen-ciphertext attacks and Learning with Errors.
CoRR, 2018

Quantum Algorithms for Connectivity and Related Problems.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Attacks on the AJPS Mersenne-based cryptosystem.
IACR Cryptology ePrint Archive, 2017

Quantum Algorithms for Graph Connectivity and Formula Evaluation.
CoRR, 2017

Optimal Parallel Quantum Query Algorithms.
Algorithmica, 2017

Quantum Algorithm for Finding Triangles.
Encyclopedia of Algorithms, 2016

Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision.
Algorithmica, 2016

Quantum Communication Complexity of Distributed Set Joins.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Quantum homomorphic encryption for circuits of low T-gate complexity.
IACR Cryptology ePrint Archive, 2015

NAND-Trees, Average Choice Complexity, and Effective Resistance.
CoRR, 2015

Frameworks for Quantum Algorithms.
PhD thesis, 2014

Circuit Obfuscation Using Braids.
Proceedings of the 9th Conference on the Theory of Quantum Computation, 2014

Quantum algorithms for the subset-sum problem.
IACR Cryptology ePrint Archive, 2013

A Time-Efficient Quantum Walk for 3-Distinctness Using Nested Updates
CoRR, 2013

Nested Quantum Walks with Quantum Data Structures.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Time-Efficient Quantum Walks for 3-Distinctness.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Partial-indistinguishability obfuscation using braids
CoRR, 2012

Trading Robustness for Correctness and Privacy in Certain Multiparty Computations, beyond an Honest Majority.
Proceedings of the Information Theoretic Security - 6th International Conference, 2012

Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Exact, Efficient and Information-Theoretically Secure Voting with an Arbitrary Number of Cheaters.
IACR Cryptology ePrint Archive, 2010

HASS: a scheduler for heterogeneous multicore systems.
Operating Systems Review, 2009