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

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-46035-7_32
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Dishonest Majority Multi-Party Computation for Binary Circuits

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Span Programs and General Secure Multi-Party Computation

BRICS Report Series
1997English

Efficient Secure Two-Party Computation Against Malicious Adversaries

English

Automatic Proofs of Privacy of Secure Multi-Party Computation Protocols Against Active Adversaries

2015English

Privacy-Aware MapReduce Based Multi-Party Secure Skyline Computation

Information (Switzerland)
Information Systems
2019English

A Practical Approach to Solve Secure Multi-Party Computation Problems

2002English

Experimental Realization of an Entanglement Access Network and Secure Multi-Party Computation

Scientific Reports
Multidisciplinary
2016English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Secure Two-Party Computation Over Unreliable Channels

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy