ISBN: 9783659342646 - secret sharing in user hierarchy: share generation, distribution and renewal (8 resultados)

Condición: New. pp. 64.

Taschenbuch. Condición: Neu. Secret Sharing in User Hierarchy | Share Generation, Distribution and Renewal | Ruchira Naskar | Taschenbuch | 64 S. | Englisch | 2013 | LAP LAMBERT Academic Publishing | EAN 9783659342646 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. …

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 64 pp. Englisch.…

Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.…

Condición: New. Print on Demand pp. 64 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Naskar Ruchirareceived B.Tech and M.Tech degrees in Information Technology from West Bengal University of Technology (2008) and IIT Kharagpur (2010), respectively. Currently she is a Ph.D. scholar in the Department of Computer Scienc. …

Condición: New. PRINT ON DEMAND pp. 64.

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.OmniScriptum SRL, Str. Armeneasca 28/1, office 1, 2012 Chisinau 64 pp. Englisch.…