Intrusion-resilient secret sharing

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 227-237

  Dziembowski, Stefan ^a   Pietrzak, Krzysztof ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

(MIN ,MAX ,+) FUNCTIONS; APPLIED (CO); COMMUNICATION COMPLEXITIES; IN ORDER; MALICIOUS SOFTWARE; RECONSTRUCTION PROCEDURE; RETRIEVAL MODELS; SECRET MESSAGES; SECRET SHARING; SECURITY PROOFS; SHORT MESSAGES; TOTAL AMOUNT;

COMPUTER CRIME; COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS; KETONES; REPAIR; RESTORATION; SEPARATION;

COMPUTER VIRUSES;

EID: 46749096773     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389495     Document Type: Conference Paper

References (26)

1. Y. Aumann, Y. Z. Ding, and M. O. Rabin. Everlasting security in the bounded storage model. IEEE Transactions on Information Theory, 48(6): 1668-1680, 2002.
2. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In ACM Conference on Computer and Communications Security, pages 62-73, 1993.
3. G. R. Blakley. Safeguarding cryptographic keys. In Proc. AFIPS 1979 National Computer Conference, pages 313-317, 1979.
4. R. Canetti, R. Gennaro, A. Herzberg, and D. Naor. Proactive security: Long-term protection against break-ins. RSA CryptoBytes, 3(1):1-8, 1997.
5. D. Cash, Y. Z. Ding, Y. Dodis, W. Lee, R. J. Lipton, and S. Walfish. Intrusion-resilient key exchange in the bounded retrieval model. In TCC07, volume 4392 of LNCS, pages 479-498, 2007.
6. T. M. Cover and J. A. Thomas. Elements of Information Theory. John Wiley and Sons, Inc., 1991.
7. G. Di Crescenzo, R. J. Lipton, and S. Walfish. Perfectly secure password protocols in the bounded retrieval model. In TCC06, volume 3876 of LNCS, pages 225-244, 2006.
8. D. Dagon, W. Lee, and R. J. Lipton. Protecting secret data from insider attacks. In Financial Cryptography and Data Security, pages 16-30, 2005.
9. W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22(6):644-654, 1976.
10. W. Diffie, P. C. van Oorschot, and M. J. Wiener. Authentication and authenticated key exchanges. Designs, Codes and Cryptography, 2(2): 107-125, 1992.
11. B. Dubrov and Y. Ishai. On the randomness complexity of efficient sampling. In ACM Symposium on Theory of Computing, pages 711-720, 2006.
12. P. Duris, Z. Galii, and G. Schnitger. Lower bounds on communication complexity. Inf. Comput., 73(1): 1-22, 1987.
13. S. Dziembowski. Intrusion-Resilience Via the Bounded-Storage Model. In TCC'06, volume 3876 of LNCS, pages 207-224. Springer, 2006.
14. S. Dziembowski. On Forward-Secure Storage. In CRYPTO'06, volume 4117 of LNCS, pages 251-270, 2006.
15. S. Dziembowski and U. Maurer. Optimal randomizer efficiency in the bounded-storage model. Journal of Cryptology, 17(1):5-26, January 2004.
16. S. Dziembowski and K. Pietrzak. Intrusion-Resilient Secret Sharing. Cryptology ePrint Archive, 2007. full version of this paper.
17. D. Harnik and M. Naor. On the compressibility of np instances and cryptographic applications. In FOCS '06, pages 719-728. IEEE, 2006.
18. J. Hastad, R. Impagliazzo, L. A. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM J. Comput, 28(4): 1364-1396, 1999.
19. U. Maurer. Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology, 5(1):53-66, 1992.
20. U. Maurer. Secret key agreement by public discussion. IEEE Transactions on Information Theory, 39(3):733-742, 1993.
21. N. Nisan and A. Widgerson. Rounds in communication complexity revisited. In STOC '91, pages 419-429. ACM, 1991.
22. C. H. Papadimitriou and M. Sipser. Communication complexity. In STOC, pages 196-200. ACM, 1982.
23. A. Shamir. How to share a secret. Communications of the ACM, 22:612-613, November 1979.
24. S. P. Vadhan. Constructing locally computable extractors and cryptosystems in the bounded-storage model. Journal of Cryptology, 17(1):43-77, January 2004.
25. S. Wiesner. Conjugate coding. SIGACT News, 15(1):78-88, 1983.
26. A. Chi-Chih Yao. Some complexity questions related to distributive computing (preliminary report). In STOC '79, pages 209-213. ACM, 1979.