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
    111 Citations
    Intrusion-Resilient Secret Sharing
    • 26
    Leakage-Resilient Secret Sharing Against Colluding Parties
    • 10
    • Highly Influenced
    • PDF
    Leakage Resilient Secret Sharing and Applications
    • 21
    • PDF
    Key-Evolution Schemes Resilient to Space-Bounded Leakage
    • 37
    • PDF
    Leakage-Resilient Secret Sharing
    • 16
    • PDF
    Leakage-Resilient Cryptography in the Standard Model
    • 11
    • PDF
    Non-malleable secret sharing
    • 37
    • PDF
    Leakage-Resilient Cryptography
    • 478
    • PDF

    References

    SHOWING 1-10 OF 36 REFERENCES
    Intrusion-Resilient Secret Sharing
    • 26
    Intrusion-Resilient Key Exchange in the Bounded Retrieval Model
    • 65
    • PDF
    Protecting Secret Data from Insider Attacks
    • 21
    • PDF
    Intrusion-Resilience Via the Bounded-Storage Model
    • 125
    • PDF
    On Forward-Secure Storage
    • 34
    • PDF
    Perfectly Secure Password Protocols in the Bounded Retrieval Model
    • 136
    • PDF
    Everlasting security in the bounded storage model
    • 131
    Optimal Randomizer Efficiency in the Bounded-Storage Model
    • 67
    • PDF
    Conditionally-perfect secrecy and a provably-secure randomized cipher
    • U. Maurer
    • Mathematics, Computer Science
    • Journal of Cryptology
    • 2004
    • 254
    Proactive Security: Long-term protection against break-ins
    • 81