Download A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity

Queue processing for download document We present a new secure multiparty computation protocol in the preprocessing model that allows for the evaluation of a number of instances of a boolean circuit in parallel, with a small online communication complexity per instance of 10 bits per party and

You can start your download in 30 seconds

Recommend Documents
Boolean functions with multiplicative complexity 3 and 4

190 69 584KB

The Complexity of Boolean State Separation

139 80 10MB

Distributed Lyapunov-Based MPC

200 47 455KB

Distributed MPC Based on a Team Game

199 58 15MB

Neuromorphic-based Boolean and reversible logic circuits from organic electrochemical transistors

224 39 714KB

On the Parameterized Complexity of d-Restricted Boolean Net Synthesis

165 95 14MB

Bargaining Game Based Distributed MPC

195 36 15MB

A Synthesis of Reversible Digital Circuits to Solve the Boolean Satisfiability

151 24 50MB

MPC

195 102 525KB

A Hierarchy of Algebras for Boolean Subsets

154 71 11MB

MPC with Synchronous Security and Asynchronous Responsiveness

187 20 26MB

Nash-Based Distributed MPC for Multi-Rate Systems

188 83 295KB