Angebote zu "Secret" (845 Treffer)

Kategorien

Shops

Verifiable Secret Sharing
29,00 € *
ggf. zzgl. Versand

High Quality Content by WIKIPEDIA articles! In cryptography, a secret sharing scheme is verifiable if auxiliary information is included that allows players to verify their shares as consistent. More formally, verifiable secret sharing ensures that even if the dealer is malicious there is a well-defined secret that the players can later reconstruct. (In standard secret sharing, the dealer is assumed to be honest.) The concept of verifiable secret sharing (VSS) was first introduced in 1985 by Benny Chor, Shafi Goldwasser, Silvio Micali and Baruch Awerbuch. In a VSS protocol a distinguished player who wants to share the secret is referred to as the dealer. The protocol consists of two phases: a sharing phase and a reconstruction phase. Sharing: Initially the dealer holds secret as input and each player holds an independent random input. The sharing phase may consist of several rounds. At each round each player can privately send messages to other players and it can also broadcast a message. Each message sent or broadcast by a player is determined by its input, its random input and messages received from other players in previous rounds.

Anbieter: Dodax
Stand: 20.01.2020
Zum Angebot
Secret Sharing in User Hierarchy
50,40 € *
ggf. zzgl. Versand

Secret sharing in user hierarchy represents a challenging area for research. A lot of research work has already been done in this direction. This book presents a novel approach to share a secret among a hierarchy of users while overcoming the limitations of the already existing mechanisms. Traditional (k + 1, n)-threshold secret sharing, is secure as long as an adversary can compromise not more than k secret shares. But in real life it is often feasible for an adversary to obtain more than k shares over a long period of time. Here we present a way to overcome this vulnerability, while implementing our hierarchical secret sharing scheme. The use of Elliptic Curve Cryptography makes the computations easier and faster in our work. At present, a number of efficient schemes exist for sharing a secret into a group of users who are arranged into a hierarchy. Incidentally, all existing schemes have been developed considering non-overlapping hierarchies. This book presents a generalization of the existing hierarchical secret sharing schemes, which is applicable to an overlapping or tangled user hierarchy.

Anbieter: Dodax AT
Stand: 20.01.2020
Zum Angebot
Secret Sharing in User Hierarchy
49,00 € *
ggf. zzgl. Versand

Secret sharing in user hierarchy represents a challenging area for research. A lot of research work has already been done in this direction. This book presents a novel approach to share a secret among a hierarchy of users while overcoming the limitations of the already existing mechanisms. Traditional (k + 1, n)-threshold secret sharing, is secure as long as an adversary can compromise not more than k secret shares. But in real life it is often feasible for an adversary to obtain more than k shares over a long period of time. Here we present a way to overcome this vulnerability, while implementing our hierarchical secret sharing scheme. The use of Elliptic Curve Cryptography makes the computations easier and faster in our work. At present, a number of efficient schemes exist for sharing a secret into a group of users who are arranged into a hierarchy. Incidentally, all existing schemes have been developed considering non-overlapping hierarchies. This book presents a generalization of the existing hierarchical secret sharing schemes, which is applicable to an overlapping or tangled user hierarchy.

Anbieter: Dodax
Stand: 20.01.2020
Zum Angebot
Sharing the Secret
7,49 € *
zzgl. 1,49 € Versand

Alison Lohman (Where The Truth Lies, Big Fish, White Oleander), one of the most gifted young acting talents to have emerged in recent years, gives a riveting performance as a teenage girl whose seemingly perfect life obscures a nightmare reality in Sharing The Secret. Graced with an intelligent and perceptive script and subtle, committed performances from its cast, this superb drama, which won a Peabody Award, deals with an emotional issue that afflicts many teenagers but which is one of the most difficult to bring out into the open. Beth Moss (Lohman) has a life that seems right in every detail. She has good looks, sharp intelligence, a comfortable home life and a loving relationship with her divorced parents - mother Nina (Mare Winningham, St Elmo's Fire, E.R.) and father John (Tim Matheson, The West Wing). But the one vital factor missing from Beth's life is control over her own wants and needs. She presents a veneer of happiness to please her parents, her school work is so good that her teachers accuse her of cheating, she despises her shallow friends and she will never be the great dancer she craves to be. To cope with this emotional wasteland, Beth turns her fear, rage and misery in on herself and becomes bulimic, binge-eating and purging herself. For years she keeps her condition a secret - until in one sensational revelation the secret comes to light with powerful emotional consequences for all concerned. But only by bringing her 'secret' out into the open and sharing it with those who can help her can Beth have any chance of both health and happiness.

Anbieter: Zavvi
Stand: 20.01.2020
Zum Angebot
Secret Sharing Using the Chinese Remainder Theorem
35,00 € *
ggf. zzgl. Versand

High Quality Content by WIKIPEDIA articles! Secret sharing consists of recovering a secret S from a set of shares, each containing partial information about the secret. Secret sharing can thus use the CRT to produce the shares presented in the congruence equations and the secret could be recovered by solving the system of congruences to get the unique solution, which will be the secret to recover. There are several types of secret sharing schemes. The most basic types are the so-called threshold schemes, where only the cardinality of the set of shares matters. In other words, given a secret S, and n shares, any set of t shares is a set with the smallest cardinality from which the secret can be recovered, in the sense that any set of t-1 shares is not enough to give S. This is known as a threshold access structure. We call such schemes (t,n) threshold secret sharing schemes, or t-out-of-n scheme. Threshold secret sharing schemes differ from one another by the method of generating the shares, starting from a certain secret.

Anbieter: Dodax AT
Stand: 20.01.2020
Zum Angebot
Secret Sharing Using the Chinese Remainder Theorem
34,00 € *
ggf. zzgl. Versand

High Quality Content by WIKIPEDIA articles! Secret sharing consists of recovering a secret S from a set of shares, each containing partial information about the secret. Secret sharing can thus use the CRT to produce the shares presented in the congruence equations and the secret could be recovered by solving the system of congruences to get the unique solution, which will be the secret to recover. There are several types of secret sharing schemes. The most basic types are the so-called threshold schemes, where only the cardinality of the set of shares matters. In other words, given a secret S, and n shares, any set of t shares is a set with the smallest cardinality from which the secret can be recovered, in the sense that any set of t-1 shares is not enough to give S. This is known as a threshold access structure. We call such schemes (t,n) threshold secret sharing schemes, or t-out-of-n scheme. Threshold secret sharing schemes differ from one another by the method of generating the shares, starting from a certain secret.

Anbieter: Dodax
Stand: 20.01.2020
Zum Angebot
Secret Image Sharing Based on Transform Coding
63,70 € *
ggf. zzgl. Versand

The main challenges facing secure image sharing tasks are the increase of sharing volume and sharing-control flexibility. In this book a novel scheme based on transform coding has been developed to perform secret image sharing in the case when the secret image is a colored image with enough sharing control features and as minimum as possible shares sizes. The main signal decomposition attribute of the transform is utilized to divide the secret image into uncorrelated shares, and each share will be separately encrypted

Anbieter: Dodax AT
Stand: 20.01.2020
Zum Angebot
Secret Image Sharing Based on Transform Coding
61,90 € *
ggf. zzgl. Versand

The main challenges facing secure image sharing tasks are the increase of sharing volume and sharing-control flexibility. In this book a novel scheme based on transform coding has been developed to perform secret image sharing in the case when the secret image is a colored image with enough sharing control features and as minimum as possible shares sizes. The main signal decomposition attribute of the transform is utilized to divide the secret image into uncorrelated shares, and each share will be separately encrypted

Anbieter: Dodax
Stand: 20.01.2020
Zum Angebot
Verifiable Secret Sharing
26,99 € *
ggf. zzgl. Versand

Erscheinungsdatum: 02/2010, Medium: Taschenbuch, Einband: Kartoniert / Broschiert, Titel: Verifiable Secret Sharing, Titelzusatz: Cryptography, Secret Sharing, Shafi Goldwasser, Silvio Micali, Secure Multi-Party Computation, Homomorphic Encryption, Discrete Logarithm, Multiplicative Group of Integers Modulo n, Redaktion: Surhone, Lambert M. // Timpledon, Miriam T. // Marseken, Susan F., Verlag: Betascript Publishers, Sprache: Englisch, Rubrik: Mathematik // Sonstiges, Seiten: 72, Informationen: Paperback, Gewicht: 128 gr, Verkäufer: averdo

Anbieter: averdo
Stand: 20.01.2020
Zum Angebot