3 citations · 3 across the 2 of their papers we have counts for
3 papers
quant-ph2025
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…
quant-ph2024★ 3 cited
A New World in the Depths of Microcrypt: Separating OWSGs and Quantum Money from QEFID
Amit Behera, Giulio Malavolta, Tomoyuki Morimae +2
While in classical cryptography, one-way functions (OWFs) are widely regarded as the "minimal assumption," the situation in quantum cryptography is less clear. Recent works have pu…
cs.CR2018
Sub-logarithmic Distributed Oblivious RAM with Small Block Size
Eyal Kushilevitz, Tamer Mour
Oblivious RAM (ORAM) is a cryptographic primitive that allows a client to securely execute RAM programs over data that is stored in an untrusted server. Distributed Oblivious RAM i…