On the design and security of a lattice-based threshold secret sharing scheme

Authors

  • H. Pilaram Information Systems and Security Lab (ISSL), Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran
  • H. R. Amini Khorasgani Information Systems and Security Lab (ISSL), Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran
  • M. R. Aref Information Systems and Security Lab (ISSL), Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran
  • S. Asaad Information Systems and Security Lab (ISSL), Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran
  • T. Eghlidos Electronics Research Institute, Sharif University of Technology, Tehran, Iran
Abstract:

In this paper, we introduce a method of threshold secret sharing scheme (TSSS) in which secret reconstruction is based on Babai's nearest plane algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. A solution to this problem can be utilization of lattice-based cryptosystems for these channels which requires designing lattice-based TSSSs. We investigate the effect of lattice dimension on the security and correctness of the proposed scheme. Moreover, we prove that for a fixed lattice dimension the proposed scheme is asymptotically correct. We also give a quantitative proof of security from information theoretic viewpoint.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Security Analysis of a Hash-Based Secret Sharing Scheme

Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...

full text

CRT Based Threshold Multi Secret Sharing Scheme

This paper presents a novel secret sharing system that is based on Chinese remainder theorem. This scheme deals with a concept of multiple secrets to be shared to different groups, such that each group receives shares of secret intended for it. The sharing is a threshold scheme, that is more than a fixed number of members from any particular group, will be able to reconstruct the secret and any...

full text

A multi-threshold secret image sharing scheme based on MSP

0167-8655/$ see front matter 2012 Published by http://dx.doi.org/10.1016/j.patrec.2012.04.010 ⇑ Corresponding author. Address: Department of Computer Science, Feng Chia University, No. 100 We 40724, Taiwan. Tel.: +886 4 24517250x3790; fax: +8 E-mail addresses: [email protected] (C. Guo Chang). In this paper, we consider the problem of secret image sharing in groups with multi-threshold access s...

full text

A Secret Sharing Scheme Based on a Symmetric Design

A , (m  ) n threshold secret sharing scheme is a method for distributing a secret amongst a group of participants. In a , (m  ) n threshold secret sharing scheme any m participants recover the secret, but no ) 1 (  m participants can [6]. Each of participants is allocated a share of the secret. The secret can only be reconstructed when the shares are combined together [2]. In this paper, we ...

full text

A NEW SECRET SHARING SCHEME ADVERSARY FUZZY STRUCTURE BASED ON AUTOMATA

In this paper,we introduce a new verifiable multi-use multi-secretsharing scheme based on automata and one-way hash function. The scheme has theadversary fuzzy structure and satisfy the following properties:1) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. 2) The scheme is based on the inversion of weakly invertible fin...

full text

A Secret Sharing Scheme Based on AES

In order to solve the key setting difficulty and the key security problem in the file encryption, key distributed storage technology may be a proper choice to help improve the safety of the key. In the paper, a novel secret sharing scheme is proposed by AES encryption algorithm for file confidentiality, dynamic key generation mechanism to generate keys, multisecret-sharing ideas on key pre-trea...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 8  issue 1

pages  25- 38

publication date 2015-12-15

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023