Multi-party Pseudo-Telepathy. - Gilles Brassard; Anne Broadbent; Alain Tapp (WADS, 2003)

Recasting mermin's multi-player game into the framework of pseudo-telepathy. - Gilles Brassard; Anne Broadbent; Alain Tapp (Quantum Inf. Comput., 2005)

On the power of non-local boxes. - Anne Broadbent; André Allan Méthot (Theor. Comput. Sci., 2006)

Anonymous Quantum Communication. - Gilles Brassard; Anne Broadbent; Joseph F. Fitzsimons; Sébastien Gambs; Alain Tapp (ASIACRYPT, 2007)

Information-Theoretic Security Without an Honest Majority. - Anne Broadbent; Alain Tapp (ASIACRYPT, 2007)

Anonymous Quantum Communication - (Extended Abstract). - Gilles Brassard; Anne Broadbent; Joseph F. Fitzsimons; Sébastien Gambs; Alain Tapp (ICITS, 2007)

Classical, Quantum and Non-signalling Resources in Bipartite Games. - Gilles Brassard; Anne Broadbent; Esther Hänggi; André Allan Méthot; Stefan Wolf 001 (ICQNM, 2008)

Information-Theoretically Secure Voting Without an Honest Majority. - Anne Broadbent; Alain Tapp (IACR Cryptol. ePrint Arch., 2008)

Can quantum mechanics help distributed computing? - Anne Broadbent; Alain Tapp (SIGACT News, 2008)

Universal Blind Quantum Computation. - Anne Broadbent; Joseph F. Fitzsimons; Elham Kashefi (FOCS, 2009)

Parallelizing quantum circuits. - Anne Broadbent; Elham Kashefi (Theor. Comput. Sci., 2009)

Measurement-Based and Universal Blind Quantum Computation. - Anne Broadbent; Joseph F. Fitzsimons; Elham Kashefi (SFM, 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)

Trading Robustness for Correctness and Privacy in Certain Multiparty Computations, beyond an Honest Majority. - Anne Broadbent; Stacey Jeffery; Samuel Ranellucci; Alain Tapp (ICITS, 2012)

Quantum One-Time Programs - (Extended Abstract). - Anne Broadbent; Gus Gutoski; Douglas Stebila (CRYPTO (2), 2013)

Quantum one-time programs. - Anne Broadbent; Gus Gutoski; Douglas Stebila (IACR Cryptol. ePrint Arch., 2013)

Classical, quantum and nonsignalling resources in bipartite games. - Gilles Brassard; Anne Broadbent; Esther Hänggi; André Allan Méthot; Stefan Wolf 001 (Theor. Comput. Sci., 2013)

Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity. - Anne Broadbent; Stacey Jeffery (CRYPTO (2), 2015)

Quantum Cryptography Beyond Quantum Key Distribution. - Anne Broadbent; Christian Schaffner (IACR Cryptol. ePrint Arch., 2015)

Quantum Private Information Retrieval has Linear Communication Complexity. - Ämin Baumeler; Anne Broadbent (J. Cryptol., 2015)

Zero-Knowledge Proof Systems for QMA. - Anne Broadbent; Zhengfeng Ji; Fang Song 001; John Watrous (FOCS, 2016)

Computational Security of Quantum Encryption. - Gorjan Alagic; Anne Broadbent; Bill Fefferman; Tommaso Gagliardoni; Christian Schaffner; Michael St. Jules (ICITS, 2016)

Efficient Simulation for Quantum Message Authentication. - Anne Broadbent; Evelyn Wainewright (ICITS, 2016)

How to Verify a Quantum Computation. - Anne Broadbent (Theory Comput., 2018)

Zero-Knowledge for QMA from Locally Simulatable Proofs. - Anne Broadbent; Alex B. Grilo (CoRR, 2019)

Uncloneable Quantum Encryption via Random Oracles. - Anne Broadbent; Sébastien Lord (IACR Cryptol. ePrint Arch., 2019)

QMA-hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge. - Anne Broadbent; Alex B. Grilo (FOCS, 2020)

Quantum Encryption with Certified Deletion. - Anne Broadbent; Rabib Islam (TCC (3), 2020)

Towards Quantum One-Time Memories from Stateless Hardware. - Anne Broadbent; Sevag Gharibian; Hong-Sheng Zhou (TQC, 2020)

Uncloneable Quantum Encryption via Oracles. - Anne Broadbent; Sébastien Lord (TQC, 2020)

Indistinguishability obfuscation for quantum circuits of low T-count. - Anne Broadbent; Raza Ali Kazmi (IACR Cryptol. ePrint Arch., 2020)

Constructions for Quantum Indistinguishability Obfuscation. - Anne Broadbent; Raza Ali Kazmi (LATINCRYPT, 2021)

Password authentication schemes on a quantum computer. - Sherry Wang; Carlisle Adams; Anne Broadbent (QCE, 2021)

Secure Software Leasing Without Assumptions. - Anne Broadbent; Stacey Jeffery; Sébastien Lord; Supartha Podder; Aarthi Sundaram (TCC (1), 2021)

Categorical composable cryptography. - Anne Broadbent; Martti Karvonen (FoSSaCS, 2022)

Rigidity for Monogamy-Of-Entanglement Games. - Anne Broadbent; Eric Culf (ITCS, 2023)

Extending the Known Region of Nonlocal Boxes that Collapse Communication Complexity. - Marc-Olivier Proulx; Anne Broadbent; Pierre Botteron (CoRR, 2023)

Uncloneable Cryptographic Primitives with Interaction. - Anne Broadbent; Eric Culf (CoRR, 2023)

Categorical composable cryptography: extended version. - Anne Broadbent; Martti Karvonen (Log. Methods Comput. Sci., 2023)

A Quantum Vault Scheme for Digital Currency. - Anne Broadbent; Raza Ali Kazmi; Cyrus Minwalla (QCE, 2024)

Secret Addressing Scheme using Distributed Quantum Computing. - Jyoti Faujdar; Muhammad Asad Ullah; Mbarka Soualhia; Anne Broadbent (QCE, 2024)

Demonstrating Quantum Homomorphic Encryption Through Simulation. - Sohrab Ganjian; Connor Paddock; Anne Broadbent (QCE, 2024)

Simulation of Quantum Homomorphic Encryption: Demonstration and Analysis. - Sohrab Ganjian; Connor Paddock; Anne Broadbent (TPS-ISA, 2024)

Quantum Delegation with an Off-The-Shelf Device. - Anne Broadbent; Arthur Mehta; Yuming Zhao (TQC, 2024)

Uncloneable Quantum Advice. - Anne Broadbent; Martti Karvonen; Sébastien Lord (IACR Commun. Cryptol., 2024)

Algebra of Nonlocal Boxes and the Collapse of Communication Complexity. - Pierre Botteron; Anne Broadbent; Reda Chhaibi; Ion Nechita; Clément Pellegrini (Quantum, 2024)

Guest Editorial The Quantum Internet: Principles, Protocols and Architectures. - Angela Sara Cacciapuoti; Anne Broadbent; Eleni Diamanti; Jacquiline Romero; Stephanie Wehner (IEEE J. Sel. Areas Commun., 2024)

The Role of Piracy in Quantum Proofs. - Anne Broadbent; Alex B. Grilo; Supartha Podder; Jamie Sikora (LATINCRYPT, 2025)