ScholarLens Back to search
2012•Lecture notes in computer scienceOpen access

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

Eli Ben‐Sasson, Serge Fehr, Rafail Ostrovsky

Open full text 109 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 109 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Security parameter, Correctness, Commitment scheme, Secure multi-party computation, Computer science, Communication complexity, Secure two-party computation, Multiplication (music)

Related papers

Related paper 1Related paper 2
Back to paper searchBrowse research topicsOriginal source
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority — Research Paper | ScholarLens