Generalised cheater detection and identification

Cheater detection and identification are important issues in the process of secret reconstruction. To detect and identify cheaters most of the algorithms need the dealer to generate and distribute additional information to shareholders. Recently, algorithms have been proposed to detect and identify...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IET information security Jg. 8; H. 3; S. 171 - 178
1. Verfasser:	Harn, Lein
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Stevenage The Institution of Engineering and Technology 01.05.2014 John Wiley & Sons, Inc
Schlagworte:	Algorithms Computer information security cryptography Electric power distribution generalised cheater detection generalised cheater identification interpolation Lagrange interpolating polynomial polynomials Reconstruction Redundancy Redundant secret reconstruction process share redundancy TCVSS threshold changeable verifiable secret sharing Thresholds share redundancy interpolation secret reconstruction process polynomials TCVSS cryptography threshold changeable verifiable secret sharing Lagrange interpolating polynomial generalised cheater identification generalised cheater detection
ISSN:	1751-8709, 1751-8717
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Cheater detection and identification are important issues in the process of secret reconstruction. To detect and identify cheaters most of the algorithms need the dealer to generate and distribute additional information to shareholders. Recently, algorithms have been proposed to detect and identify cheaters. If more than t (i.e. the threshold) shares, for example j (i.e. t < j) shares in the secret reconstruction, then redundancy of shares can be used to detect and identify cheaters. The detectability and identifiability of cheaters are proportional to the number of redundant shares. However, the number of redundant shares, j − t is fixed if original shares are used in the secret reconstruction. So, a threshold changeable verifiable secret sharing (TCVSS) has been developed, which allows shareholders working together to change the threshold t into a new threshold t′ (i.e. t′ < j) and generate new shares; whereas at the same time, maintain the original secret. The verifiability of the proposed TCVSS enables shareholders to verify that their new shares have been properly generated. The number of redundant shares can be changed to j − t′ if new shares are used in the secret reconstruction. Discussion on how to determine the new threshold t′ in order to detect and identify cheaters successfully has also been included.
Bibliographie:	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23
ISSN:	1751-8709 1751-8717
DOI:	10.1049/iet-ifs.2012.0381