1985•Unpublished venueRequires access

Verifiable secret sharing and achieving simultaneity in the presence of faults

Benny Chor, Shafi Goldwasser, Silvio Micali, Baruch Awerbuch

Open publisher page 779 citations

Abstract

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

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 779 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: Verifiable secret sharing, Simultaneity, Computer science, Computer security, Distributed computing, Programming language, Physics, Classical mechanics

Back to paper search Browse research topics Original source

Verifiable secret sharing and achieving simultaneity in the presence of faults — Research Paper | ScholarLens