NONINTERACTIVE AND INFORMATION-THEORETIC SECURE VERIFIABLE SECRET SHARING

被引：0

作者：

PEDERSEN, TP

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1992年 / 576卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

It is shown how to distribute a secret to n persons such that each person can verify that he has received correct information about the secret without talking with other persons. Any k of these persons can later find the secret (1 less-than-or-equal-to k less-than-or-equal-to n), whereas fewer than k persons get no (Shannon) information about the secret. The information rate of the scheme is 1/2 and the distribution as well as the verification requires approximately 2k modular multiplications pr. bit of the secret. It is also shown how a number of persons can choose a secret ''in the well' and distribute it verifiably among themselves.

引用

页码：129 / 140

页数：12

共 15 条

[1]

[Anonymous], 1988, P 20 ANN ACM S THEOR, DOI 10.1145/62212.62213

[2]

BENALOH JC, 1987, LECTURE NOTES COMPUT, P251

[3]

BLAKLEY G, 1979, 1979 P AFIPS NAT COM, P313

[4] HOW TO GENERATE CRYPTOGRAPHICALLY STRONG SEQUENCES OF PSEUDO-RANDOM BITS [J].

BLUM, M ;

MICALI, S .

SIAM JOURNAL ON COMPUTING, 1984, 13 (04) :850-864

[5]

BOS J, VOTING SCHEME PRELIM

[6] MINIMUM DISCLOSURE PROOFS OF KNOWLEDGE [J].

BRASSARD, G ;

CHAUM, D ;

CREPEAU, C .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1988, 37 (02) :156-189

[7]

BRICKELL EF, 1990, LECT NOTES COMPUT SC, V435, P278

[8]

CHAUM D, 1988, 20 STOC, P11

[9]

Feldman P., 1987, 28th Annual Symposium on Foundations of Computer Science (Cat. No.87CH2471-1), P427, DOI 10.1109/SFCS.1987.4

[10]

INGEMARSSON I, 1991, LECTURE NOTES COMPUT, P266

← 1 2 →