An efficient hierarchical identity-based key-sharing method resistant against collusion-attacks

DOI10.1007/978-3-540-48000-6_28MaRDI QIDQ4502513zbMATH OpenFDO

Authors Goichiro Hanaoka, Tsuyoshi Nishioka, Yuliang Zheng, Hideki Imai

Publication date 29 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-48000-6_28

zbMATH Keywords

hierarchical KPSkey predistribution systemskey sharing schemes

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• A Hierarchical Non-interactive Key-Sharing Scheme with Low Memory Size and High Resistance against Collusion Attacks
• Optimal construction of unconditionally secure ID-based key sharing scheme for large-scale networks
• A new digital signature scheme on ID-based key-sharing infrastructures
• A practical implementation of hierarchically structured key predistribution system and its evaluation
• A new ID-based key sharing system

Cited in

(6)

• Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions
• User Collusion Avoidance Scheme for Privacy-Preserving Decentralized Key-Policy Attribute-Based Encryption
• A new ID-based key sharing system
• A Hierarchical Non-interactive Key-Sharing Scheme with Low Memory Size and High Resistance against Collusion Attacks
• Optimal construction of unconditionally secure ID-based key sharing scheme for large-scale networks
• HIBE: hierarchical identity-based encryption

This page was built for publication: An efficient hierarchical identity-based key-sharing method resistant against collusion-attacks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4502513)