• No results found

Shamir's Secret Sharing

Revisiting  Non-Malleable  Secret  Sharing

Revisiting Non-Malleable Secret Sharing

... threshold secret sharing schemes in literature are ...new secret that is c times the original ...related secret (for example, two times the original ...the secret are stored on a device ...

57

A New Approach to Construct Secret Sharing Schemes Based on Field Extensions

A New Approach to Construct Secret Sharing Schemes Based on Field Extensions

... a secret sharing scheme using the some results of ...Shamir’s secret sharing scheme by using a field ...of secret sharing scheme as the ...

8

Non-Malleable  Secret  Sharing

Non-Malleable Secret Sharing

... Existing secret-sharing schemes. Most of the secret sharing schemes known are linear [Bei, chapter 4] and have nice algebraic and geometric properties, which are harnessed to obtain efficient ...

45

A Survey on De-duplication of Distributed Cloud Storage by Improving Confidentiality, Integrity and Reliability

A Survey on De-duplication of Distributed Cloud Storage by Improving Confidentiality, Integrity and Reliability

... Secret Sharing Scheme. There are two algorithms in a Secret sharing scheme, which are Share and ...The secret is divided and shared by using ...the secret can be extracted and ...

5

MULTI-LEVEL KEY DISTRIBUTION ALGORITHM FOR SECRET KEY RECOVERY SYSTEM

MULTI-LEVEL KEY DISTRIBUTION ALGORITHM FOR SECRET KEY RECOVERY SYSTEM

... for Secret Key Recovery will be introduced to improve the key recovery performance with non-divided secret ...the secret in to n row and k column [22] which size of n,k matrix needs to consider ...of ...

11

Nearly  Optimal  Robust  Secret  Sharing

Nearly Optimal Robust Secret Sharing

... recover s as long as the size of the group is larger than ...Shamir’s secret sharing scheme is robust, in the sense that it can tolerate any less than 1/3 fraction of dishonest ...correct ...

21

Secret Sharing Algorithm Implementation on Single to Multi Cloud

Secret Sharing Algorithm Implementation on Single to Multi Cloud

... using Shamirs secret sharing algorithm it is guaranteed to be more secure and harder to ...and secret sharing algorithm, to address the present security issues and present a ...

6

One Time Password Scheme Via Secret Sharing Techniques

One Time Password Scheme Via Secret Sharing Techniques

... and S/Key depend on the computational complexity of breaking encryption or hash functions for ...called Shamir-OTP that is based upon secret sharing ...

50

On Converting Secret Sharing Scheme to Visual Secret Sharing Scheme

On Converting Secret Sharing Scheme to Visual Secret Sharing Scheme

... A secret kept in a single information-carrier could be easily lost or ...damaged. Secret Sharing (SS) schemes, called (k, n) threshold schemes, have been proposed since the late 1970s to encode a ...

11

Secret  Sharing  with  Binary  Shares

Secret Sharing with Binary Shares

... the secret length ` and the number of players N be unconstrained integer ...ramp secret sharing scheme with share size q ...connecting secret sharing for one bit secret to game ...

21

Foundations  of  Homomorphic  Secret  Sharing

Foundations of Homomorphic Secret Sharing

... multiplicative secret sharing [CDM00] over a finite field F is an F -additive, perfectly secure (2, m, t)-HSS for the function F that multiplies two field ele- ...Multiplicative secret sharing ...

43

Secret  Shared  Random  Access  Machine

Secret Shared Random Access Machine

... use Shamir secret sharing which could provide information theoretic security for ...is secret shared and run on independent machines and ...

13

An Explication of Multifarious Secret Sharing Schemes

An Explication of Multifarious Secret Sharing Schemes

... the secret is shared among n participants to some prior ...a secret is shared forever only if not more than t-1 participants are ...the secret, the dealer has to decide the threshold ...on ...

5

A secret image sharing scheme for light images

A secret image sharing scheme for light images

... extended Shamirs idea, and proposed an SIS scheme based on the (r , n)-threshold scheme, in which each generated shadow image is 1/r the size of the secret image in ...a sharing process to ...

5

Chaotic Cryptographic to Maintain Security
and Authentication of Gray Scale Image by
Secret Sharing

Chaotic Cryptographic to Maintain Security and Authentication of Gray Scale Image by Secret Sharing

... of secret sharing was proposed by Shamir in 1979. Secret sharing schemes can be classified into various categories, in terms of numbers of secrets to be shared, two classes can be ...

5

Secure Data Collection in Wireless Sensor Networks using Randomized Dispersive Routes

Secure Data Collection in Wireless Sensor Networks using Randomized Dispersive Routes

... First, an information (e.g., a packet) is broken into First, an information (e.g., a packet) is broken into M shares (i.e., components of a packet that carry partial information) using a (T,M)-threshold ...

7

Simple and Efficient Secret Sharing Schemes for          Sharing Data and Image

Simple and Efficient Secret Sharing Schemes for Sharing Data and Image

... Abstract—Secret sharing is a new alternative for outsourcing data in a secure ...providers. Secret sharing based solution provides secure information dispersal by making shares of the original ...

6

Authentication of Grayscale Document Images with Data Repair Capability Using Shamir's Secret Method

Authentication of Grayscale Document Images with Data Repair Capability Using Shamir's Secret Method

... to secret image sharing is based on the (k,n)-threshold secret sharing method proposed by Shamir ...the Shamir method, to generate n shares for a group of n secret ...

9

KAD II. SECRET

KAD II. SECRET

... threshold secret sharing scheme with a threshold value of t if only a coalition of t ≤ n participants can reconstruct the secret while t−1 or fewer participants ...the secret sharing ...

6

A Survey on Secret Sharing by Visual Cryptography

A Survey on Secret Sharing by Visual Cryptography

...  [3] Dynamic multi-mystery sharing plan, presented by Han-Yu Lin, and Yi-Shiung in view of the restricted hash work. In the event that somebody needs to impart 100 images to others he needs to acquire 100 offers, ...

5

Show all 10000 documents...

Related subjects