Lossy cryptography from code-based assumptions
Over the past few decades, we have seen a proliferation of advanced cryptographic
primitives with lossy or homomorphic properties built from various assumptions such as …
primitives with lossy or homomorphic properties built from various assumptions such as …
How to construct quantum fhe, generically
A Gupte, V Vaikuntanathan - Annual International Cryptology Conference, 2024 - Springer
We construct a (compact) quantum fully homomorphic encryption (QFHE) scheme starting
from any (compact) classical fully homomorphic encryption scheme with decryption in NC 1 …
from any (compact) classical fully homomorphic encryption scheme with decryption in NC 1 …
Quantum money from abelian group actions
M Zhandry - arXiv preprint arXiv:2307.12120, 2023 - arxiv.org
We give a candidate construction of public key quantum money, and even a strengthened
version called quantum lightning, from abelian group actions, which can in turn be …
version called quantum lightning, from abelian group actions, which can in turn be …
Simple tests of quantumness also certify qubits
Z Brakerski, A Gheorghiu… - Annual International …, 2023 - Springer
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a
prover is not classical. We show that tests of quantumness that follow a certain template …
prover is not classical. We show that tests of quantumness that follow a certain template …
Quantum state group actions
S Mutreja, M Zhandry - arXiv preprint arXiv:2410.08547, 2024 - arxiv.org
Cryptographic group actions are a leading contender for post-quantum cryptography, and
have also been used in the development of quantum cryptographic protocols. In this work …
have also been used in the development of quantum cryptographic protocols. In this work …
Single-Round Proofs of Quantumness from Knowledge Assumptions
A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum
computer can pass, but all efficient classical computers cannot (under some cryptographic …
computer can pass, but all efficient classical computers cannot (under some cryptographic …
On the Power of Oblivious State Preparation
J Bartusek, D Khurana - arXiv preprint arXiv:2411.04234, 2024 - arxiv.org
We put forth Oblivious State Preparation (OSP) as a cryptographic primitive that unifies
techniques developed in the context of a quantum server interacting with a classical client …
techniques developed in the context of a quantum server interacting with a classical client …
Compiled Nonlocal Games from any Trapdoor Claw-Free Function
A recent work of Kalai et al.(STOC 2023) shows how to compile any multi-player nonlocal
game into a protocol with a single computationally-bounded prover. Subsequent works have …
game into a protocol with a single computationally-bounded prover. Subsequent works have …
Hidden-State Proofs of Quantumness
CA Miller - arXiv preprint arXiv:2410.06368, 2024 - arxiv.org
An experimental cryptographic proof of quantumness will be a vital milestone in the progress
of quantum information science. Error tolerance is a persistent challenge for implementing …
of quantum information science. Error tolerance is a persistent challenge for implementing …
Post-quantum -to-1 trapdoor claw-free functions from extrapolated dihedral cosets
X Yan, L Wang, L Gu, Z Li, J Suo - Quantum Information Processing, 2024 - Springer
Noisy trapdoor claw-free function (NTCF) is a powerful post-quantum cryptographic tool that
can efficiently constrain actions of untrusted quantum devices within a classical–quantum …
can efficiently constrain actions of untrusted quantum devices within a classical–quantum …