Security Analysis of a Hash-Based Secret Sharing Scheme
Publish place: Global Analysis And Discrete Mathematics، Vol: 1، Issue: 2
Publish Year: 1395
نوع سند: مقاله ژورنالی
زبان: English
View: 77
This Paper With 8 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_GADM-1-2_007
تاریخ نمایه سازی: 5 شهریور 1402
Abstract:
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In ۱۹۷۹, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed by t - ۱ or fewer participants. The proposed schemes by Shamir and Blakley have some drawbacks. Multi-secret and veriable schemes were invented to improve old schemes. We analysis the security of hash basedsecret sharing schemes, and show that the schemes have some drawbacks. In particular it is shown that the the schemes are not resistant against deceptive behavior by dealer and participants.
Keywords:
Authors
Majid Farhadi
School of Mathematics and Computer Science, Damghan University, Damghan, Iran
Hamideh Baypoor
School of Mathematics and Computer Science, Damghan University, Damghan, Iran
Reza Mortazavi
School of Engineering, Damghan University, Damghan, Iran
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :