نتایج جستجو برای: multi secret sharing scheme

تعداد نتایج: 752839  

Journal: :I. J. Network Security 2014
Y. V. Subba Rao Chakravarthy Bhagvati

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...

Journal: :I. J. Network Security 2015
Bin Feng Cheng Guo Mingchu Li Zhi-Hui Wang

A proactive secret sharing scheme is a method of sharing a secret among a set of participants. And, the corresponding shadows can be periodically renewed under the premise of never changing the shared secret. However, in the most existing proactive secret sharing schemes, only one secret can be shared during one secret sharing process. The proposed scheme describes PMSS, a new way to share mult...

2014
Amos Beimel Aner Ben-Efraim Carles Padró Ilya Tyomkin

Multi-linear secret-sharing schemes are the most common secret-sharing schemes. In these schemes the secret is composed of some field elements and the sharing is done by applying some fixed linear mapping on the field elements of the secret and some randomly chosen field elements. If the secret contains one field element, then the scheme is called linear. The importance of multi-linear schemes ...

Journal: :EURASIP J. Adv. Sig. Proc. 2010
Daoshun Wang Feng Yi

Traditional Secret Sharing (SS) schemes reconstruct secret exactly the same as the original one but involve complex computation. Visual Secret Sharing (VSS) schemes decode the secret without computation, but each share is m times as big as the original and the quality of the reconstructed secret image is reduced. Probabilistic visual secret sharing (Prob.VSS) schemes for a binary image use only...

2003
Chou-Chen Yang Ting-Yi Chang Min-Shiang Hwang

10 In the ðt; nÞ multi-secret sharing scheme, there are n participants in the system. At 11 least t or more participants can easily pool their secrets shadows and reconstruct p 12 secrets at the same time. Chien et al. [IEICE Trans. Fundamentals E83-A (2000) 2762] 13 used (nþ p t þ 1) public values, ð2ðnþ pÞ tÞ ðnþ pÞ storages, and solved (nþ 14 p t) simultaneous equations to share p secrets. I...

Journal: :IEICE Transactions 2005
Daisuke Hayashi Toshiyuki Miyamoto Shinji Doi Sadatoshi Kumagai

For mission-critical and safety-critical systems such as medical, financial, or administrative information systems, a secure and reliable storage system is indispensable. The main purpose of our research is to develop a highly secure and highly reliable storage system. We have proposed a storage system that utilizes a secret sharing scheme. The storage system is called the Secret Sharing Storag...

Journal: :IACR Cryptology ePrint Archive 2008
Mira Belenkiy

A disjunctive multi-level secret sharing scheme divides users into different levels. Each level L is associated with a threshold tL, and a group of users can only recover the secret if, for some L, there are at least tL users at levels 0....L in the group. We present a simple ideal disjunctive multi-level secret sharing scheme – in fact, the simplest and most direct scheme to date. It is the fi...

2012
Cheng Guo Chin-Chen Chang

Many efficient secret sharing schemes for general access structures have been developed in efforts to deal with the problems of multi-party computations (MPC), threshold cryptography, and access control. In this paper, we have proposed a novel secret sharing scheme with general access structures that is based on the key-lock-pair mechanism. In our scheme, the dealer can assess a real situation ...

Journal: :The Scientific World Journal 2014

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید