Anne Broadbent

Orcid: 0000-0003-1911-0093

Affiliations:
  • University of Ottawa, Department of Mathematics and Statistics, ON, Canada


According to our database1, Anne Broadbent authored at least 44 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Guest Editorial The Quantum Internet: Principles, Protocols and Architectures.
IEEE J. Sel. Areas Commun., July, 2024

The Role of piracy in quantum proofs.
CoRR, 2024

Uncloneable Quantum Advice.
IACR Commun. Cryptol., 2024

Quantum Delegation with an Off-The-Shelf Device.
Proceedings of the 19th Conference on the Theory of Quantum Computation, 2024

2023
Categorical composable cryptography: extended version.
Log. Methods Comput. Sci., 2023

Algebra of Nonlocal Boxes and the Collapse of Communication Complexity.
CoRR, 2023

Uncloneable Cryptographic Primitives with Interaction.
CoRR, 2023

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

Rigidity for Monogamy-Of-Entanglement Games.
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.
SIAM J. Comput., August, 2022

Categorical composable cryptography.
Proceedings of the Foundations of Software Science and Computation Structures, 2022

2021
Towards Quantum One-Time Memories from Stateless Hardware.
Quantum, 2021

Secure Software Leasing Without Assumptions.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Password authentication schemes on a quantum computer.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2021

Constructions for Quantum Indistinguishability Obfuscation.
Proceedings of the Progress in Cryptology - LATINCRYPT 2021, 2021

2020
Zero-Knowledge Proof Systems for QMA.
SIAM J. Comput., 2020

Indistinguishability obfuscation for quantum circuits of low T-count.
IACR Cryptol. ePrint Arch., 2020

Quantum encryption with certified deletion.
IACR Cryptol. ePrint Arch., 2020

Uncloneable Quantum Encryption via Oracles.
Proceedings of the 15th Conference on the Theory of Quantum Computation, 2020

2019
Uncloneable Quantum Encryption via Random Oracles.
IACR Cryptol. ePrint Arch., 2019

Zero-Knowledge for QMA from Locally Simulatable Proofs.
CoRR, 2019

2018
How to Verify a Quantum Computation.
Theory Comput., 2018

2016
Computational Security of Quantum Encryption.
IACR Cryptol. ePrint Arch., 2016

Quantum cryptography beyond quantum key distribution.
Des. Codes Cryptogr., 2016

Efficient Simulation for Quantum Message Authentication.
Proceedings of the Information Theoretic Security - 9th International Conference, 2016

2015
Quantum Private Information Retrieval has Linear Communication Complexity.
J. Cryptol., 2015

Quantum homomorphic encryption for circuits of low T-gate complexity.
IACR Cryptol. ePrint Arch., 2015

2013
Classical, quantum and nonsignalling resources in bipartite games.
Theor. Comput. Sci., 2013

Quantum one-time programs.
IACR Cryptol. ePrint Arch., 2013

Quantum One-Time Programs - (Extended Abstract).
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012
Trading Robustness for Correctness and Privacy in Certain Multiparty Computations, beyond an Honest Majority.
Proceedings of the Information Theoretic Security - 6th International Conference, 2012

2010
Exact, Efficient and Information-Theoretically Secure Voting with an Arbitrary Number of Cheaters.
IACR Cryptol. ePrint Arch., 2010

Measurement-Based and Universal Blind Quantum Computation.
Proceedings of the Formal Methods for Quantitative Aspects of Programming Languages, 2010

2009
Parallelizing quantum circuits.
Theor. Comput. Sci., 2009

Universal Blind Quantum Computation.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008
Can quantum mechanics help distributed computing?
SIGACT News, 2008

Information-Theoretically Secure Voting Without an Honest Majority.
IACR Cryptol. ePrint Arch., 2008

Classical, Quantum and Non-signalling Resources in Bipartite Games.
Proceedings of the Second International Conference on Quantum, 2008

2007
Anonymous Quantum Communication - (Extended Abstract).
Proceedings of the Information Theoretic Security - Second International Conference, 2007

Information-Theoretic Security Without an Honest Majority.
Proceedings of the Advances in Cryptology, 2007

Anonymous Quantum Communication.
Proceedings of the Advances in Cryptology, 2007

2006
On the power of non-local boxes.
Theor. Comput. Sci., 2006

2005
Recasting mermin's multi-player game into the framework of pseudo-telepathy.
Quantum Inf. Comput., 2005

2003
Multi-party Pseudo-Telepathy.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003


  Loading...