Performance evaluation on data management approach for multiple clouds using secret sharing scheme

Kanai, Atsushi; Tanimoto, Shigeaki; Satō, Hiroyuki

doi:10.1109/icce.2016.7430695

Cited by 4 publications

(3 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Using a one-way hash function, they proposed a TMSSS scheme, in which the shares can be reused by some technical measures, when we wish to share new secrets. In multi-use or multi-stage secret sharing schemes, the following two general security requirements are needed: (1) While recovering the secret(s), the participants should not reveal the original shares. (2) The secrecy of the other unreconstructed secrets should be computationally independent from the reconstructed secrets.…”

Section: Introductionmentioning

confidence: 99%

“…Secret sharing schemes are cryptographic primitives to protect a secret by sharing it to some values and assign them to different users. These schemes are used in many different applications such as cloud computing [1], key management in sensor networks [2], electronic voting [3] and electronic cash [4]. Secret sharing provides solutions for data privacy, availability, integrity and verifiability, which makes it suitable for these applications.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An efficient lattice‐based threshold signature scheme using multi‐stage secret sharing

Pilaram

Eghlidos

Toluee

2020

IET Information Security

View full text Add to dashboard Cite

Secret sharing is a cryptographic technique used in many different applications such as cloud computing, multi‐party computation and electronic voting. Security concerns in these applications are data privacy, availability, integrity and verifiability, where secret sharing provides proper solutions. The authors address some important features like verifiability and being multi‐stage to make it usable in various field of application. Here, the authors propose an anonymous threshold signature scheme based on the trapdoor function introduced by Micciancio and Peikert by sharing the private key using a lattice‐based threshold multi‐stage secret sharing (TMSSS) scheme. Then, the authors improve the previously proposed TMSSS scheme, in such a way that less public values are required to publish on the bulletin board which makes the scheme more efficient while preserving the security of the scheme based on the lattice hard problems. The proposed scheme inherits the desired features such as anonymity and verifiability from the improved TMSSS scheme. Furthermore, both schemes use simple matrix operations, which additionally increase the efficiency.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

An efficient lattice‐based threshold signature scheme using multi‐stage secret sharing

Pilaram

Eghlidos

Toluee

2020

IET Information Security

View full text Add to dashboard Cite

show abstract

“…Secret sharing is a cryptographic primitive with many applications such as key management in sensor networks [1], electronic cash [2], electronic voting [3], and cloud computing [4]. A secret sharing scheme splits a secret among a set of parties, called participants, in such a way that some authorized subsets of the participants can reconstruct the secret using their assigned values, called shares, by a trusted third party named dealer.…”

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

A Performance Evaluation of Data Storage Approach for High Availability and Confidentiality on Multi-cloud

Miura

Wakabayashi

Ueno

et al. 2017

Advances in Network-Based Information Systems

View full text Add to dashboard Cite

Performance evaluation on data management approach for multiple clouds using secret sharing scheme

Cited by 4 publications

References 7 publications

An efficient lattice‐based threshold signature scheme using multi‐stage secret sharing

An efficient lattice‐based threshold signature scheme using multi‐stage secret sharing

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

A Performance Evaluation of Data Storage Approach for High Availability and Confidentiality on Multi-cloud

Contact Info

Product

Resources

About