Secure multi-party quantum computation with a dishonest majority
From MaRDI portal
Publication:2055679
DOI10.1007/978-3-030-45727-3_25zbMath1480.81029arXiv1909.13770OpenAlexW3104918172MaRDI QIDQ2055679
Yfke Dulek, Christian Majenz, Christian Schaffner, Stacey Jeffery, Alex Bredariol Grilo
Publication date: 1 December 2021
Full work available at URL: https://arxiv.org/abs/1909.13770
Quantum computation (81P68) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items
On the round complexity of secure quantum computation ⋮ Round efficient secure multiparty quantum computation with identifiable abort ⋮ One-way functions imply secure computation in a quantum world ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ On concurrent multi-party quantum computation ⋮ Cryptography with certified deletion ⋮ Quantum secure multi-party summation protocol based on blind matrix and quantum Fourier transform ⋮ Secure quantum computation with classical communication ⋮ Post-quantum multi-party computation ⋮ Oblivious transfer is in MiniQCrypt ⋮ A \((k, n)\)-threshold dynamic quantum secure multiparty multiplication protocol
Cites Work
- Overdrive: making SPDZ great again
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- Multiparty Computation from Somewhat Homomorphic Encryption
- Actively Secure Two-Party Evaluation of Any Quantum Operation
- Efficient Simulation for Quantum Message Authentication
- Semi-homomorphic Encryption and Multiparty Computation
- Universal quantum computation with ideal Clifford gates and noisy ancillas
- Zero-Knowledge Proofs from Secure Multiparty Computation
- Secure multi-party quantum computation
- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
- Secure Multiparty Computation and Secret Sharing
