Florian Speelman

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 29

Top Topics

Quantum Computing

Computational Geometry

Homomorphic Encryption

Top Venues

IACR Cryptol. ePrint Arch.

Publications

Poojith U. Rao, Florian Speelman, Balwinder Sodhi, Sachin Kinge
A Quantum Computing Approach for Multi-robot Coverage Path Planning. CoRR (2024)
Yanlin Chen, Yilei Chen, Rajendra Kumar, Subhasree Patro, Florian Speelman
QSETH strikes again: finer quantum lower bounds for lattice problem, strong simulation, hitting set problem, and more. CoRR (2023)
Léo Colisson, Garazi Muguruza, Florian Speelman
Oblivious Transfer from Zero-Knowledge Proofs, or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States. IACR Cryptol. ePrint Arch. 2023 (2023)
Léo Colisson, Garazi Muguruza, Florian Speelman
Oblivious Transfer from Zero-Knowledge Proofs - Or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States. ASIACRYPT (8) (2023)
Léo Colisson, Garazi Muguruza, Florian Speelman
Oblivious Transfer from Zero-Knowledge Proofs, or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States. CoRR (2023)
Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman
Memory Compression with Quantum Random-Access Gates. CoRR (2022)
Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman
Limits of Quantum Speed-Ups for Computational Geometry and Other Problems: Fine-Grained Complexity via Quantum Walks. ITCS (2022)
Yfke Dulek, Garazi Muguruza, Florian Speelman
An efficient combination of quantum error correction and authentication. CoRR (2022)
Jordi R. Weggemans, Alexander Urech, Alexander Rausch, Robert Spreeuw, Richard J. Boucherie, Florian Schreck, Kareljan Schoutens, Jirí Minár, Florian Speelman
Solving correlation clustering with QAOA and a Rydberg qudit system: a full-stack approach. Quantum 6 (2022)
Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman
Memory Compression with Quantum Random-Access Gates. TQC (2022)
Andris Ambainis, Harry Buhrman, Koen Leijnse, Subhasree Patro, Florian Speelman
Matching Triangles and Triangle Collection: Hardness based on a Weak Quantum Conjecture. CoRR (2022)
Harry Buhrman, Subhasree Patro, Florian Speelman
A Framework of Quantum Strong Exponential-Time Hypotheses. STACS (2021)
Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman
Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks. CoRR (2021)
Yfke Dulek, Stacey Jeffery, Christian Majenz, Christian Schaffner, Florian Speelman, Ronald de Wolf
A Guide for New Program Committee Members at Theoretical Computer Science Conferences. CoRR (2021)
Andreas Bluhm, Matthias Christandl, Florian Speelman
Position-based cryptography: Single-qubit protocol secure against multi-qubit attacks. CoRR (2021)
Harry Buhrman, Subhasree Patro, Florian Speelman
The Quantum Strong Exponential-Time Hypothesis. CoRR (2019)
Yfke Dulek, Florian Speelman
Quantum ciphertext authentication and key recycling with the trap code. CoRR (2018)
Yfke Dulek, Florian Speelman
Quantum Ciphertext Authentication and Key Recycling with the Trap Code. TQC (2018)
Jop Briët, Harry Buhrman, Debbie W. Leung, Teresa Piovesan, Florian Speelman
Round elimination in exact communication complexity. CoRR (2018)
Yfke Dulek, Christian Schaffner, Florian Speelman
Quantum Homomorphic Encryption for Polynomial-Size Circuits. Theory Comput. 14 (1) (2018)
Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman
Catalytic Space: Non-determinism and Hierarchy. Theory Comput. Syst. 62 (1) (2018)
Gorjan Alagic, Yfke Dulek, Christian Schaffner, Florian Speelman
Quantum Fully Homomorphic Encryption with Verification. ASIACRYPT (1) (2017)
Gorjan Alagic, Yfke Dulek, Christian Schaffner, Florian Speelman
Quantum Fully Homomorphic Encryption With Verification. CoRR (2017)
Florian Speelman
Instantaneous Non-Local Computation of Low T-Depth Quantum Circuits. TQC (2016)
Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman
Catalytic Space: Non-determinism and Hierarchy. STACS (2016)
Yfke Dulek, Christian Schaffner, Florian Speelman
Quantum homomorphic encryption for polynomial-sized circuits. CoRR (2016)
Yfke Dulek, Christian Schaffner, Florian Speelman
Quantum homomorphic encryption for polynomial-sized circuits. IACR Cryptol. ePrint Arch. 2016 (2016)
Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman, Nikolai K. Vereshchagin
Towards a Reverse Newman's Theorem in Interactive Information Complexity. Algorithmica 76 (3) (2016)
Yfke Dulek, Christian Schaffner, Florian Speelman
Quantum Homomorphic Encryption for Polynomial-Sized Circuits. CRYPTO (3) (2016)
Jop Briët, Harry Buhrman, Debbie W. Leung, Teresa Piovesan, Florian Speelman
Round Elimination in Exact Communication Complexity. TQC (2015)
Harry Buhrman, Richard Cleve, Michal Koucký, Bruno Loff, Florian Speelman
Computing with a full memory: Catalytic space. Electron. Colloquium Comput. Complex. 21 (2014)
Harry Buhrman, Richard Cleve, Michal Koucký, Bruno Loff, Florian Speelman
Computing with a full memory: catalytic space. STOC (2014)
Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman, Nikolay K. Vereshchagin
Towards a Reverse Newman's Theorem in Interactive Information Complexity. Computational Complexity Conference (2013)
Harry Buhrman, Serge Fehr, Christian Schaffner, Florian Speelman
The garden-hose model. ITCS (2013)
Florian Speelman
Position-Based Quantum Cryptography and the Garden-Hose Game CoRR (2012)
Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman
Towards a Reverse Newman's Theorem in Interactive Information Complexity. Electron. Colloquium Comput. Complex. 19 (2012)
Harry Buhrman, Serge Fehr, Christian Schaffner, Florian Speelman
The Garden-Hose Game: A New Model of Computation, and Application to Position-Based Quantum Cryptography CoRR (2011)