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

zbMATH Keywords

post-quantummulti-party computationblack-boxnon-malleability

Mathematics Subject Classification ID

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

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)