4 citations · 18 across the 24 of their papers we have counts for
5 papers · 1 filter
The Knowledge Complexity of Quantum Problems
Giulio Malavolta
Foundational results in theoretical computer science have established that everything provable, is provable in zero knowledge. However, this assertion fundamentally assumes a class…
Computational Monogamy of Entanglement and Non-Interactive Quantum Key Distribution
Alex B. Grilo, Giulio Malavolta, Michael Walter +1
Quantum key distribution (QKD) enables Alice and Bob to exchange a secret key over a public, untrusted quantum channel. Compared to classical key exchange, QKD achieves everlasting…
Succinct Oblivious Tensor Evaluation and Applications: Adaptively-Secure Laconic Function Evaluation and Trapdoor Hashing for All Circuits
Damiano Abram, Giulio Malavolta, Lawrence Roy
We propose the notion of succinct oblivious tensor evaluation (OTE), where two parties compute an additive secret sharing of a tensor product of two vectors $\mathbf{x} \otimes \ma…
MPC in the Quantum Head (or: Superposition-Secure (Quantum) Zero-Knowledge)
Andrea Coladangelo, Ruta Jawale, Dakshita Khurana +2
The MPC-in-the-head technique (Ishai et al., STOC 2007) is a celebrated method to build zero-knowledge protocols with desirable theoretical properties and high practical efficiency…
How to Verify that a Small Device is Quantum, Unconditionally
Giulio Malavolta, Tamer Mour
A proof of quantumness (PoQ) allows a classical verifier to efficiently test if a quantum machine is performing a computation that is infeasible for any classical machine. In this…