Contact Project Developer Ashish D. Tiwari []
Download Synopsis Abstract
Cloud C#.NET ASP.NET BE-Engineering(CO/IT) ME-Engineering(CO/IT) BCS BSC Computer/IT BE E&TC / ECE Diploma (CO/IT) IEEE-2015 Security

An Efficient Lattice Based Multi-stage Secret Sharing Scheme

An Efficient Lattice Based Multi-stage Secret Sharing Scheme


In this paper, each secret is a vector from a t-dimensional lattice and the basis of each lattice is kept private. A t-subset of n participants can recover the secret(s) using their assigned shares. Using a lattice based one way function, even after some secrets are revealed, the computational security of the unrecovered secrets is provided against quantum computers. The scheme is multi-use in the sense that to share a new set of secrets, it is sufficient to renew some public information such that a new share distribution is no longer required. Furthermore, the scheme is verifiable meaning that the participants can verify the shares received from the dealer and the recovered secrets from the combiner, using public information.

Comment is Only Available for registered users! Create Account or Login Now!