Skip to main content
Conference ProceedingsOPEN ACCESS

Unconditionally-secure robust secret sharing with compact shares

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7237 LNCS 195-208
DOI: 10.1007/978-3-642-29011-4_13
41Citations
Citations of this article
54Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We consider the problem of reconstructing a shared secret in the presence of faulty shares, with unconditional security. We require that any t shares give no information on the shared secret, and reconstruction is possible even if up to t out of the n shares are incorrect. The interesting setting is n/3≤t

Cite

CITATION STYLE

APA

Cevallos, A., Fehr, S., Ostrovsky, R., & Rabani, Y. (2012). Unconditionally-secure robust secret sharing with compact shares. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7237 LNCS, pp. 195–208). https://doi.org/10.1007/978-3-642-29011-4_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free