Florian Speelman

According to our database, Florian Speelman authored at least 24 papers between 2011 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

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

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.

Yanlin Chen, Yilei Chen, Rajendra Kumar, Subhasree Patro, Florian Speelman

CoRR, 2023

2022

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

Jordi R. Weggemans, Alexander Urech, Alexander Rausch, Robert J. C. Spreeuw, Richard J. Boucherie, Florian Schreck, Kareljan Schoutens, Jirí Minár, Florian Speelman

Quantum, 2022

An efficient combination of quantum error correction and authentication.

Yfke Dulek, Garazi Muguruza, Florian Speelman

CoRR, 2022

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

Andris Ambainis, Harry Buhrman, Koen Leijnse, Subhasree Patro, Florian Speelman

CoRR, 2022

Memory Compression with Quantum Random-Access Gates.

Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman

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.

Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman

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

2021

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

Yfke Dulek, Stacey Jeffery, Christian Majenz, Christian Schaffner, Florian Speelman, Ronald de Wolf

CoRR, 2021

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

Andreas Bluhm, Matthias Christandl, Florian Speelman

CoRR, 2021

A Framework of Quantum Strong Exponential-Time Hypotheses.

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.

Harry Buhrman, Subhasree Patro, Florian Speelman

CoRR, 2019

2018

Quantum Homomorphic Encryption for Polynomial-Size Circuits.

Yfke Dulek, Christian Schaffner, Florian Speelman

Theory Comput., 2018

Catalytic Space: Non-determinism and Hierarchy.

Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman

Theory Comput. Syst., 2018

Quantum Ciphertext Authentication and Key Recycling with the Trap Code.

Yfke Dulek, Florian Speelman

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

2017

Quantum Fully Homomorphic Encryption with Verification.

Gorjan Alagic, Yfke Dulek, Christian Schaffner, Florian Speelman

Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016

Quantum homomorphic encryption for polynomial-sized circuits.

Yfke Dulek, Christian Schaffner, Florian Speelman

IACR Cryptol. ePrint Arch., 2016

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

Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman, Nikolai K. Vereshchagin

Algorithmica, 2016

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

Florian Speelman

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

2015

Round Elimination in Exact Communication Complexity.

Jop Briët, Harry Buhrman, Debbie W. Leung, Teresa Piovesan, Florian Speelman

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

2014

Computing with a full memory: Catalytic space.

Harry Buhrman, Richard Cleve, Michal Koucký, Bruno Loff, Florian Speelman

Electron. Colloquium Comput. Complex., 2014

2013

The garden-hose model.

Harry Buhrman, Serge Fehr, Christian Schaffner, Florian Speelman

Proceedings of the Innovations in Theoretical Computer Science, 2013

2012

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

Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman

Electron. Colloquium Comput. Complex., 2012

Position-Based Quantum Cryptography and the Garden-Hose Game

Florian Speelman

CoRR, 2012

2011

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

Harry Buhrman, Serge Fehr, Christian Schaffner, Florian Speelman

CoRR, 2011