ScholarLens Back to search
2009•Designs Codes and CryptographyRequires access

Ideal secret sharing schemes whose minimal qualified subsets have at most three participants

Jaume Martí-Farré, Carles Padró

Open publisher page 14 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 14 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: Ideal (ethics), Secret sharing, Computer science, Arithmetic, Psychology, Computer security, Mathematics, Cryptography

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants — Research Paper | ScholarLens