Title :
Verifiable vector space secret sharing scheme without a dealer
Author :
Zhang, Benhui ; Tang, Yuansheng
Author_Institution :
Coll. of Math. Sci., Yangzhou Univ., Yangzhou, China
Abstract :
In this article, a secure and verifiable vector space secret sharing scheme without a dealer is proposed in detail. It´s security is based on the security of elliptic curve cryptography. This scheme has the following characteristics: There is no dealer, thus the cost can be saved and it makes the scheme more security. A verifiable infrastructure based on elliptic curve cryptography is provided, which can be used to detect the cheaters from participants and outside attackers. Meanwhile, the length of key of elliptic curve cryptography is much less than that of RSA cryptography, so the current scheme is valuable in applications with limited memory and communication bandwidth. Results indicate that the security and information rate of this scheme is very high. Analysis shows that this scheme is perfect.
Keywords :
peer-to-peer computing; public key cryptography; RSA cryptography; cheater detection; communication bandwidth; elliptic curve cryptography; verifiable infrastructure; verifiable vector space secret sharing scheme; Elliptic curve cryptography; Elliptic curves; Equations; Information rates; Vectors; elliptic curve cryptography; perfect secret sharing scheme; vector space secret sharing; without a dealer;
Conference_Titel :
Computer Science and Service System (CSSS), 2011 International Conference on
Conference_Location :
Nanjing
Print_ISBN :
978-1-4244-9762-1
DOI :
10.1109/CSSS.2011.5974697