Scalable threshold scheme without a trusted third party

Authors:
Biao Li;Shen-sheng Zhang;Ke-fei Chen
Affiliations:
Department of Computer Science & Engineering, Shanghai Jiao Tong University, Shanghai 200030, People's Republic of China;Department of Computer Science & Engineering, Shanghai Jiao Tong University, Shanghai 200030, People's Republic of China;Department of Computer Science & Engineering, Shanghai Jiao Tong University, Shanghai 200030, People's Republic of China
Venue:
ICCC '02 Proceedings of the 15th international conference on Computer communication
Year:
2002

Citing 7
Cited 0

Secret sharing homomorphisms: keeping shares of a secret secret

Proceedings on Advances in cryptology---CRYPTO '86
How to share a secret

Communications of the ACM
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Fully Dynamic Secret Sharing Schemes

CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
On-Line Secret Sharing

Proceedings of the 5th IMA Conference on Cryptography and Coding
Threshold Schemes with Disenrollment

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The change on membership of participants and its impact on the application of threshold cryptography are seldom considered in literature. However, it is a very important problem in secure dynamic cooperation in modern business environment. In this paper, a scalable threshold scheme is proposed as preliminary study on this field. Our proposal is to put together multiple simple Shamir's threshold schemes to realize a scalable one, without requiring any cryptographic assumption and a trusted third party.