Andrea Coladangelo

Orcid: 0000-0002-6773-2711

According to our database1, Andrea Coladangelo authored at least 20 papers between 2017 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
MPC in the Quantum Head (or: Superposition-Secure (Quantum) Zero-Knowledge).
CoRR, June, 2025

The Power of a Single Haar Random State: Constructing and Separating Quantum Pseudorandomness.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

2024
Quantum copy-protection of compute-and-compare programs in the quantum random oracle model.
Quantum, 2024

A computational test of quantum contextuality, and even simpler proofs of quantumness.
CoRR, 2024

On Black-Box Separations of Quantum Digital Signatures from Pseudorandom States.
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

How to Use Quantum Indistinguishability Obfuscation.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

A Computational Test of Contextuality and, Even Simpler Proofs of Quantumness.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023
Quantum trapdoor functions from classical one-way functions.
IACR Cryptol. ePrint Arch., 2023

Quantum Depth in the Random Oracle Model.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022
Deniable encryption in a Quantum world.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021
Hidden Cosets and Applications to Unclonable Cryptography.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

One-Way Functions Imply Secure Computation in a Quantum World.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

On the Round Complexity of Secure Quantum Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
A Quantum Money Solution to the Blockchain Scalability Problem.
Quantum, 2020

A two-player dimension witness based on embezzlement, and an elementary proof of the non-closure of the set of quantum correlations.
Quantum, 2020

On The Round Complexity of Two-Party Quantum Computation.
IACR Cryptol. ePrint Arch., 2020

Non-interactive Zero-Knowledge Arguments for QMA, with Preprocessing.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
Smart contracts meet quantum cryptography.
CoRR, 2019

Verifier-on-a-Leash: New Schemes for Verifiable Delegated Quantum Computation, with Quasilinear Resources.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

2017
Parallel self-testing of (tilted) EPR pairs via copies of (tilted) CHSH and the magic square game.
Quantum Inf. Comput., 2017


  Loading...