An Efficient Lattice-Based Secret Sharing Construction - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

An Efficient Lattice-Based Secret Sharing Construction


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.
Fichier principal
Vignette du fichier
978-3-642-30955-7_14_Chapter.pdf (471.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01534304 , version 1 (07-06-2017)





Rachid El 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⟩
328 View
97 Download



Gmail Facebook Twitter LinkedIn More