The round complexity of black-box post-quantum secure computation

DOI10.1007/978-3-032-01884-7_1MaRDI QIDQ6863916zbMATH OpenFDO

Authors R. Chatterjee, Xiao Liang, Omkant Pandey, Takashi Yamakawa

Publication date 4 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-01884-7_1

zbMATH Keywords

black-boxmulti-party computationnon-malleabilitypost-quantum

Mathematics Subject Classification ID

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

Cites work

• A new approach to post-quantum non-malleability
• Advances in Cryptology - CRYPTO 2003
• Black-box constructions for secure computation
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• Black-box, round-efficient secure computation via non-malleability amplification
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Classical cryptographic protocols in a quantum world
• Constant round non-malleable protocols using one way functions
• Constructing non-malleable commitments: a black-box approach
• Distinguisher-dependent simulation in two rounds and its applications
• Founding Cryptography on Oblivious Transfer – Efficiently
• Fully simulatable quantum-secure coin-flipping and applications
• scientific article; zbMATH DE number 5485433 (Why is no real title available?)
• New and improved constructions of non-malleable cryptographic protocols
• Oblivious transfer is in MiniQCrypt
• On concurrent multi-party quantum computation
• On the impossibility of post-quantum black-box zero-knowledge in constant round
• One-way functions imply secure computation in a quantum world
• Possibility and impossibility results for selective decommitments
• Post-quantum multi-party computation
• Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
• Post-quantum succinct arguments: breaking the quantum rewinding barrier
• Post-quantum zero knowledge, revisited or: how to do quantum rewinding undetectably
• Schrödinger's pirate: how to trace a quantum decoder
• Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Simple, Black-Box Constructions of Adaptively Secure Protocols
• The round complexity of black-box post-quantum secure computation
• The Wire-Tap Channel
• Theory of Cryptography
• Theory of Cryptography
• Universally composable two-party and multi-party secure computation
• Weak zero-knowledge beyond the black-box barrier

Cited in

(3)

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

This page was built for publication: The round complexity of black-box post-quantum secure computation

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