G(its)(2) VSR: An Information Theoretic Secure Verifiable Secret Redistribution Protocol for Long-term Archival Storage


Autoria(s): Gupta, VH; Gopinath, K
Contribuinte(s)

VH, Gupta

K, Gopinath

Data(s)

27/09/2007

Resumo

Protocols for secure archival storage are becoming increasingly important as the use of digital storage for sensitive documents is gaining wider practice. Wong et al.[8] combined verifiable secret sharing with proactive secret sharing without reconstruction and proposed a verifiable secret redistribution protocol for long term storage. However their protocol requires that each of the receivers is honest during redistribution. We proposed[3] an extension to their protocol wherein we relaxed the requirement that all the recipients should be honest to the condition that only a simple majority amongst the recipients need to be honest during the re(distribution) processes. Further, both of these protocols make use of Feldman's approach for achieving integrity during the (redistribution processes. In this paper, we present a revised version of our earlier protocol, and its adaptation to incorporate Pedersen's approach instead of Feldman's thereby achieving information theoretic secrecy while retaining integrity guarantees.

Formato

application/pdf

Identificador

http://eprints.iisc.ernet.in/19837/1/full.pdf

Gupta, VH and Gopinath, K (2007) G(its)(2) VSR: An Information Theoretic Secure Verifiable Secret Redistribution Protocol for Long-term Archival Storage. In: Fourth International IEEE Security In Storage Workshop, 27, San Diego, pp. 22-33.

Publicador

IEEE

Relação

http://eprints.iisc.ernet.in/19837/

Palavras-Chave #Computer Science & Automation (Formerly, School of Automation)
Tipo

Conference Proceedings

PeerReviewed