Anne Broadbent

According to our database, Anne Broadbent authored at least 42 papers between 2003 and 2023.

Collaborative distances:

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

2023

Categorical composable cryptography: extended version.

Anne Broadbent, Martti Karvonen

Log. Methods Comput. Sci., 2023

Algebra of Nonlocal Boxes and the Collapse of Communication Complexity.

Pierre Botteron, Anne Broadbent, Reda Chhaibi, Ion Nechita, Clément Pellegrini

CoRR, 2023

Uncloneable Quantum Advice.

Anne Broadbent, Martti Karvonen, Sébastien Lord

CoRR, 2023

Quantum delegation with an off-the-shelf device.

Anne Broadbent, Arthur Mehta, Yuming Zhao

CoRR, 2023

Uncloneable Cryptographic Primitives with Interaction.

Anne Broadbent, Eric Culf

CoRR, 2023

Extending the Known Region of Nonlocal Boxes that Collapse Communication Complexity.

Marc-Olivier Proulx, Anne Broadbent, Pierre Botteron

CoRR, 2023

Rigidity for Monogamy-Of-Entanglement Games.

Anne Broadbent, Eric Culf

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022

QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge.

Anne Broadbent, Alex Bredariol Grilo

SIAM J. Comput., August, 2022

Categorical composable cryptography.

Anne Broadbent, Martti Karvonen

Proceedings of the Foundations of Software Science and Computation Structures, 2022

2021

Towards Quantum One-Time Memories from Stateless Hardware.

Anne Broadbent, Sevag Gharibian, Hong-Sheng Zhou

Quantum, 2021

Secure Software Leasing Without Assumptions.

Anne Broadbent, Stacey Jeffery, Sébastien Lord, Supartha Podder, Aarthi Sundaram

Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Password authentication schemes on a quantum computer.

Sherry Wang, Carlisle Adams, Anne Broadbent

Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2021

Constructions for Quantum Indistinguishability Obfuscation.

Anne Broadbent, Raza Ali Kazmi

Proceedings of the Progress in Cryptology - LATINCRYPT 2021, 2021

2020

Zero-Knowledge Proof Systems for QMA.

Anne Broadbent, Zhengfeng Ji, Fang Song, John Watrous

SIAM J. Comput., 2020

Indistinguishability obfuscation for quantum circuits of low T-count.

Anne Broadbent, Raza Ali Kazmi

IACR Cryptol. ePrint Arch., 2020

Quantum encryption with certified deletion.

Anne Broadbent, Rabib Islam

IACR Cryptol. ePrint Arch., 2020

Uncloneable Quantum Encryption via Oracles.

Anne Broadbent, Sébastien Lord

Proceedings of the 15th Conference on the Theory of Quantum Computation, 2020

2019

Uncloneable Quantum Encryption via Random Oracles.

Anne Broadbent, Sébastien Lord

IACR Cryptol. ePrint Arch., 2019

Zero-Knowledge for QMA from Locally Simulatable Proofs.

Anne Broadbent, Alex B. Grilo

CoRR, 2019

2018

How to Verify a Quantum Computation.

Anne Broadbent

Theory Comput., 2018

2016

Computational Security of Quantum Encryption.

Gorjan Alagic, Anne Broadbent, Bill Fefferman, Tommaso Gagliardoni, Christian Schaffner, Michael St. Jules

IACR Cryptol. ePrint Arch., 2016

Quantum cryptography beyond quantum key distribution.

Anne Broadbent, Christian Schaffner

Des. Codes Cryptogr., 2016

Efficient Simulation for Quantum Message Authentication.

Anne Broadbent, Evelyn Wainewright

Proceedings of the Information Theoretic Security - 9th International Conference, 2016

2015

Quantum Private Information Retrieval has Linear Communication Complexity.

Ämin Baumeler, Anne Broadbent

J. Cryptol., 2015

Quantum homomorphic encryption for circuits of low T-gate complexity.

Anne Broadbent, Stacey Jeffery

IACR Cryptol. ePrint Arch., 2015

2013

Classical, quantum and nonsignalling resources in bipartite games.

Gilles Brassard, Anne Broadbent, Esther Hänggi, André Allan Méthot, Stefan Wolf

Theor. Comput. Sci., 2013

Quantum one-time programs.

Anne Broadbent, Gus Gutoski, Douglas Stebila

IACR Cryptol. ePrint Arch., 2013

Quantum One-Time Programs - (Extended Abstract).

Anne Broadbent, Gus Gutoski, Douglas Stebila

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012

Trading Robustness for Correctness and Privacy in Certain Multiparty Computations, beyond an Honest Majority.

Anne Broadbent, Stacey Jeffery, Samuel Ranellucci, Alain Tapp

Proceedings of the Information Theoretic Security - 6th International Conference, 2012

2010

Exact, Efficient and Information-Theoretically Secure Voting with an Arbitrary Number of Cheaters.

Anne Broadbent, Stacey Jeffery, Alain Tapp

IACR Cryptol. ePrint Arch., 2010

Measurement-Based and Universal Blind Quantum Computation.

Anne Broadbent, Joseph F. Fitzsimons, Elham Kashefi

Proceedings of the Formal Methods for Quantitative Aspects of Programming Languages, 2010

2009

Parallelizing quantum circuits.

Anne Broadbent, Elham Kashefi

Theor. Comput. Sci., 2009

Universal Blind Quantum Computation.

Anne Broadbent, Joseph F. Fitzsimons, Elham Kashefi

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008

Can quantum mechanics help distributed computing?

Anne Broadbent, Alain Tapp

SIGACT News, 2008

Information-Theoretically Secure Voting Without an Honest Majority.

Anne Broadbent, Alain Tapp

IACR Cryptol. ePrint Arch., 2008

Classical, Quantum and Non-signalling Resources in Bipartite Games.

Gilles Brassard, Anne Broadbent, Esther Hänggi, André Allan Méthot, Stefan Wolf

Proceedings of the Second International Conference on Quantum, 2008

2007

Anonymous Quantum Communication - (Extended Abstract).

Gilles Brassard, Anne Broadbent, Joseph F. Fitzsimons, Sébastien Gambs, Alain Tapp

Proceedings of the Information Theoretic Security - Second International Conference, 2007

Information-Theoretic Security Without an Honest Majority.

Anne Broadbent, Alain Tapp

Proceedings of the Advances in Cryptology, 2007

Anonymous Quantum Communication.

Gilles Brassard, Anne Broadbent, Joseph F. Fitzsimons, Sébastien Gambs, Alain Tapp

Proceedings of the Advances in Cryptology, 2007

2006

On the power of non-local boxes.

Anne Broadbent, André Allan Méthot

Theor. Comput. Sci., 2006

2005

Recasting mermin's multi-player game into the framework of pseudo-telepathy.

Gilles Brassard, Anne Broadbent, Alain Tapp

Quantum Inf. Comput., 2005

2003

Multi-party Pseudo-Telepathy.

Gilles Brassard, Anne Broadbent, Alain Tapp

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003