Communication Efficient Secret Sharing

DOI10.1109/TIT.2016.2616144MaRDI QIDQ2976440zbMATH OpenOpenAlexFDO

Authors Wentao Huang, Michael Langberg, Jörg Kliewer, Jehoshua Bruck

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1505.07515

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Abstract: A secret sharing scheme is a method to store information securely and reliably. Particularly, in a threshold secret sharing scheme, a secret is encoded into $n$ shares, such that any set of at least $t_1$ shares suffice to decode the secret, and any set of at most $t_2<t_1$ shares reveal no information about the secret. Assuming that each party holds a share and a user wishes to decode the secret by receiving information from a set of parties; the question we study is how to minimize the amount of communication between the user and the parties. We show that the necessary amount of communication, termed "decoding bandwidth", decreases as the number of parties that participate in decoding increases. We prove a tight lower bound on the decoding bandwidth, and construct secret sharing schemes achieving the bound. Particularly, we design a scheme that achieves the optimal decoding bandwidth when $d$ parties participate in decoding, universally for all $t_{1}ledlen$. The scheme is based on Shamir's secret sharing scheme and preserves its simplicity and efficiency. In addition, we consider secure distributed storage where the proposed communication efficient secret sharing schemes further improve disk access complexity during decoding.

Cited in

(10)

• Universal secure rank-metric coding schemes with optimal communication overheads
• Secure Distributed Information Exchange
• A novel secret sharing scheme using multiple share images
• Security analysis of a dynamic threshold secret sharing scheme using linear subspace method
• Full threshold change range of threshold changeable secret sharing
• On Regenerating Codes and Proactive Secret Sharing: Relationships and Implications
• A practical and efficient quantum threshold secret sharing scheme
• A communication-efficient quantum threshold secret sharing scheme
• Threshold changeable ramp secret sharing
• Ramp scheme based on CRT for polynomial ring over finite field

This page was built for publication: Communication Efficient Secret Sharing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976440)