Round efficient secure multiparty quantum computation with identifiable abort

DOI10.1007/978-3-030-84242-0_16zbMath1487.81034OpenAlexW3107009921MaRDI QIDQ2120089

Mi-Ying Huang, Kai-Min Chung, Yu-Ching Shen, Hao Chung, Yi Lee, Bar Alon

Publication date: 31 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-84242-0_16

Mathematics Subject Classification ID

Quantum computation (81P68) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70) Quantum cryptography (quantum-theoretic aspects) (81P94) Computer security (68M25) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (2)

On concurrent multi-party quantum computation ⋮ Secure quantum computation with classical communication

Cites Work

• Unnamed Item
• Secure multi-party quantum computation with a dishonest majority
• Quantum fully homomorphic encryption with verification
• Quantum One-Time Programs
• Secure Multi-Party Computation with Identifiable Abort
• Multiparty Computation from Somewhat Homomorphic Encryption
• Actively Secure Two-Party Evaluation of Any Quantum Operation
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• Universally Composable Quantum Multi-party Computation
• Secure multi-party quantum computation
• Quantum data hiding
• Efficient Fully Homomorphic Encryption from (Standard) LWE

This page was built for publication: Round efficient secure multiparty quantum computation with identifiable abort