Alex Bredariol Grilo

Affiliations:
  • Centrum Wiskunde & Informatica, Amsterdam, The Netherlands
  • QuSoft, Amsterdam, The Netherlands


According to our database1, Alex Bredariol Grilo authored at least 26 papers between 2016 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Encryption with Quantum Public Keys.
IACR Cryptol. ePrint Arch., 2023

Towards the Impossibility of Quantum Public Key Encryption with Classical Keys from One-Way Functions.
IACR Cryptol. ePrint Arch., 2023

Public-Key Encryption with Quantum Keys.
IACR Cryptol. ePrint Arch., 2023

2022
QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge.
SIAM J. Comput., August, 2022

Quantum security of subset cover problems.
IACR Cryptol. ePrint Arch., 2022

Post-Quantum Zero-Knowledge with Space-Bounded Simulation.
IACR Cryptol. ePrint Arch., 2022

2021
Two Combinatorial MA-Complete Problems.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020
Oblivious Transfer is in MiniQCrypt.
IACR Cryptol. ePrint Arch., 2020

Tight adaptive reprogramming in the QROM.
IACR Cryptol. ePrint Arch., 2020

Non-interactive classical verification of quantum computation.
IACR Cryptol. ePrint Arch., 2020

Quantum learning algorithms imply circuit lower bounds.
Electron. Colloquium Comput. Complex., 2020

A combinatorial MA-complete problem.
Electron. Colloquium Comput. Complex., 2020

StoqMA vs. MA: the power of error reduction.
CoRR, 2020

Quantum statistical query learning.
CoRR, 2020

2019
Secure Multi-party Quantum Computation with a Dishonest Majority.
IACR Cryptol. ePrint Arch., 2019

Verifier-on-a-Leash: new schemes for verifiable delegated quantum computation, with quasilinear resources.
IACR Cryptol. ePrint Arch., 2019

Perfect zero knowledge for quantum multiprover interactive proofs.
Electron. Colloquium Comput. Complex., 2019

Quantum hardness of learning shallow classical circuits.
Electron. Colloquium Comput. Complex., 2019

Stoquastic PCP vs. Randomness.
Electron. Colloquium Comput. Complex., 2019

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

A Simple Protocol for Verifiable Delegation of Quantum Computation in One Round.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Quantum proofs, the local Hamiltonian problem and applications. (Preuves quantiques, le problème des Hamiltoniens locaux et applications).
PhD thesis, 2018

2017
Relativistic verifiable delegation of quantum computation.
CoRR, 2017

Learning with Errors is easy with quantum samples.
CoRR, 2017

2016
QMA with Subset State Witnesses.
Chic. J. Theor. Comput. Sci., 2016

Pointer Quantum PCPs and Multi-Prover Games.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016


  Loading...