default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnne Broadbent
Person information
- affiliation: University of Ottawa, Department of Mathematics and Statistics, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Anne Broadbent
, Martti Karvonen, Sébastien Lord:
Uncloneable Quantum Advice. IACR Commun. Cryptol. 1(3): 18 (2024)- [j13]Angela Sara Cacciapuoti, Anne Broadbent, Eleni Diamanti, Jacquiline Romero, Stephanie Wehner:
Guest Editorial The Quantum Internet: Principles, Protocols and Architectures. IEEE J. Sel. Areas Commun. 42(7): 1719-1722 (2024) - [c23]Anne Broadbent, Arthur Mehta, Yuming Zhao:
Quantum Delegation with an Off-The-Shelf Device. TQC 2024: 12:1-12:23 - 2023
- [j12]Anne Broadbent, Martti Karvonen:
Categorical composable cryptography: extended version. Log. Methods Comput. Sci. 19(4) (2023) - [c22]Anne Broadbent, Eric Culf:
Rigidity for Monogamy-Of-Entanglement Games. ITCS 2023: 28:1-28:29 - [i24]Marc-Olivier Proulx, Anne Broadbent, Pierre Botteron:
Extending the Known Region of Nonlocal Boxes that Collapse Communication Complexity. CoRR abs/2302.00488 (2023) - [i23]Anne Broadbent, Eric Culf:
Uncloneable Cryptographic Primitives with Interaction. CoRR abs/2303.00048 (2023) - [i22]Anne Broadbent, Arthur Mehta, Yuming Zhao:
Quantum delegation with an off-the-shelf device. CoRR abs/2304.03448 (2023) - [i21]Anne Broadbent, Martti Karvonen, Sébastien Lord:
Uncloneable Quantum Advice. CoRR abs/2309.05155 (2023) - [i20]Pierre Botteron, Anne Broadbent, Reda Chhaibi, Ion Nechita, Clément Pellegrini:
Algebra of Nonlocal Boxes and the Collapse of Communication Complexity. CoRR abs/2312.00725 (2023) - 2022
- [j11]Anne Broadbent, Alex Bredariol Grilo:
QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge. SIAM J. Comput. 51(4): 1400-1450 (2022) - [c21]Anne Broadbent, Martti Karvonen:
Categorical composable cryptography. FoSSaCS 2022: 161-183 - [i19]Anne Broadbent, Martti Karvonen:
Categorical composable cryptography: extended version. CoRR abs/2208.13232 (2022) - 2021
- [j10]Anne Broadbent, Sevag Gharibian, Hong-Sheng Zhou:
Towards Quantum One-Time Memories from Stateless Hardware. Quantum 5: 429 (2021) - [c20]Anne Broadbent, Raza Ali Kazmi:
Constructions for Quantum Indistinguishability Obfuscation. LATINCRYPT 2021: 24-43 - [c19]Sherry Wang, Carlisle Adams, Anne Broadbent:
Password authentication schemes on a quantum computer. QCE 2021: 346-350 - [c18]Anne Broadbent, Stacey Jeffery, Sébastien Lord, Supartha Podder, Aarthi Sundaram:
Secure Software Leasing Without Assumptions. TCC (1) 2021: 90-120 - [i18]Anne Broadbent, Martti Karvonen:
Categorical composable cryptography. CoRR abs/2105.05949 (2021) - 2020
- [j9]Anne Broadbent, Zhengfeng Ji, Fang Song, John Watrous:
Zero-Knowledge Proof Systems for QMA. SIAM J. Comput. 49(2): 245-283 (2020) - [c17]Anne Broadbent, Alex B. Grilo:
QMA-hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge. FOCS 2020: 196-205 - [c16]Anne Broadbent, Rabib Islam:
Quantum Encryption with Certified Deletion. TCC (3) 2020: 92-122 - [c15]Anne Broadbent, Sébastien Lord:
Uncloneable Quantum Encryption via Oracles. TQC 2020: 4:1-4:22 - [c14]Anne Broadbent, Sevag Gharibian, Hong-Sheng Zhou:
Towards Quantum One-Time Memories from Stateless Hardware. TQC 2020: 6:1-6:25 - [i17]Anne Broadbent, Raza Ali Kazmi:
Indistinguishability obfuscation for quantum circuits of low T-count. IACR Cryptol. ePrint Arch. 2020: 639 (2020) - [i16]Anne Broadbent, Rabib Islam:
Quantum encryption with certified deletion. IACR Cryptol. ePrint Arch. 2020: 1423 (2020)
2010 – 2019
- 2019
- [i15]Anne Broadbent, Alex B. Grilo:
Zero-Knowledge for QMA from Locally Simulatable Proofs. CoRR abs/1911.07782 (2019) - [i14]Anne Broadbent, Sébastien Lord:
Uncloneable Quantum Encryption via Random Oracles. IACR Cryptol. ePrint Arch. 2019: 257 (2019) - 2018
- [j8]Anne Broadbent:
How to Verify a Quantum Computation. Theory Comput. 14(1): 1-37 (2018) - [i13]Anne Broadbent, Sevag Gharibian, Hong-Sheng Zhou:
Towards Quantum One-Time Memories from Stateless Hardware. IACR Cryptol. ePrint Arch. 2018: 960 (2018) - 2016
- [j7]Anne Broadbent, Christian Schaffner:
Quantum cryptography beyond quantum key distribution. Des. Codes Cryptogr. 78(1): 351-382 (2016) - [c13]Anne Broadbent, Zhengfeng Ji, Fang Song, John Watrous:
Zero-Knowledge Proof Systems for QMA. FOCS 2016: 31-40 - [c12]Gorjan Alagic, Anne Broadbent, Bill Fefferman, Tommaso Gagliardoni, Christian Schaffner, Michael St. Jules:
Computational Security of Quantum Encryption. ICITS 2016: 47-71 - [c11]Anne Broadbent, Evelyn Wainewright:
Efficient Simulation for Quantum Message Authentication. ICITS 2016: 72-91 - [e1]Anne Broadbent:
11th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2016, September 27-29, 2016, Berlin, Germany. LIPIcs 61, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-019-4 [contents] - [i12]Gorjan Alagic, Anne Broadbent, Bill Fefferman, Tommaso Gagliardoni, Christian Schaffner, Michael St. Jules:
Computational Security of Quantum Encryption. CoRR abs/1602.01441 (2016) - [i11]Anne Broadbent, Zheng-Feng Ji, Fang Song, John Watrous:
Zero-knowledge proof systems for QMA. CoRR abs/1604.02804 (2016) - [i10]Gorjan Alagic, Anne Broadbent, Bill Fefferman, Tommaso Gagliardoni, Christian Schaffner, Michael St. Jules:
Computational Security of Quantum Encryption. IACR Cryptol. ePrint Arch. 2016: 424 (2016) - 2015
- [j6]Ämin Baumeler, Anne Broadbent:
Quantum Private Information Retrieval has Linear Communication Complexity. J. Cryptol. 28(1): 161-175 (2015) - [c10]Anne Broadbent, Stacey Jeffery:
Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity. CRYPTO (2) 2015: 609-629 - [i9]Anne Broadbent, Stacey Jeffery:
Quantum homomorphic encryption for circuits of low T-gate complexity. IACR Cryptol. ePrint Arch. 2015: 551 (2015) - [i8]Anne Broadbent, Christian Schaffner:
Quantum Cryptography Beyond Quantum Key Distribution. IACR Cryptol. ePrint Arch. 2015: 1242 (2015) - 2013
- [j5]Gilles Brassard, Anne Broadbent, Esther Hänggi, André Allan Méthot, Stefan Wolf:
Classical, quantum and nonsignalling resources in bipartite games. Theor. Comput. Sci. 486: 61-72 (2013) - [c9]Anne Broadbent, Gus Gutoski, Douglas Stebila:
Quantum One-Time Programs - (Extended Abstract). CRYPTO (2) 2013: 344-360 - [i7]Anne Broadbent, Gus Gutoski, Douglas Stebila:
Quantum one-time programs. IACR Cryptol. ePrint Arch. 2013: 343 (2013) - 2012
- [c8]Anne Broadbent, Stacey Jeffery, Samuel Ranellucci, Alain Tapp:
Trading Robustness for Correctness and Privacy in Certain Multiparty Computations, beyond an Honest Majority. ICITS 2012: 14-36 - [i6]Anne Broadbent, Gus Gutoski, Douglas Stebila:
Quantum one-time programs. CoRR abs/1211.1080 (2012) - 2010
- [c7]Anne Broadbent, Joseph F. Fitzsimons, Elham Kashefi:
Measurement-Based and Universal Blind Quantum Computation. SFM 2010: 43-86 - [i5]Anne Broadbent, Stacey Jeffery, Alain Tapp:
Exact, Efficient and Information-Theoretically Secure Voting with an Arbitrary Number of Cheaters. CoRR abs/1011.5242 (2010) - [i4]Anne Broadbent, Stacey Jeffery, Alain Tapp:
Exact, Efficient and Information-Theoretically Secure Voting with an Arbitrary Number of Cheaters. IACR Cryptol. ePrint Arch. 2010: 600 (2010)
2000 – 2009
- 2009
- [j4]Anne Broadbent, Elham Kashefi:
Parallelizing quantum circuits. Theor. Comput. Sci. 410(26): 2489-2510 (2009) - [c6]Anne Broadbent, Joseph F. Fitzsimons, Elham Kashefi:
Universal Blind Quantum Computation. FOCS 2009: 517-526 - 2008
- [j3]Anne Broadbent, Alain Tapp:
Can quantum mechanics help distributed computing? SIGACT News 39(3): 67-76 (2008) - [c5]Gilles Brassard, Anne Broadbent, Esther Hänggi, André Allan Méthot, Stefan Wolf:
Classical, Quantum and Non-signalling Resources in Bipartite Games. ICQNM 2008: 80-89 - [i3]Anne Broadbent, Alain Tapp:
Information-Theoretically Secure Voting Without an Honest Majority. CoRR abs/0806.1931 (2008) - [i2]Anne Broadbent, Alain Tapp:
Information-Theoretically Secure Voting Without an Honest Majority. IACR Cryptol. ePrint Arch. 2008: 266 (2008) - 2007
- [c4]Anne Broadbent, Alain Tapp:
Information-Theoretic Security Without an Honest Majority. ASIACRYPT 2007: 410-426 - [c3]Gilles Brassard, Anne Broadbent, Joseph F. Fitzsimons, Sébastien Gambs, Alain Tapp:
Anonymous Quantum Communication. ASIACRYPT 2007: 460-473 - [c2]Gilles Brassard, Anne Broadbent, Joseph F. Fitzsimons, Sébastien Gambs, Alain Tapp:
Anonymous Quantum Communication - (Extended Abstract). ICITS 2007: 181-182 - [i1]Anne Broadbent, Alain Tapp:
Information-theoretic security without an honest majority. CoRR abs/0706.2010 (2007) - 2006
- [j2]Anne Broadbent, André Allan Méthot:
On the power of non-local boxes. Theor. Comput. Sci. 358(1): 3-14 (2006) - 2005
- [j1]Gilles Brassard, Anne Broadbent, Alain Tapp:
Recasting mermin's multi-player game into the framework of pseudo-telepathy. Quantum Inf. Comput. 5(7): 538-550 (2005) - 2003
- [c1]Gilles Brassard, Anne Broadbent, Alain Tapp:
Multi-party Pseudo-Telepathy. WADS 2003: 1-11
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
