Cryptology ePrint Archive: Report 2017/719

Efficient Proactive Secret Sharing

Jacqueline Brendel and Denise Demirel

Abstract: The secure storage of long-lived sensitive data is constantly growing in its relevance due to the ever increasing digitization of documents. One very important challenge of this research field is to provide confidentiality for the stored data even in the long term. The only known approach to achieve this, as required, for instance, for medical records, is to use proactive secret sharing. However, all currently known schemes suffer from being inefficient. They require information-theoretic secure communication channels between any two shareholders and between the client and each shareholder and come with a high communication complexity. Thus, this work addresses the scenario where only a subset of servers holding shares is connected via private channels. Furthermore, it is sufficient if there is only one private channel between the client and one shareholder. In addition to improving practicability the presented proactive secret sharing solution, called EPSS, performs data aggregation to provide an efficient solution with respect to the communication complexity. Nevertheless, it still provides unconditional confidentiality for the data at rest and towards external attackers eavesdropping the communication channels.

Category / Keywords: cryptographic protocols / secret sharing, proactive secret sharing, long-term security

Original Publication (with major differences): 14th Annual Conference on Privacy, Security and Trust (PST), 2016
DOI:
10.1109/PST.2016.7907013

Date: received 25 Jul 2017

Contact author: jacqueline brendel at cryptoplexity de

Available format(s): PDF | BibTeX Citation

Version: 20170727:181620 (All versions of this report)

Short URL: ia.cr/2017/719

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]