Post-Quantum Multi-Party Computation

  title={Post-Quantum Multi-Party Computation},
  author={Amit Agarwal and James Bartusek and Vipul Goyal and Dakshita Khurana and Giulio Malavolta},
  journal={IACR Cryptol. ePrint Arch.},
We initiate the study of multi-party computation for classical functionalities (in the plain model) with security against malicious polynomial-time quantum adversaries. We observe that existing techniques readily give a polynomial-round protocol, but our main result is a construction of *constant-round* post-quantum multi-party computation. We assume mildly super-polynomial quantum hardness of learning with errors (LWE), and polynomial quantum hardness of an LWE-based circular security… Expand
5 Citations
Non-Destructive Zero-Knowledge Proofs on Quantum States, and Multi-Party Generation of Authorized Hidden GHZ States
This work proposes a different approach, and starts the study of Non-Destructive Zero-Knowledge Proofs on Quantum States, and shows how it can prove useful to distribute a GHZ state between different parties, in such a way that only parties knowing a secret can be part of this GHZ. Expand
On the Round Complexity of Secure Quantum Computation
We construct the first constant-round protocols for secure quantum computation in the two-party (2PQC) and multi-party (MPQC) settings with security against malicious adversaries. Our protocols areExpand
Rate-1 Secure Function Evaluation for BQP
Secure function evaluation (SFE) allows Alice to publish an encrypted version of her input m such that Bob (holding a circuit C) can send a single message that reveals C(m) to Alice, and nothingExpand
Circuit Privacy for Quantum Fully Homomorphic Encryption
A generic transformation from semi-honest to malicious circuit privacy for quantum fully homomorphic encryption (QFHE) is presented, assuming the quantum hardness of (a circular variant of) the learning with errors (LWE) problem. Expand
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 functionalities.Expand


Multikey FHE in the Plain Model
We construct a multikey fully-homomorphic encryption scheme (multikey FHE) with one-round threshold decryption in the plain model, i.e. without a trusted setup, assuming the intractability ofExpand
How to play any mental game, or a completeness theorem for protocols with honest majority
Permission to copy without fee all or part of this material is granted provided that the copies are not made or Idistributed for direct commercial advantage, the ACM copyright notice and the title ofExpand
Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles
We show how to combine a fully-homomorphic encryption scheme with linear decryption and a linearly-homomorphic encryption schemes to obtain constructions with new properties. Specifically, we presentExpand
Non-Malleable Commitments using Goldreich-Levin List Decoding
We give the first construction of three-round non-malleable commitments from the almost minimal assumption of injective one-way functions. Combined with the lower bound of Pass (TCC 2013), our resultExpand
Noninteractive Zero Knowledge for NP from (Plain) Learning With Errors
We finally close the long-standing problem of constructing a noninteractive zero-knowledge (NIZK) proof system for any NP language with security based on the plain Learning With Errors (LWE) problem,Expand
On Perfect Correctness in (Lockable) Obfuscation
This work builds upon previous work to design injective PRGs that are provably secure from the LWE assumption and designs an alternative last level testing procedure that has additional structure to prevent correctness errors. Expand
Post-quantum zero knowledge in constant rounds
A constant-round zero-knowledge classical argument for NP secure against quantum attacks is constructed, based on the Learning with Errors Assumption for quantum algorithms, with a new no-cloning non-black-box simulation technique. Expand
Secure Multi-party Quantum Computation with a Dishonest Majority
This work generalizes the approach taken by Dupuis, Nielsen and Salvail in the two-party setting to devise a secure, efficient protocol for multi-party quantum computation for any number of players, and prove security against up to up to $k-1$ colluding adversaries. Expand
Statistical ZAP Arguments
Dwork and Naor first introduced and constructed two message public coin witness indistinguishable proofs (ZAPs) for NP based on trapdoor permutations, and have proven extremely useful in the design of several cryptographic primitives. Expand
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. Expand