Round efficient secure multiparty quantum computation with identifiable abort

DOI10.1007/978-3-030-84242-0_16MaRDI QIDQ2120089zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Secure multi-party quantum computation with a dishonest majority
• On the round complexity of secure quantum computation
• Secure quantum computation with classical communication
• Round-optimal multi-party computation with identifiable abort
• Improved secure multiparty computation with a dishonest majority via quantum means

Cites work

• Actively secure two-party evaluation of any quantum operation
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• scientific article; zbMATH DE number 4037759 (Why is no real title available?)
• Multiparty Computation from Somewhat Homomorphic Encryption
• Quantum data hiding
• Quantum fully homomorphic encryption with verification
• Quantum one-time programs. (Extended abstract)
• Secure multi-party computation with identifiable abort
• Secure multi-party quantum computation
• Secure multi-party quantum computation with a dishonest majority
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• Universally composable quantum multi-party computation

Cited in

(9)

• Secure multi-party quantum computation with a dishonest majority
• On the round complexity of secure quantum computation
• Secure quantum computation with classical communication
• On sufficient oracles for secure computation with identifiable abort
• On concurrent multi-party quantum computation
• Best-of-both-worlds multiparty quantum computation with publicly verifiable identifiable abort
• Secure multiparty computation with identifiable abort via vindicating release
• MPC with publicly identifiable abort from pseudorandomness and homomorphic encryption
• Round-efficient composable two-party quantum computation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2120089)