A secret sharing scheme based on NTRU algorithm

Authors:
Bu ShanYue;Zhou Hong
Affiliations:
Department of Computer Engineering, Huaiyin Institute of Technology, Huaian, China;Department of Computer Engineering, Huaiyin Institute of Technology, Huaian, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 2
Cited 0

How to share a secret

Communications of the ACM
Secret Sharing with Reusable Polynomials

ACISP '97 Proceedings of the Second Australasian Conference on Information Security and Privacy

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the secret sharing schemes already published, the security of the scheme is mostly established upon difficult mathematical problems such as the solution of discrete logarithm and the factoring of large number. However, such schemes take up lots of resources while result in low speed. In this paper we propose a new secret-sharing scheme, which is based on shamir secret sharing scheme and use the NTRU and one-way hashing function to verify the validity of data. The security of our scheme is built on quick and efficient NTRU algorithm. It can use the public channel to issue information, detect effectively a variety of cheating or forgery behaviors, and ensure the credibility of resumption of secret.