Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Breaking the ${\mathcal{O}}(n|C|)$ Barrier for Unconditionally Secure Asynchronous Multiparty Computation

Ashish Choudhury

Published Jan 1, 2013• 4 citations
Publisher
DOI
10.1007/978-3-319-03515-4_2

Related papers

Breaking the O(n|C|) Barrier for Unconditionally Secure Asynchronous Multiparty Computation

Choudhary, Ashish

•Jan 1, 2013•0 citations

Scalable and Unconditionally Secure Multiparty Computation

Ivan Damgård, Jesper Buus Nielsen

Springer eBooks•Aug 9, 2007•274 citations

Asynchronous Secure Multiparty Computation in Constant Time

Ran Cohen

Lecture notes in computer science•Jan 1, 2016•32 citations

Optimally-resilient Unconditionally-secure Asynchronous Multi-party Computation Revisited.

Ashish Choudhury

•Jan 1, 2020•4 citations

Unconditionally Secure Multiparty Computation from Noisy Resources

Stefan Wolf, Jürg Wullschleger

Springer eBooks•Jan 1, 2007•1 citation

Efficient asynchronous secure multiparty distributed computation

Chandrasekharan Pandu Rangan

Lecture notes in computer science•Jan 1, 2000•0 citations
Breaking the O(n∣C∣){\mathcal{O}}(n|C|)O(n∣C∣) Barrier for Unconditionally Secure Asynchronous Multiparty Computation