%0 Conference Proceedings
%T An Efficient Lattice-Based Secret Sharing Construction
%+ Technische Universitat Darmstadt Fachbereich Informatik, Kryptographie und Computeralgebra
%+ Center for Advanced Security Research Darmstadt [Darmstadt] (CASED)
%A Bansarkhani, Rachid, El
%A Meziani, Mohammed
%Z Part 8: Cryptography (Short Papers)
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 6th International Workshop on Information Security Theory and Practice (WISTP)
%C Egham, United Kingdom
%Y Ioannis Askoxylakis
%Y Henrich C. Pöhls
%Y Joachim Posegga
%I Springer
%3 Information Security Theory and Practice. Security, Privacy and Trust in Computing Systems and Ambient Intelligent Ecosystems
%V LNCS-7322
%P 160-168
%8 2012-06-20
%D 2012
%R 10.1007/978-3-642-30955-7_14
%K Secret Sharing
%K Lattice-based Cryptography
%K Shortest Vector Problem
%K Hash Functions
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 11
%Z WG 11.2
%2 https://inria.hal.science/hal-01534304/document
%2 https://inria.hal.science/hal-01534304/file/978-3-642-30955-7_14_Chapter.pdf
%L hal-01534304
%U https://inria.hal.science/hal-01534304
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC11
%~ IFIP-WISTP
%~ IFIP-WG11-2
%~ IFIP-LNCS-7322