Round-efficient composable two-party quantum computation

DOI10.1007/978-981-95-5125-5_12MaRDI QIDQ7232839zbMATH OpenFDO

Authors Vipul Goyal, Xiao Liang, Omkant Pandey, Yuhao Tang, Takashi Yamakawa

Publication date 23 April 2026

Full work available at URL https://doi.org/10.1007/978-981-95-5125-5_12

zbMATH Keywords

two-party computationpost-quantum protocolsuper-polynomial simulation security

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 2009954 (Why is no real title available?)
• A black-box approach to post-quantum zero-knowledge in constant rounds
• A new approach to black-box concurrent secure computation
• A new approach to post-quantum non-malleability
• A unified framework for concurrent security
• Actively secure two-party evaluation of any quantum operation
• Adaptive hardness and composable security in the plain model from standard assumptions
• Advances in Cryptology – CRYPTO 2004
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• Black-box constructions of composable protocols without set-up
• Bounded-concurrent secure two-party computation without setup assumptions
• Classical cryptographic protocols in a quantum world
• Compact ring signatures from learning with errors
• Concurrently composable security with shielded super-polynomial simulators
• Concurrently secure computation in constant rounds
• Fully simulatable quantum-secure coin-flipping and applications
• Improved black-box constructions of composable secure computation
• Maliciously circuit-private FHE
• New notions of security: achieving universal composability without trusted setup
• Non-malleability amplification
• Non-malleable commitments against quantum attacks
• Oblivious transfer is in MiniQCrypt
• On concurrent multi-party quantum computation
• 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
• Post-quantum multi-party computation
• Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
• Post-quantum zero knowledge in constant rounds
• Post-quantum zero knowledge, revisited or: how to do quantum rewinding undetectably
• Quantum-Secure Coin-Flipping and Applications
• Round efficient secure multiparty quantum computation with identifiable abort
• Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
• Round-efficient black-box construction of composable multi-party computation
• Secure multi-party quantum computation with a dishonest majority
• The round complexity of black-box post-quantum secure computation
• Theory of Cryptography
• Theory of Cryptography
• Two-message statistically sender-private OT from LWE
• Two-message witness indistinguishability and secure computation in the plain model from new assumptions
• Two-round concurrent 2PC from sub-exponential LWE
• Zero-knowledge against quantum attacks

This page was built for publication: Round-efficient composable two-party quantum computation

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