The round complexity of secure computation against covert adversaries

DOI10.1007/978-3-030-57990-6_30MaRDI QIDQ2106671zbMATH OpenOpenAlexFDO

Authors Arka Rai Choudhuri, Vipul Goyal, Abhishek Jain

Publication date 16 December 2022

Full work available at URL https://doi.org/10.1007/978-3-030-57990-6_30

zbMATH Keywords

covert adversaryround complexitysecure computation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited in

(4)

• On the round complexity of secure quantum computation
• Polynomial-time targeted attacks on coin tossing for any number of corruptions
• Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
• The Exact Round Complexity of Secure Computation

This page was built for publication: The round complexity of secure computation against covert adversaries

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