On concurrent multi-party quantum computation
From MaRDI portal
Publication:6190133
DOI10.1007/978-3-031-38554-4_5OpenAlexW4385654204MaRDI QIDQ6190133
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
Quantum computation (81P68) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-message statistically sender-private OT from LWE
- Two-round multiparty secure computation from minimal assumptions
- Secure multi-party quantum computation with a dishonest majority
- Post-quantum multi-party computation
- Oblivious transfer is in MiniQCrypt
- Black-box constructions of bounded-concurrent secure computation
- On the concurrent composition of quantum zero-knowledge
- 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
- Actively Secure Two-Party Evaluation of Any Quantum Operation
- Zero-knowledge against quantum attacks
- Efficient Simulation for Quantum Message Authentication
- Fully Simulatable Quantum-Secure Coin-Flipping and Applications
- Universally composable two-party and multi-party secure computation
- Bounded-concurrent secure multi-party computation with a dishonest majority
- New notions of security
- Bounded-concurrent secure two-party computation without setup assumptions
- Password-Authenticated Session-Key Generation on the Internet in the Plain Model
- A Framework for Efficient and Composable Oblivious Transfer
- Quantum-Secure Coin-Flipping and Applications
- On Concurrently Secure Computation in the Multiple Ideal Query Model
- Classical Cryptographic Protocols in a Quantum World
- A single quantum cannot be cloned
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- Theory of Cryptography
- Quantum garbled circuits
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
