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

Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds

Dana Dachman-Soled, Jonathan I. Katz, Vanishree Rao

Published Jan 1, 2015• 44 citations
Publisher
DOI
10.1007/978-3-662-46497-7_23

Related papers

Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions

Fabrice Benhamouda, Huijia Lin, Antigoni Polychroniadou +1 more

Lecture notes in computer science•Jan 1, 2018•14 citations

Secure Multiparty RAM Computation in Constant Rounds

Sanjam Garg, Divya Gupta, Peihan Miao +1 more

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

A Simpler Variant of Universally Composable Security for Standard Multiparty Computation

Ran Canetti, Asaf Cohen, Yehuda Lindell

Lecture notes in computer science•Jan 1, 2015•87 citations

General Composition and Universal Composability in Secure Multiparty Computation

Yehuda Lindell

Journal of Cryptology•Mar 28, 2008•141 citations

Universally Composable Multiparty Computation with Partially Isolated Parties

Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs

Lecture notes in computer science•Jan 1, 2009•35 citations

Two-Round Multiparty Secure Computation from Minimal Assumptions

Sanjam Garg, Akshayaram Srinivasan

Lecture notes in computer science•Jan 1, 2018•121 citations