Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

31

AINA
2005
IEEE

favoriteEmaildiscussreport

126views Computer Networks» more AINA 2005»

Efficient Secret Sharing with Access Structures in a Hierarchy

14 years 4 months ago

Efficient Secret Sharing with Access Structures in a Hierarchy

Download islab.csie.thu.edu.tw

2004, Chang et al. suggested an approach that solves the problem of secret sharing with access structures in a hierarchy. They used the concept of discrete logarithmto reuse shadows, and adopted Cho [4]mechanism to achieve theproperties of hierarchical key management. However, Changk scheme requires a lot of time for computation. this paper, we adopt one-way hash function to allow the shadows to be reused and achieve the properties of hierarchical access control. The proposed scheme more than Changk scheme.

Chu-Hsing Lin, Wei Lee

Real-time Traffic

AINA 2005 | Computer Networks | Hierarchical Key Management | Logarithmto Reuse Shadows | One-way Hash Function |

claim paper

Related Content

» Secret Sharing with Access Structures in a Hierarchy

» Dynamic Key Generations for Secret Sharing in Access Structures

» Visual Secret Sharing Schemes with Cyclic Access Structure for Many Images

» Access Control and Signatures via Quorum Secret Sharing

» On the complexity of verifiable secret sharing and multiparty computation

» Secret Sharing and NonShannon Information Inequalities

» General Secure Multiparty Computation from any Linear SecretSharing Scheme

» Strongly secure ramp secret sharing schemes for general access structures

» Secret Sharing Schemes With General Access Structure Based On MSPs

Post Info
More Details (n/a)

Added	24 Jun 2010
Updated	24 Jun 2010
Type	Conference
Year	2005
Where	AINA
Authors	Chu-Hsing Lin, Wei Lee

Comments (0)