Secure verifiable secret short sharing scheme for multi-cloud storage
In this paper, we propose a new approach to the construction of computationally secure secret sharing scheme based on the simultaneous use of the Residue Number System (RNS), as the symmetric encryption, and the perfect Asmuth-Bloom secret sharing scheme. We combine the useful features of Redundant...
محفوظ في:
| المؤلفون الرئيسيون: | , , , , , , , |
|---|---|
| التنسيق: | Статья |
| اللغة: | English |
| منشور في: |
Institute of Electrical and Electronics Engineers Inc.
2018
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://www.scopus.com/record/display.uri?eid=2-s2.0-85057353437&origin=resultslist&sort=plf-f&src=s&nlo=&nlr=&nls=&sid=22e0f109d206b8403376f9e7061a662f&sot=aff&sdt=sisr&sl=174&s=AF-ID%28%22North+Caucasus+Federal+University%22+60070541%29+OR+AF-ID%28%22Stavropol+State+University%22+60070961%29+OR+AF-ID%28%22stavropolskij+Gosudarstvennyj+Tehniceskij+Universitet%22+60026323%29&ref=%28Secure+verifiable+secret+short+sharing+scheme+for+multi-cloud+storage%29&relpos=0&citeCnt=0&searchTerm=# https://dspace.ncfu.ru/handle/20.500.12258/3618 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | In this paper, we propose a new approach to the construction of computationally secure secret sharing scheme based on the simultaneous use of the Residue Number System (RNS), as the symmetric encryption, and the perfect Asmuth-Bloom secret sharing scheme. We combine the useful features of Redundant RNS to design space efficient secret sharing scheme with enough level of security and to control of data integrity. This combination provides verifiability and achieves a high speed of data processing |
|---|