Pseudorandom states, introduced by Ji, Liu and Song (Crypto’18), are efficiently-computable quantum states that computationally indistinguishable from Haar-random states. One-way functions imply the existence of pseudorandom but Kretschmer (TQC’20) recently constructed an oracle relative to which there no one-way still exist. Motivated this, we study intriguing possibility basing interesting cr...

In the classical world, existence of commitments is equivalent to one-way functions. quantum setting, on other hand, are not known imply functions, but all constructions use at least Are functions really necessary for in world? this work, we show that non-interactive (for messages) with computational hiding and statistical binding exist if pseudorandom states exist. Pseudorandom sets efficientl...

A central tenet of theoretical cryptography is the study of the minimal assumptions required to implement a given cryptographic primitive. One such primitive is the one-time memory (OTM), introduced by Goldwasser, Kalai, and Rothblum [CRYPTO 2008], which is a classical functionality modeled after a non-interactive 1-out-of-2 oblivious transfer, and which is complete for one-time classical and q...

In the formalism of measurement based quantum computation we start with a given fixed entangled state of many qubits and perform computation by applying a sequence of measurements to designated qubits in designated bases. The choice of basis for later measurements may depend on earlier measurement outcomes and the final result of the computation is determined from the classical data of all the ...

The problem of memory checking considers storing files on an unreliable public server whose memory can be modified by a malicious party. The main task is to design an online memory checker with the capability to verify that the information on the server has not been corrupted. To store n bits of public information, the memory checker has s private reliable bits for verification purpose; while t...

The outcomes of local measurements made on entangled systems can be certified to be random provided that the generated statistics violate a Bell inequality. This way of producing randomness relies only on a minimal set of assumptions because it is independent of the internal functioning of the devices generating the random outcomes. In this context it is crucial to understand both qualitatively...