# Secure Quantum Extraction Protocols

@inproceedings{Ananth2019SecureQE,
title={Secure Quantum Extraction Protocols},
author={Prabhanjan Vijendra Ananth and Rolando L. La Placa},
booktitle={IACR Cryptology ePrint Archive},
year={2019}
}
• Published in
IACR Cryptology ePrint…
18 November 2019
• Computer Science, Mathematics
Knowledge extraction, typically studied in the classical setting, is at the heart of several cryptographic protocols. We introduce the notion of secure quantum extraction protocols. A secure quantum extraction protocol for an NP relation $\mathcal{R}$ is a classical interactive protocol between a sender and a receiver, where the sender gets the instance $z$ and a witness $w$, while the receiver only gets the instance $z$. For any efficient quantum adversarial sender (who follows the protocol…
15 Citations
• Computer Science, Mathematics
ArXiv
• 2020
The first constant-round post-quantum multi-party computation protocol for general classical functionalities in the plain model is obtained, with security against malicious corruptions, and a new straight-line non-black-box simulator against parallel verifiers that does not clone the adversary's state is built.
• Computer Science
EUROCRYPT
• 2021
It is proved that it is impossible to construct SSL schemes for an arbitrary class of quantum unlearnable functions and the existence of quantum VBB for classical circuits is ruled out, answering an open problem posed by [Alagic and Fefferman arXiv'16].
• Computer Science, Mathematics
IACR Cryptol. ePrint Arch.
• 2022
In this work, a fine-grained notion of post-quantum zero-knowledge is initiated that is more compatible with near-term quantum devices and establishes both positive and negative results.
• Computer Science, Mathematics
• 2021
The goal is to develop a mathematical model of the generator, which generates fast random numbers at a lower cost, and the model of a hybrid semi self-testing certification method for quantum random number generators (QRNG).
• Computer Science, Mathematics
IACR Cryptol. ePrint Arch.
• 2021
From the minimal assumption of post-quantum semi-honest oblivious transfers, we build the first ε-simulatable two-party computation (2PC) against quantum polynomial-time (QPT) adversaries that is
A generic construction of a lockable obfuscation scheme build from a (leveled) fully homomorphic encryption scheme that is circularly insecure, and shows that there is a connection in both ways between circular insecure encryption and lockables obfuscation.
• Mathematics, Computer Science
IACR Cryptol. ePrint Arch.
• 2021
This is the first protocol for constant-round statistical zero-knowledge arguments for QMA, and all of these protocols match the best round complexity known for the corresponding protocols for NP with post-quantum security.
• Computer Science, Mathematics
IACR Cryptol. ePrint Arch.
• 2021
At the heart of the results is a new general technique that allows to modularly obtain non-malleable commitments from any extractable commitment protocol, obliviously of the underlying extraction strategy ( black-box or non-black-box) or round complexity.
• Computer Science, Mathematics
IACR Cryptol. ePrint Arch.
• 2021
It is proved that any quantumly-resettably-sound zero-knowledge protocol for NP implies the impossibility of quantum obfuscation, giving an alternative proof to several recent results on quantum unobfuscatability.
• Computer Science, Mathematics
CRYPTO
• 2021
It is shown that, under the assumption that learning-with-errors (LWE) is hard for quantum computers, this quantum variant of virtual black-box obfuscation of classical circuits is generally impossible.

## References

SHOWING 1-10 OF 56 REFERENCES

• Computer Science, Mathematics
2014 IEEE 55th Annual Symposium on Foundations of Computer Science
• 2014
It is shown that classically secure proofs and proofs of knowledge are insecure in the quantum setting, and the "pick-one trick" is developed, a general technique that allows an adversary to find one value satisfying a given predicate, but not two.
• Computer Science, Mathematics
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
• 2018
The randomness protocol can be used as the basis for an efficiently verifiable "quantum supremacy" proposal, thus answering an outstanding challenge in the field.
• Computer Science, Mathematics
ArXiv
• 2020
The first constant-round post-quantum multi-party computation protocol for general classical functionalities in the plain model is obtained, with security against malicious corruptions, and a new straight-line non-black-box simulator against parallel verifiers that does not clone the adversary's state is built.
• Mathematics, Computer Science
ICALP
• 2008
We show that any problem that has a classical zero-knowledge protocol against the honest verifier also has, under a reasonable condition, a classical zero-knowledge protocol which is secure against
• Computer Science, Mathematics
IACR Cryptol. ePrint Arch.
• 2018
This work provides the first (presumed) post-quantum secure candidate and thus allows to instantiate the aforementioned applications in a post-Quantum secure manner.
• Computer Science, Mathematics
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
• 2018
The scheme allows a classical client to blindly delegate a quantum computation to a quantum server: an honest server is able to run the computation while a malicious server is unable to learn any information about the computation.
• Computer Science, Mathematics
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
• 2016
This work proves that every problem in the complexity class QMA has a quantum interactive proof system that is zero-knowledge with respect to efficient quantum computations.
• Computer Science
EUROCRYPT
• 2021
It is proved that it is impossible to construct SSL schemes for an arbitrary class of quantum unlearnable functions and the existence of quantum VBB for classical circuits is ruled out, answering an open problem posed by [Alagic and Fefferman arXiv'16].
• Computer Science, Mathematics
TCC
• 2016
This work presents a three-message zero-knowledge argument system with soundness against uniform polynomial-time cheating provers and gives an explicit uniform reduction from any adversary breaking the soundness of the protocol to finding collisions in the underlying hash function.
• Physics, Computer Science
• 2000
This chapter discusses quantum information theory, public-key cryptography and the RSA cryptosystem, and the proof of Lieb's theorem.