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}
}
  • P. AnanthR. L. Placa
  • 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… 

Post-Quantum Multi-Party Computation in Constant Rounds

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.

Secure Software Leasing

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].

Post-Quantum Zero-Knowledge with Space-Bounded Simulation

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.

Cyber security and data protection 103 UDC 004

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).

Post-Quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round

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

Lockable Obfuscation from Circularly Insecure Fully Homomorphic Encryption

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.

The Round Complexity of Quantum Zero-Knowledge

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.

Non-malleable Commitments against Quantum Attacks

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.

Post-quantum Resettably-Sound Zero Knowledge

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.

Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits

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

Quantum Attacks on Classical Proof Systems: The Hardness of Quantum Rewinding

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.

A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device

The randomness protocol can be used as the basis for an efficiently verifiable "quantum supremacy" proposal, thus answering an outstanding challenge in the field.

Post-Quantum Multi-Party Computation in Constant Rounds

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.

Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks

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

Two-Message Statistical Sender-Private OT from LWE

This work provides the first (presumed) post-quantum secure candidate and thus allows to instantiate the aforementioned applications in a post-Quantum secure manner.

Classical Homomorphic Encryption for Quantum Circuits

  • U. Mahadev
  • 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.

Zero-Knowledge Proof Systems for QMA

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.

Secure Software Leasing

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].

3-Message Zero Knowledge Against Human Ignorance

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.

Quantum computation and quantum information

This chapter discusses quantum information theory, public-key cryptography and the RSA cryptosystem, and the proof of Lieb's theorem.
...