• DOI:10.1109/FOCS.2007.63
Corpus ID: 7408818

Intrusion-Resilient Secret Sharing

@article{Dziembowski2007IntrusionResilientSS,
  title={Intrusion-Resilient Secret Sharing},
  author={Stefan Dziembowski and K. Pietrzak},
  journal={48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)},
  year={2007},
  pages={227-237}
}

Stefan Dziembowski, K. Pietrzak

Published 2007

Computer Science

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)

We introduce a new primitive called intrusion-resilient secret sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed interactively using low communication complexity in k, but not in k-1 rounds. IRSS is a means of sharing a secret message amongst a set of players which comes with a very strong security guarantee. The shares in an IRSS are made artificially large so that it is hard to retrieve them completely, and the reconstruction… CONTINUE READING

View on IEEE

eprint.iacr.org

Save to Library

Create Alert

Cite

Launch Research Feed