Dishonest Majority Multi-Party Computation for Binary Circuits

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-662-44381-1_28
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Unconditional Byzantine Agreement and Multi-Party Computation Secure Against Dishonest Minorities From Scratch

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Protocols for Multiparty Coin Toss With a Dishonest Majority

Journal of Cryptology
Applied MathematicsComputer Science ApplicationsSoftware
2013English

Span Programs and General Secure Multi-Party Computation

BRICS Report Series
1997English

Privacy-Aware MapReduce Based Multi-Party Secure Skyline Computation

Information (Switzerland)
Information Systems
2019English

SPD$$\mathbb {Z}_{2^k}$$: Efficient MPC Mod $$2^k$$ for Dishonest Majority

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Pseudo-Signatures, Broadcast, and Multi-Party Computation From Correlated Randomness

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

A Practical Approach to Solve Secure Multi-Party Computation Problems

2002English

Threshold Circuits of Small Majority-Depth

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
1998English

Near-Linear Unconditionally-Secure Multiparty Computation With a Dishonest Minority

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy