A secret sharing shuffling scheme based on polynomial

Author

Zhang, Xi ; Zhang, Lei ; Zhang, Quan ; Tang, Chaojing

Author_Institution

Coll. of Electron. Sci. & Eng., Nat. Univ. of Defence Technol., Changsha

fYear

2008

fDate

20-23 June 2008

Firstpage

1746

Lastpage

1750

Abstract

The threshold protocol based on polynomial needs shuffling scheme to share the secret securely. For avoiding the complexity on communication and operation of the complete-shuffling scheme, this scheme applies brief shuffling algorithm. This paper introduces random order sequence via the dynamic attribute of the feedback time and presents a partial-shuffling scheme. In order to defense the adversary attack against secret sharing process, a kind of dynamic correction mechanism is designed. Performance evaluation shows that the partial-shuffling scheme greatly decreases the secret sharing time and improves the efficiency, while the threshold and the adversary appearance probability are increasing.

Keywords

security of data; adversary attack; communication complexity; dynamic correction mechanism; feedback time dynamic attribute; partial-shuffling scheme; secret sharing process; secret sharing shuffling scheme; threshold protocol; Automation; Chaotic communication; Cryptographic protocols; Cryptography; Educational institutions; Feedback; Information security; Interpolation; Lagrangian functions; Polynomials; adversary; dynamic correction mechanism; partial shuffling scheme; secret sharing; threshold protocol;

fLanguage

English

Publisher

ieee

Conference_Titel

Information and Automation, 2008. ICIA 2008. International Conference on

Conference_Location

Changsha

Print_ISBN

978-1-4244-2183-1

Electronic_ISBN

978-1-4244-2184-8

Type

conf

DOI

10.1109/ICINFA.2008.4608288

Filename

4608288