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

arXiv:0706.2010 · Springer eBooks

Information-Theoretic Security Without an Honest Majority

Anne Broadbent, Alain Tapp

Published Nov 4, 2007• 74 citations
arXivHTMLPDF
DOI
10.1007/978-3-540-76900-2_25

Related papers

Information Theoretic Security

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

ACCO: Algebraic Computation with Comparison

Xiaoqi Duan, Vipul Goyal, Hanjun Li +3 more

We propose ACCO: the first maliciously secure multiparty computation engine in the honest majority setting, which also supports secure and efficient comparison and integer truncation. Our system is also the first to achieve information theoretic security.

Cloud Computing Security Workshop•Nov 5, 2021•1 citation

TurboPack: Honest Majority MPC with Constant Online Communication

Daniel E. Escudero, Vipul Goyal, Antigoni Polychroniadou +1 more

We present a novel approach to honest majority secure multiparty computation in the preprocessing model with information theoretic security that achieves the best online communication complexity. The online phase of our protocol requires 12 elements in total per multiplication gate with circuit-dependent preprocessing, or 20 elements in total with circuit-independent preprocessing. Prior works achieved linear online communication complexity in n, the number of parties, with the best prior existing solution involving 1.5n elements per multiplication gate. Only one recent work packing [28] achieves constant online communication complexity, but the constants are large (108 elements for passive security, and twice that for active security). That said, our protocol offers a very efficient information theoretic online phase for any number of parties.

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Nov 7, 2022•31 citations

Information-Theoretic Security

Nigel Paul Smart

Information security and cryptography•Nov 12, 2015•0 citations

Information-theoretic security beyond the one-time pad

Christopher Portmann

•Jan 1, 2011•0 citations

Passive secure three-party computation with an honest majority

Sergey Mihailovich Ratseev, Ольга Ивановна Череватенко

In 2016, the authors Araki T., Furukawa J., Lindell Y., Of A. and Ohara K. introduced a new information-theoretic protocol (and a computationally-secure variant) for secure three- party computation with an honest majority. The protocol has very minimal computation and communication. The authors did not provide a complete protocols. This paper provides complete protocols for secure multiparty computation.

The Herald of the Siberian State University of Telecommunications and Information Science•Mar 21, 2025•0 citations
We present a novel approach to honest majority secure multiparty computation in the preprocessing model with information theoretic security that achieves the best online communication complexity. The online phase of our protocol requires 12 elements in total per multiplication gate with circuit-dependent preprocessing, or 20 elements in total with circuit-independent preprocessing. Prior works achieved linear online communication complexity in n, the number of parties, with the best prior existing solution involving 1.5n elements per multiplication gate. Only one recent work packing [28] achieves constant online communication complexity, but the constants are large (108 elements for passive security, and twice that for active security). That said, our protocol offers a very efficient information theoretic online phase for any number of parties.