Abstract.
We explain and perform the steps for an (n,t) secret sharing scheme based on the closest vector theorem. We then compare this scheme and its complexity to the secret sharing schemes of both Shamir and Panagopoulos. Finally we modify the (n,t) secret sharing scheme to a private key cryptosystem.
Keywords: Secret sharing scheme; inner product space; Closest Vector Theorem; private key cryptosystem
Received: 2013-01-05
Revised: 2013-08-02
Published Online: 2013-10-09
Published in Print: 2013-11-01
© 2013 by Walter de Gruyter Berlin Boston
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Masthead
- Another look at non-uniformity
- An asymmetric generalisation of Artin monoids
- Non-associative key establishment for left distributive systems
- On the dimension of matrix representations of finitely generated torsion free nilpotent groups
- On the intersection of subgroups in free groups: Echelon subgroups are inert
- A secret sharing scheme based on the Closest Vector Theorem and a modification to a private key cryptosystem
Keywords for this article
Secret sharing scheme;
inner product space;
Closest Vector Theorem;
private key cryptosystem
Articles in the same Issue
- Masthead
- Another look at non-uniformity
- An asymmetric generalisation of Artin monoids
- Non-associative key establishment for left distributive systems
- On the dimension of matrix representations of finitely generated torsion free nilpotent groups
- On the intersection of subgroups in free groups: Echelon subgroups are inert
- A secret sharing scheme based on the Closest Vector Theorem and a modification to a private key cryptosystem