Author: kimworrall
-
Classical Pseudo-Random Number Generation
Introduction Classical pseudo-random number generation runs a pseudo-random number generator (PRNG) on a classical machine that pseudo-randomly samples numbers from a space given an input seed. Outline N/A Assumptions The distribution of the numbers output from is sufficiently statistically close to random. Notation No content has been added to this section, yet! Properties No content…
-
Provably Secure Symmetric Private Information Retrieval with Quantum Cryptography
implements (Symmetric) Private Information Retrieval Introduction This protocol [1] implements symmetric private information retrieval (SPIR) and has unconditional security (a.k.a. information-theoretic security). It is a quantum multi-database one-round protocol, based on a classical multi-database SPIR protocol. It uses quantum key distribution (QKD) to share randomness between servers and to secure classical channels between the user…
-
Prepare-and-Send Verifiable Quantum Fully Homomorphic Encryption
implements Secure Verifiable Client-Server Delegated Quantum Computation Introduction This example protocol[1], implements Prepare-and-Send Quantum Fully Homomorphic Encryption[2] protocol with the additional property that it may be verified, where it is checked if the final ciphertext produces by the server matches the results of a particular computation. QFHE is a protocol where any arbitrary computations can…
-
Measurement-Only Verifiable Universal Blind Quantum Computation
implements Secure Verifiable Client-Server Delegated Quantum Computation Introduction The protocol [1] achieves the functionality of Secure Verifiable Delegated Quantum Computation which is the task of assigning quantum computation to an untrusted device while maintaining privacy of the computation. This protocol allows the client to verify the correctness of the blind delegated quantum computing with high…