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

International Joint Conference on e-Business and Telecommunications (ICETE)

Lean and Fast Secure Multi-party Computation: Minimizing Communication and Local Computation using a Helper

Johannes Schneider

Published Jan 1, 2016• 6 citations
Publisher
DOI
10.5220/0005954202230230

Related papers

Secure Multi-party Computation Minimizing Online Rounds

Seung Geol Choi, Ariel Elbaz, Tal Malkin +1 more

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

Secure Five-Party Computation with Private Robustness and Minimal Online Communication

Hikaru Tsuchida, Takashi Nishide

Lecture notes in computer science•Jan 1, 2025•0 citations

Minimal Complete Primitives for Secure Multi-Party Computation

Matthias Fitzi, Juan A. Garay, Ueli M. Maurer +1 more

Journal of Cryptology•Apr 27, 2004•25 citations

Minimal Complete Primitives for Secure Multi-party Computation

Matthias Fitzi, Juan A. Garay, Ueli M. Maurer +1 more

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

Efficient Secure Multi-party Computation

Martin Hirt, Ueli M. Maurer, Bartosz Przydatek

Lecture notes in computer science•Jan 1, 2000•128 citations

Secure Multi-Party Computation with a Helper

Johannes Schneider

A client wishes to outsource computation on confidential data to a network of parties. He does not trust a single party but believes that multiple parties do not collude. To solve this problem, we use the idea of treating one of the parties as a helper. A helper assists computation only. Often using more parties ensures confidentiality despite more corrupted parties. This does not hold for adding a helper. But a helper can in some cases lower the amount of communication asymptotically to the theoretical minimum of one bit per AND gate, improving significantly on schemes without a helper. It can also allow for very efficient computations of certain functions, as we show for the exponential function with public base.

arXiv:1508.07690•Aug 31, 2015•3 citations
A client wishes to outsource computation on confidential data to a network of parties. He does not trust a single party but believes that multiple parties do not collude. To solve this problem, we use the idea of treating one of the parties as a helper. A helper assists computation only. Often using more parties ensures confidentiality despite more corrupted parties. This does not hold for adding a helper. But a helper can in some cases lower the amount of communication asymptotically to the theoretical minimum of one bit per AND gate, improving significantly on schemes without a helper. It can also allow for very efficient computations of certain functions, as we show for the exponential function with public base.