On concurrent multi-party quantum computation

DOI10.1007/978-3-031-38554-4_5MaRDI QIDQ6190133zbMATH OpenOpenAlexFDO

Authors Vipul Goyal, Xiao Liang, Giulio Malavolta

Publication date 6 February 2024

Published in Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-38554-4_5

zbMATH Keywords

concurrentquantumsecure computation

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Recommendations

• Secure quantum computation with classical communication
• On the round complexity of secure quantum computation
• Secure two-party computation in a quantum world
• On the concurrent composition of quantum zero-knowledge
• Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round

Cites work

• A Framework for Efficient and Composable Oblivious Transfer
• A single quantum cannot be cloned
• Actively secure two-party evaluation of any quantum operation
• Black-box constructions of bounded-concurrent secure computation
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Bounded-concurrent secure two-party computation without setup assumptions
• Classical cryptographic protocols in a quantum world
• Efficient simulation for quantum message authentication
• Fully simulatable quantum-secure coin-flipping and applications
• scientific article; zbMATH DE number 2009949 (Why is no real title available?)
• scientific article; zbMATH DE number 2009954 (Why is no real title available?)
• scientific article; zbMATH DE number 1775426 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• New notions of security: achieving universal composability without trusted setup
• Oblivious transfer is in MiniQCrypt
• On concurrently secure computation in the multiple ideal query model
• On the concurrent composition of quantum zero-knowledge
• On the round complexity of secure quantum computation
• One-way functions imply secure computation in a quantum world
• Password-authenticated session-key generation on the internet in the plain model
• Post-quantum multi-party computation
• Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
• Quantum garbled circuits
• Quantum-Secure Coin-Flipping and Applications
• Round efficient secure multiparty quantum computation with identifiable abort
• Secure multi-party quantum computation with a dishonest majority
• Theory of Cryptography
• Two-message statistically sender-private OT from LWE
• Two-round multiparty secure computation from minimal assumptions
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• Universally composable two-party and multi-party secure computation

Cited in

(4)

• The round complexity of black-box post-quantum secure computation
• Unclonable commitments and proofs
• Round-efficient composable two-party quantum computation
• The black-box simulation barrier persists in a fully quantum world

This page was built for publication: On concurrent multi-party quantum computation

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