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

On Adaptively Secure Multiparty Computation with a Short CRS

Ran Cohen, Chris Peikert

Published Jan 1, 2016• 6 citations
Publisher
DOI
10.1007/978-3-319-44618-9_7

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

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

Eunkyung Kim, Hyang-Sook Lee, Jeongeun Park

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

Efficient Multiparty Computations Secure Against an Adaptive Adversary

Ronald Cramer, Ivan Damgård, Stefan Dziembowski +2 more

Lecture notes in computer science•Jan 1, 1999•223 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 Adaptive vs. Non-adaptive Security of Multiparty Protocols

Ran Canetti, Ivan Damgaard, Stefan Dziembowski +2 more

Lecture notes in computer science•Jan 1, 2001•39 citations

From Fairness to Full Security in Multiparty Computation

Ran Cohen, Iftach Haitner, Eran Omri +1 more

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