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

Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS

Eunkyung Kim, Hyang-Sook Lee, Jeongeun Park

Published Jan 1, 2018• 24 citations
Publisher
DOI
10.1007/978-3-319-93638-3_7

Related papers

Two Round Multiparty Computation via Multi-key FHE

Pratyay Mukherjee, Daniel Wichs

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

On Adaptively Secure Multiparty Computation with a Short CRS

Ran Cohen, Chris Peikert

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

A New Approach to Round-Optimal Secure Multiparty Computation

Prabhanjan Ananth, Arka Rai Choudhuri, Abhishek Jain

Lecture notes in computer science•Jan 1, 2017•47 citations

Round Optimal Secure Multiparty Computation from Minimal Assumptions

Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal +2 more

Lecture notes in computer science•Jan 1, 2020•5 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

Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer

Arpita Patra, Akshayaram Srinivasan

Lecture notes in computer science•Jan 1, 2021•11 citations