By Topic

A Secure Storage System Combining Secret Sharing Schemes and Byzantine Quorum Mechanisms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Qiongxiao Wang ; State Key Lab. of Inf. Security, Grad. Univ. of Chinese Acad. of Sci., Beijing, China ; Jiwu Jing ; Jingqiang Lin

By combining Byzantine quorum systems (BQS) and secret sharing schemes, this paper presents a secure storage system, S2-BQS, tolerating servers' Byzantine failures. S2-BQS provides information-theoretic security for the stored sensitive data inherited from perfect secret sharing schemes (PSS). Compared to traditional realizations of BQS in storage systems, S2-BQS doesn't replicate data in servers directly. Instead, secret shares obtained from PSS are stored in different servers. To retrieve the correct data from S2-BQS, we design a new verification method for PSS without using any extra information or extra algorithms except reconstructing the secret for several times using PSS. Due to the simplicity of S2-BQS's structure and protocols, the computation and communication overhead on servers are low, making it almost impossible to launch resource-clogging denial-of-service attacks to servers in S2-BQS. We also propose a specialized S2-BQS called S3-BQS in which Shamir's secret sharing scheme is employed. It shows that our approach is flexible and easy to be realized. The system evaluation shows that an S3-BQS with optimized protocols has better computation performance.

Published in:

Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on

Date of Conference:

June 29 2010-July 1 2010