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

Secure Multiparty RAM Computation in Constant Rounds

Sanjam Garg, Divya Gupta, Peihan Miao, Omkant Pandey

Published Jan 1, 2016• 27 citations
Publisher
DOI
10.1007/978-3-662-53641-4_19

Related papers

Constant-Round Maliciously Secure Two-Party Computation in the RAM Model

Carmit Hazay, Avishay Yanai

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

Constant-Round Maliciously Secure Two-Party Computation in the RAM Model

Carmit Hazay, Avishay Yanai

Journal of Cryptology•Apr 23, 2019•0 citations

Efficient Maliciously Secure Multiparty Computation for RAM

Marcel Keller, Avishay Yanai

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

Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds

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

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

On 2-Round Secure Multiparty Computation

Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz Z +1 more

Lecture notes in computer science•Jan 1, 2002•70 citations

Two-Round Multiparty Secure Computation from Minimal Assumptions

Sanjam Garg, Akshayaram Srinivasan

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