A scheme for threshold multi-secret sharing

Chao-Wen Chan

doi:10.1016/j.amc.2004.04.081

A scheme for threshold multi-secret sharing

2005-07-01

51

PRE

AI

DOI：10.1016/j.amc.2004.04.081

原文链接

原文求助

摘要

En 中文

A multi-secret sharing scheme is a natural generalization of the secret sharing scheme. We show the close similarity between the Chinese remainder theorem and the uniqueness theorem of interpolating polynomial. Based on the similarity, we propose a threshold multi-secret sharing scheme that is a generalization of the Shamir threshold scheme. We also show that the proposed scheme with the proposed deletion procedure can realize all possible monotone access structures. (c) 2004 Elsevier Inc. All rights reserved.

Keyword:

access structure

basis of access structure

the Chinese remainder theorem

distinctness

entropy

idealness

multi-secret sharing scheme

perfectness

the Shamir (t,n)-threshold secret sharing scheme

(t,n)-threshold access structure

threshold multi-secret sharing scheme

A scheme for threshold multi-secret sharing

摘要

期刊

机构

引用论文