Quantum cryptography beyond quantum key distribution
Quantum cryptography is the art and science of exploiting quantum mechanical effects in
order to perform cryptographic tasks. While the most well-known example of this discipline is …
order to perform cryptographic tasks. While the most well-known example of this discipline is …
DualRing: Generic Construction of Ring Signatures with Efficient Instantiations
We introduce a novel generic ring signature construction, called DualRing, which can be
built from several canonical identification schemes (such as Schnorr identification) …
built from several canonical identification schemes (such as Schnorr identification) …
Quantum homomorphic encryption for circuits of low T-gate complexity
Fully homomorphic encryption is an encryption method with the property that any
computation on the plaintext can be performed by a party having access to the ciphertext …
computation on the plaintext can be performed by a party having access to the ciphertext …
Oblivious transfer is in MiniQCrypt
MiniQCrypt is a world where quantum-secure one-way functions exist, and quantum
communication is possible. We construct an oblivious transfer (OT) protocol in MiniQCrypt …
communication is possible. We construct an oblivious transfer (OT) protocol in MiniQCrypt …
One-way functions imply secure computation in a quantum world
We prove that quantum-hard one-way functions imply simulation-secure quantum oblivious
transfer (QOT), which is known to suffice for secure computation of arbitrary quantum …
transfer (QOT), which is known to suffice for secure computation of arbitrary quantum …
Quantum homomorphic encryption for polynomial-sized circuits
We present a new scheme for quantum homomorphic encryption which is compact and
allows for efficient evaluation of arbitrary polynomial-sized quantum circuits. Building on the …
allows for efficient evaluation of arbitrary polynomial-sized quantum circuits. Building on the …
Post-quantum zero knowledge in constant rounds
N Bitansky, O Shmueli - Proceedings of the 52nd Annual ACM SIGACT …, 2020 - dl.acm.org
We construct a constant-round zero-knowledge classical argument for NP secure against
quantum attacks. We assume the existence of Quantum Fully-Homomorphic Encryption and …
quantum attacks. We assume the existence of Quantum Fully-Homomorphic Encryption and …
Secure multi-party quantum computation with a dishonest majority
The cryptographic task of secure multi-party (classical) computation has received a lot of
attention in the last decades. Even in the extreme case where a computation is performed …
attention in the last decades. Even in the extreme case where a computation is performed …
Quantum anonymous private information retrieval for distributed networks
Quantum cybersecurity is the study of all facets regarding the security of communication and
computation in a distributed network. Significant developments in quantum technologies …
computation in a distributed network. Significant developments in quantum technologies …
Obfuscation of pseudo-deterministic quantum circuits
We show how to obfuscate pseudo-deterministic quantum circuits, assuming the quantum
hardness of learning with errors (QLWE) and post-quantum virtual black-box (VBB) …
hardness of learning with errors (QLWE) and post-quantum virtual black-box (VBB) …