Using Byzantine Quorum Systems to Manage Confidential Data

dc.contributor.author Subbiah, Arun
dc.contributor.author Ahamad, Mustaque
dc.contributor.author Blough, Douglas M.
dc.date.accessioned 2004-08-11T19:16:56Z
dc.date.available 2004-08-11T19:16:56Z
dc.date.issued 2004-04-01
dc.description.abstract This paper addresses the problem of using proactive cryptosystems for generic data storage and retrieval. Proactive cryptosystems provide high security and confidentiality guarantees for stored data, and are capable of withstanding attacks that may compromise all the servers in the system over time. However, proactive cryptosystems are unsuitable for generic data storage uses for two reasons. First, proactive cryptosystems are usually used to store keys, which are rarely updated. On the other hand, generic data could be actively written and read. The system must therefore be highly available for both write and read operations. Second, existing share renewal protocols (the critical element to achieve proactive security) are expensive in terms of computation and communication overheads, and are time consuming operations. Since generic data will be voluminous, the share renewal process will consume substantial system resources and cause a significant amount of system downtime. Two schemes are proposed that combine Byzantine quorum systems and proactive secret sharing techniques to provide high availability and security guarantees for stored data, while reducing the overhead incurred during the share renewal process. Several performance metrics that can be used to evaluate proactively-secure generic data storage schemes are identified. The proposed schemes are thus shown to render proactive systems suitable for confidential generic data storage. en
dc.format.extent 222064 bytes
dc.format.mimetype application/pdf
dc.identifier.uri http://hdl.handle.net/1853/98
dc.language.iso en_US
dc.publisher Georgia Institute of Technology
dc.relation.ispartofseries CERCS;GIT-CERCS-04-13
dc.subject Byzantine quorum systems
dc.subject Communication overheads
dc.subject Computation overheads
dc.subject Confidential generic data storage
dc.subject Proactive cryptosystems
dc.subject Proactive secret sharing techniques
dc.subject Read and write operations
dc.subject Renewal protocols
dc.subject Security
dc.subject System resource sharing
dc.title Using Byzantine Quorum Systems to Manage Confidential Data en
dc.type Text
dc.type.genre Technical Report
dspace.entity.type Publication
local.contributor.author Blough, Douglas M.
local.contributor.author Ahamad, Mustaque
local.contributor.corporatename Center for Experimental Research in Computer Systems
local.relation.ispartofseries CERCS Technical Report Series
relation.isAuthorOfPublication 361410e1-2656-48cf-8d91-a4cd3d538c29
relation.isAuthorOfPublication ff12601d-fe5b-4a48-8669-1e1e1bc16440
relation.isOrgUnitOfPublication 1dd858c0-be27-47fd-873d-208407cf0794
relation.isSeriesOfPublication bc21f6b3-4b86-4b92-8b66-d65d59e12c54
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
216.86 KB
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
1.85 KB
Item-specific license agreed upon to submission