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

Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography

Ivan Damgård, Yuval Ishai, Mikkel Krøigaard

Published Jan 1, 2010• 183 citations
Publisher
DOI
10.1007/978-3-642-13190-5_23

Related papers

Perfectly-Secure Multiparty Computation with Linear Communication Complexity over Any Modulus

Daniel E. Escudero, Yifan Song, Wenhao Wang

Lecture notes in computer science•Dec 11, 2024•5 citations

Constant-Overhead Unconditionally Secure Multiparty Computation Over Binary Fields

Antigoni Polychroniadou, Yifan Song

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

Secure Multiparty Computations for Collaboration between Competing Service Providers

Davit H. Danoyan

We introduce a platform for secure computations and describe the platform workflow. We detail the Golreich-Micalli-Widgerson protocol employed for secure multiparty computation in our platform with optimization techniques applied to it. Being based on white-box cryptography, the underlying oblivious transfer protocol avoids the use of expensive public key operations and provides good overhead compared to similar systems. Also we point out some useful application scenarios and provide a real world application design based on our platform.

Mathematical Problems of Computer Science•Jan 1, 2016•0 citations

Cryptography Based on Correlated Data: Foundations and Practice

Rafael Dowsley

Correlated data can be very useful in cryptography. For instance, if a uniformly random key is available to Alice and Bob, it can be used as an one-time pad to transmit a message with perfect security. With more elaborate forms of correlated data, the parties can achieve even more complex cryptographic tasks, such as secure multiparty computation. This thesis explores (from both a theoretical and a practical point of view) the topic of cryptography based on correlated data.

•Jan 1, 2016•9 citations

On the Message Complexity of Secure Multiparty Computation

Yuval Ishai, Manika Mittal, Rafail Ostrovsky

Lecture notes in computer science•Jan 1, 2018•7 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
We introduce a platform for secure computations and describe the platform workflow. We detail the Golreich-Micalli-Widgerson protocol employed for secure multiparty computation in our platform with optimization techniques applied to it. Being based on white-box cryptography, the underlying oblivious transfer protocol avoids the use of expensive public key operations and provides good overhead compared to similar systems. Also we point out some useful application scenarios and provide a real world application design based on our platform.