Efficient multistage secret sharing scheme using bilinear map

Fatemi, Mitra; Ghasemi, Reza; Eghlidos, Taraneh; Aref, Mohammad Reza

doi:10.1049/iet-ifs.2013.0046

Cited by 16 publications

(28 citation statements)

References 32 publications

(42 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed method is compared against the studies of Fatemi et al and Jikai and Chuankun in terms of performance analysis. The studies of Fatemi et al and Jikai and Chuankun employed the shared secret technique based on bilinear pairing, which, as shown in Table , is a cryptography technique that computes time . This study computes authentication, private communication, and shared secret keys, as shown in Table , obtaining results by analyzing computed time of Table .…”

Section: Performance Analysismentioning

confidence: 99%

A home security system for seniors based on the beacon technology

Tsai

2018

Concurrency and Computation

View full text Add to dashboard Cite

Summary Many elderly people have a hard time adapting to information technology (IT); for instance, many wearable devices have such rich functions that render them highly power‐consuming, creating operational difficulties for the elderly. The wearable devices must constantly be recharged, which is also an issue for disabled elderly people. Hence, this study utilizes transmitter and receiver of the beacon to learn about the habits of elderly people in their residence while monitoring their heart rate to track their physical condition; when and if they press the medical alarm, help can be sent on their way. This study uses the beacon device to position the location of elderly people in their residence. We have developed a wearable wristband that transmits data through the beacon. The only button on the wristband is a medical alarm; other functions include home positioning and heart rate monitoring, which operate automatically to relieve the elderly people from information technology adaptation issues. This paper will also develop an integrative monitoring platform that aims at detecting whether an elderly person has pressed the medical alarm as well as analyzing whether their heart rate is regular. Given that elderly people stay mostly within the range of their residence, the platform will conduct statistical analysis on schedule of the elderly person of being in and out of the house; if they have left their house for too long or have displayed irregular behavior in leaving or entering the house, then their family will be notified. The proposed method has added privacy and access authority control to prevent malicious parties from tracking the schedule or the residence of elderly people from being invaded. This study has also completed application development and conducted privacy efficacy analysis.

show abstract

Section: Performance Analysismentioning

confidence: 99%

A home security system for seniors based on the beacon technology

Tsai

2018

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…This approach imposes severe condition in terms of efficiency. 18,19 It can be proven that share size in this kind of schemes is at least linear size of all secrets. To address this inefficiency, weaker unconditional security definition was proposed.…”

Section: Introductionmentioning

confidence: 98%

“…Therefore, recent proposed schemes have tried to reduce the number of public values. 10,19,25,[27][28][29][30][31] A comprehensive comparison between the presented MSS scheme and other schemes in Section 5 indicates that the number of the public values in the scheme is acceptable. The second factor is the size of the shares.…”

Section: Introductionmentioning

confidence: 99%

Efficient multisecret sharing scheme using new proposed computational security model

Ghasemi

Safi

Dehkordi

2017

Int J Communication

Self Cite

View full text Add to dashboard Cite

SummaryA multisecret sharing (MSS) is a method for sharing a set of secrets among some participants. They can recover each of these secrets without endangering the other secrets. Two kinds of security models have been proposed for MSS schemes. These models are categorized into 2 types. The first security model is unconditional security. This approach decreases the efficiency of MSS schemes.Therefore, the second type of security, which is more relaxed, appeared. This approach is called computational security. In this paper, with 2 examples, we will show that the current definition of computational security does not satisfy all of our expectations from a secure MSS scheme. In fact, in these examples, recovering a secret leaks information to the other secrets while these schemes are considered secure in view of the computational security. After determining the shortcomings of the current security definition, we propose a new definition for computational security and present an MSS scheme that enjoys rigorous proof of security in terms of the new definition. In addition, a complete comparison in terms of share size, number of public values, and required operations for recovering a secret between our scheme and previous schemes indicates that the presented scheme is efficient.

show abstract

“…In these schemes, each participant is given one share to recover all the secrets, the size of which is the same as the size of the secrets. These schemes only provide computational security [14]. Pang et al [15] proposed a multi-secret sharing scheme for general access structure in 2006.…”

Section: Introductionmentioning

confidence: 99%

“…All the existing TMSSS schemes are based on one-way (hash) functions [14,18,19], two-variable one-way functions [20,21], and assumptions such as di culty of solving discrete logarithm problem [22], which can now be threatened by quantum algorithms.…”

Section: Introductionmentioning

confidence: 99%

A lattice-based changeable threshold multi-secret sharing scheme and its application to threshold cryptography

Pilaram

Eghlidos

2017

Scientia Iranica

View full text Add to dashboard Cite

Abstract. In this paper, we propose a threshold increasing algorithm for a (t; n) latticebased Threshold Multi-Stage Secret Sharing (TMSSS) scheme. To realize the changeability feature, we use the zero addition protocol to construct a new (t 0 ; n) TMSSS scheme. Therefore, the new scheme enjoys the signi cant feature of threshold changeability along with the inherited features of being multi-stage, multi-use, and veri able derived from our previously proposed lattice-based TMSSS scheme. Furthermore, we use the improved TMSSS scheme to propose a threshold decryption algorithm for the Learning With Error (LWE) based public key encryption scheme based on the study of Lindner and Peikert. For threshold decryption, each authorized subset of participants decrypts the ciphertext partially and sends the result to the combiner. The combiner can decrypt the ciphertext using the partial decryptions. The security of both schemes is based on hardness of lattice problems, i.e. LWE and Inhomogeneous Small Integer Solution (ISIS) problems, which are believed to resist against the quantum algorithms. The proposed schemes are e cient, especially on the participants' side, making them suitable for the applications in which the participants have limited processing capacities.

show abstract

Efficient multistage secret sharing scheme using bilinear map

Cited by 16 publications

References 32 publications

A home security system for seniors based on the beacon technology

A home security system for seniors based on the beacon technology

Efficient multisecret sharing scheme using new proposed computational security model

A lattice-based changeable threshold multi-secret sharing scheme and its application to threshold cryptography

Contact Info

Product

Resources

About