An Efficient Lattice-Based Secret Sharing Construction

Abstract : This paper presents a new construction of a lattice-based verifiable secret sharing scheme. Our proposal is based on lattices and the usage of linear hash functions to enable each participant to verify its received secret share. The security of this scheme relies on the hardness of some well known approximation problems in lattices such as nc-approximate SVP. Different to protocols proposed by Pedersen this scheme uses efficient matrix vector operations instead of exponentiation to verify the secret shares.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-01534304
Contributor : Hal Ifip <>
Submitted on : Wednesday, June 7, 2017 - 3:03:38 PM
Last modification on : Wednesday, June 7, 2017 - 3:05:25 PM
Long-term archiving on : Friday, September 8, 2017 - 12:42:08 PM

File

978-3-642-30955-7_14_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Rachid Bansarkhani, Mohammed Meziani. An Efficient Lattice-Based Secret Sharing Construction. 6th International Workshop on Information Security Theory and Practice (WISTP), Jun 2012, Egham, United Kingdom. pp.160-168, ⟨10.1007/978-3-642-30955-7_14⟩. ⟨hal-01534304⟩

Share

Metrics

Record views

2526

Files downloads

126