default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrea Coladangelo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Andrea Coladangelo, Alex B. Grilo, Stacey Jeffery, Thomas Vidick:
Verifier-on-a-Leash: New Schemes for Verifiable Delegated Quantum Computation, with Quasilinear Resources. Theory Comput. 20: 1-87 (2024)- [c10]Atul Singh Arora, Kishor Bharti, Alexandru Cojocaru, Andrea Coladangelo:
A Computational Test of Contextuality and, Even Simpler Proofs of Quantumness. FOCS 2024: 1106-1125 - [c9]Andrea Coladangelo
, Sam Gunn:
How to Use Quantum Indistinguishability Obfuscation. STOC 2024: 1003-1008 - [c8]Andrea Coladangelo, Saachi Mutreja:
On Black-Box Separations of Quantum Digital Signatures from Pseudorandom States. TCC (3) 2024: 289-317 - [i22]Andrea Coladangelo, Saachi Mutreja:
On black-box separations of quantum digital signatures from pseudorandom states. CoRR abs/2402.08194 (2024) - [i21]Boyang Chen, Andrea Coladangelo, Or Sattath:
The power of a single Haar random state: constructing and separating quantum pseudorandomness. CoRR abs/2404.03295 (2024) - [i20]Atul Singh Arora, Kishor Bharti, Alexandru Cojocaru, Andrea Coladangelo:
A computational test of quantum contextuality, and even simpler proofs of quantumness. CoRR abs/2405.06787 (2024) - 2023
- [c7]Atul Singh Arora, Andrea Coladangelo, Matthew Coudron, Alexandru Gheorghiu, Uttam Singh, Hendrik Waldner:
Quantum Depth in the Random Oracle Model. STOC 2023: 1111-1124 - [i19]Andrea Coladangelo:
Quantum trapdoor functions from classical one-way functions. CoRR abs/2302.12821 (2023) - [i18]Andrea Coladangelo, Sam Gunn:
How to Use Quantum Indistinguishability Obfuscation. CoRR abs/2311.07794 (2023) - [i17]Andrea Coladangelo:
Quantum trapdoor functions from classical one-way functions. IACR Cryptol. ePrint Arch. 2023: 282 (2023) - [i16]Andrea Coladangelo, Sam Gunn:
How to Use Quantum Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2023: 1756 (2023) - 2022
- [c6]Andrea Coladangelo, Shafi Goldwasser, Umesh V. Vazirani:
Deniable encryption in a Quantum world. STOC 2022: 1378-1391 - [i15]Atul Singh Arora, Andrea Coladangelo, Matthew Coudron, Alexandru Gheorghiu, Uttam Singh, Hendrik Waldner:
Quantum Depth in the Random Oracle Model. CoRR abs/2210.06454 (2022) - 2021
- [c5]James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma:
On the Round Complexity of Secure Quantum Computation. CRYPTO (1) 2021: 406-435 - [c4]James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma:
One-Way Functions Imply Secure Computation in a Quantum World. CRYPTO (1) 2021: 467-496 - [c3]Andrea Coladangelo, Jiahui Liu, Qipeng Liu, Mark Zhandry:
Hidden Cosets and Applications to Unclonable Cryptography. CRYPTO (1) 2021: 556-584 - [i14]Andrea Coladangelo, Jiahui Liu, Qipeng Liu, Mark Zhandry:
Hidden Cosets and Applications to Unclonable Cryptography. CoRR abs/2107.05692 (2021) - [i13]Andrea Coladangelo, Shafi Goldwasser, Umesh V. Vazirani:
Deniable Encryption in a Quantum World. CoRR abs/2112.14988 (2021) - [i12]Andrea Coladangelo, Jiahui Liu, Qipeng Liu, Mark Zhandry:
Hidden Cosets and Applications to Unclonable Cryptography. IACR Cryptol. ePrint Arch. 2021: 946 (2021) - 2020
- [j3]Andrea Coladangelo:
A two-player dimension witness based on embezzlement, and an elementary proof of the non-closure of the set of quantum correlations. Quantum 4: 282 (2020) - [j2]Andrea Coladangelo, Or Sattath:
A Quantum Money Solution to the Blockchain Scalability Problem. Quantum 4: 297 (2020) - [c2]Andrea Coladangelo, Thomas Vidick, Tina Zhang:
Non-interactive Zero-Knowledge Arguments for QMA, with Preprocessing. CRYPTO (3) 2020: 799-828 - [i11]Andrea Coladangelo, Or Sattath:
A Quantum Money Solution to the Blockchain Scalability Problem. CoRR abs/2002.11998 (2020) - [i10]Andrea Coladangelo, Christian Majenz, Alexander Poremba:
Quantum copy-protection of compute-and-compare programs in the quantum random oracle model. CoRR abs/2009.13865 (2020) - [i9]James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma:
On The Round Complexity of Two-Party Quantum Computation. CoRR abs/2011.11212 (2020) - [i8]James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma:
One-Way Functions Imply Secure Computation in a Quantum World. CoRR abs/2011.13486 (2020) - [i7]Andrea Coladangelo, Christian Majenz, Alexander Poremba:
Quantum copy-protection of compute-and-compare programs in the quantum random oracle model. IACR Cryptol. ePrint Arch. 2020: 1194 (2020) - [i6]James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma:
On The Round Complexity of Two-Party Quantum Computation. IACR Cryptol. ePrint Arch. 2020: 1471 (2020) - [i5]James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma:
One-Way Functions Imply Secure Computation in a Quantum World. IACR Cryptol. ePrint Arch. 2020: 1487 (2020)
2010 – 2019
- 2019
- [c1]Andrea Coladangelo, Alex Bredariol Grilo, Stacey Jeffery, Thomas Vidick:
Verifier-on-a-Leash: New Schemes for Verifiable Delegated Quantum Computation, with Quasilinear Resources. EUROCRYPT (3) 2019: 247-277 - [i4]Andrea Coladangelo:
Smart contracts meet quantum cryptography. CoRR abs/1902.05214 (2019) - [i3]Andrea Coladangelo, Thomas Vidick, Tina Zhang:
Non-interactive zero-knowledge arguments for QMA, with preprocessing. CoRR abs/1911.07546 (2019) - [i2]Andrea Coladangelo, Alex Bredariol Grilo, Stacey Jeffery, Thomas Vidick:
Verifier-on-a-Leash: new schemes for verifiable delegated quantum computation, with quasilinear resources. IACR Cryptol. ePrint Arch. 2019: 247 (2019) - 2017
- [j1]Andrea Coladangelo:
Parallel self-testing of (tilted) EPR pairs via copies of (tilted) CHSH and the magic square game. Quantum Inf. Comput. 17(9&10): 831-865 (2017) - [i1]Andrea Coladangelo, Alex B. Grilo, Stacey Jeffery, Thomas Vidick:
Verifier-on-a-Leash: new schemes for verifiable delegated quantum computation, with quasilinear resources. CoRR abs/1708.07359 (2017)
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-12-13 19:11 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:
