How to withstand mobile virus attacks (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
On the information rate of secret sharing schemes
Theoretical Computer Science
How to construct efficient signcryption schemes on elliptic curves
Information Processing Letters
Communications of the ACM
Secret Sharing in Multilevel and Compartmented Groups
ACISP '98 Proceedings of the Third Australasian Conference on Information Security and Privacy
How to (Really) Share a Secret
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Digital Signcryption or How to Achieve Cost(Signature & Encryption)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Signcryption based on elliptic curve and its multi-party schemes
InfoSecu '04 Proceedings of the 3rd international conference on Information security
Hierarchical Threshold Secret Sharing
Journal of Cryptology
Multipartite Secret Sharing by Bivariate Interpolation
Journal of Cryptology
Ideal Perfect Multilevel Threshold Secret Sharing Scheme
IAS '09 Proceedings of the 2009 Fifth International Conference on Information Assurance and Security - Volume 02
Two birds one stone: signcryption using RSA
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Ideal hierarchical secret sharing schemes
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Improved signcryption from q-Diffie-Hellman problems
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Characterizing ideal weighted threshold secret sharing
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Hi-index | 0.00 |
Most of the existing hierarchical secret-sharing schemes are unconditionally (non-cryptographically) secured, and they cannot survive from various types of attacks especially when the participants use resource-constrained wireless mobile devices. In our proposed secured hierarchical secret-sharing scheme, the participants are partitioned into different levels according to their ranks in any organization. In this hierarchy-based secret-sharing scheme, the trusted dealer distributes the delegated secret keys as shares to the participants through our proposed signcryption scheme that reduces computational cost and communication overhead. Again, the participants submit the signcrypted shares to the trusted dealer for reconstruction of the secret key. The proposed scheme distinguishes each level of hierarchy qualitatively, and any type of active or passive adversary or colluding participants cannot reconstruct the secret key. The novelty of our scheme is that it is conditionally (cryptographically) as well as unconditionally secured, and the participants may use resource-constrained wireless mobile devices. The access structure chosen for our scheme increases the resilience of our scheme. Our proposed scheme is perfect and ideal. Copyright © 2011 John Wiley & Sons, Ltd.