Oblivious Transfer from Zero-Knowledge Proofs, or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States.

[BibT_eX]

[DOI]

Léo Colisson

Garazi Muguruza

Florian Speelman

IACR Cryptol. ePrint Arch., 2023

QSETH strikes again: finer quantum lower bounds for lattice problem, strong simulation, hitting set problem, and more.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Solving correlation clustering with QAOA and a Rydberg qudit system: a full-stack approach.

[BibT_eX]

[DOI]

Quantum, 2022

An efficient combination of quantum error correction and authentication.

[BibT_eX]

[DOI]

Yfke Dulek

Garazi Muguruza

Florian Speelman

CoRR, 2022

Matching Triangles and Triangle Collection: Hardness based on a Weak Quantum Conjecture.

[BibT_eX]

[DOI]

CoRR, 2022

Memory Compression with Quantum Random-Access Gates.

[BibT_eX]

[DOI]

Proceedings of the 17th Conference on the Theory of Quantum Computation, 2022

Limits of Quantum Speed-Ups for Computational Geometry and Other Problems: Fine-Grained Complexity via Quantum Walks.

[BibT_eX]

[DOI]

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

A Guide for New Program Committee Members at Theoretical Computer Science Conferences.

[BibT_eX]

[DOI]

CoRR, 2021

Position-based cryptography: Single-qubit protocol secure against multi-qubit attacks.

[BibT_eX]

[DOI]

Andreas Bluhm

Matthias Christandl

Florian Speelman

CoRR, 2021

A Framework of Quantum Strong Exponential-Time Hypotheses.

[BibT_eX]

[DOI]

Harry Buhrman

Subhasree Patro

Florian Speelman

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

2019

The Quantum Strong Exponential-Time Hypothesis.

[BibT_eX]

[DOI]

Harry Buhrman

Subhasree Patro

Florian Speelman

CoRR, 2019

2018

Quantum Homomorphic Encryption for Polynomial-Size Circuits.

[BibT_eX]

[DOI]

Yfke Dulek

Christian Schaffner

Florian Speelman

Theory Comput., 2018

Catalytic Space: Non-determinism and Hierarchy.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

Quantum Ciphertext Authentication and Key Recycling with the Trap Code.

[BibT_eX]

[DOI]

Yfke Dulek

Florian Speelman

Proceedings of the 13th Conference on the Theory of Quantum Computation, 2018

2017

Quantum Fully Homomorphic Encryption with Verification.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016

Quantum homomorphic encryption for polynomial-sized circuits.

[BibT_eX]

[DOI]

Yfke Dulek

Christian Schaffner

Florian Speelman

IACR Cryptol. ePrint Arch., 2016

Towards a Reverse Newman's Theorem in Interactive Information Complexity.

[BibT_eX]

[DOI]

Nikolai K. Vereshchagin

Algorithmica, 2016

Instantaneous Non-Local Computation of Low T-Depth Quantum Circuits.

[BibT_eX]

[DOI]

Florian Speelman

Proceedings of the 11th Conference on the Theory of Quantum Computation, 2016

2015

Round Elimination in Exact Communication Complexity.

[BibT_eX]

[DOI]

Proceedings of the 10th Conference on the Theory of Quantum Computation, 2015

2014

Computing with a full memory: Catalytic space.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2014

2013

The garden-hose model.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science, 2013

2012

Towards a Reverse Newman's Theorem in Interactive Information Complexity.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2012

Position-Based Quantum Cryptography and the Garden-Hose Game

[BibT_eX]

[DOI]

Florian Speelman

CoRR, 2012

2011

The Garden-Hose Game: A New Model of Computation, and Application to Position-Based Quantum Cryptography

[BibT_eX]

[DOI]

CoRR, 2011

Florian Speelman

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...