An efficient lattice-based secret sharing construction

Authors:
Rachid El Bansarkhani;Mohammed Meziani
Affiliations:
Fachbereich Informatik, Kryptographie und Computeralgebra, Technische Universität Darmstadt, Darmstadt, Germany;CASED --- Center for Advanced Security Research Darmstadt, Darmstadt, Germany
Venue:
WISTP'12 Proceedings of the 6th IFIP WG 11.2 international conference on Information Security Theory and Practice: security, privacy and trust in computing systems and ambient intelligent ecosystems
Year:
2012

Citing 11
Cited 0

Generating hard instances of lattice problems (extended abstract)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
How to share a secret

Communications of the ACM
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting

Electronic Notes in Theoretical Computer Science (ENTCS)
On lattices, learning with errors, random linear codes, and cryptography

Journal of the ACM (JACM)
How to share a secret

Proceedings of the 1982 conference on Cryptography
General secure multi-party computation from any linear secret-sharing scheme

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Generalized compact knapsacks are collision resistant

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices

TCC'06 Proceedings of the Third conference on Theory of Cryptography
A modular approach to key safeguarding

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.