Coding for trusted storage in untrusted networks

IEEE Transactions on Information Forensics and Security

Volumn 7, Issue 6, 2012, Pages 1890-1899

  Oliveira, Paulo F ^a   Lima, Luísa ^a   Vinhoza, Tiago T V ^a   Barros, João ^a   Medard, Muriel ^b  

^a INSTITUTO DE TELECOMUNICAÇÕES   (Portugal)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Distributed storage; erasure codes; security

Indexed keywords

CODED SYMBOLS; DISTRIBUTED STORAGE; ERASURE CODES; ERASURE CODING; OR-NETWORKS; SECURITY; SQUARE SUBMATRICES; THRESHOLD NUMBERS; UNTRUSTED NETWORK;

COMPUTER NETWORKS; SAFETY ENGINEERING;

DIGITAL STORAGE;

EID: 84870261636     PISSN: 15566013     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIFS.2012.2217331     Document Type: Article

References (34)

1. P. F. Oliveira, L. Lima, T. T. V. Vinhoza, M. Médard, and J. Barros, "Trusted storage over untrusted networks," in Proc. IEEE Global Commun. Conf. (GLOBECOM), Miami, FL, Dec. 2010.
2. M. Armbrust et al., "A view of cloud computing," Commun. ACM, vol. 53, no. 4, pp. 50-58, 2010.
3. M. Bloch and J. Barros, Physical-Layer Security: From Inform. Theory to Security Eng. Cambridge, U.K.: Cambridge Univ. Press, 2011.
4. A. G. Dimakis, V. Prabhakaran, and K. Ramchandran, "Decentralized erasure codes for distributed networked storage," IEEE/ACM Trans. Netw., vol. 52, no. 6, pp. 2809-2816, Jun. 2006. (Pubitemid 43898929)
5. S. Pawar, S. E.Rouayheb, andK. Ramchandran, "On secure distributed data storage under repair dynamics," in Proc. IEEE Int. Symp. Inform. Theory (ISIT), Austin, TX, Jul. 2010, pp. 2543-2547.
6. T. K. Moon, Error Correction Coding: Math. Methods and Algorithms. Hoboken, NJ: Wiley, 2005.
7. L. H. OzarowandA. D.Wyner, "Wire-tap channel II," AT&T Bell Labs. Tech. J., vol. 63, no. 10, pp. 2135-2157, Dec. 1984.
8. A. Subramanian and S. W. McLaughlin, MDS Codes on the Erasure-Erasure Wiretap Channel, Arxiv, 2009 [Online]. Available: arXiv:0902.3286
9. N. Cai and R. W. Yeung, "Secure network coding," in Proc. IEEE Int. Symp. Inform. Theory (ISIT), Lausanne, Switzerland, Jul. 2002.
10. S. E. Rouayheb, E. Soljanin, and A. Sprintson, "Secure network coding for wiretap networks of type II," IEEE Trans. Inf. Theory, vol. 58, no. 3, pp. 1361-1371, Mar. 2012.
11. K. Bhattad and K. R. Narayanan, "Weakly secure network coding," in Proc. First Workshop on Network Coding, Theory, and Applicat. (NetCod), Riva del Garda, Italy, Apr. 2005.
12. D. Silva and F. R. Kschischang, "Universal weakly secure network coding," in Proc. IEEE Inform. Theory Workshop (ITW), Volos, Greece, Jun. 2009, pp. 281-285.
13. L. Lima, M. Médard, and J. Barros, "Random linear network coding: A free cipher?," in Proc. IEEE Int. Symp. Inform. Theory (ISIT), Nice, France, Jun. 2007.
14. N. Cai and R. W. Yeung, "Secure network coding on a wiretap network," IEEE Trans. Inf. Theory, vol. 57, no. 1, pp. 424-435, Jan. 2011.
15. K. Harada and H. Yamamoto, "Strongly secure linear network coding," IEICE Trans. Fund. Electron., Commun., Comput. Sci., vol. 91, no. 10, pp. 2720-2728, 2008.
16. A. Shamir, "How to share a secret," Commun. ACM, vol. 22, no. 11, pp. 612-613, Nov. 1979.
17. G. Blakley, "Safeguarding cryptographic keys," in Proc. Nat. Comput. Conf., Montvale, NJ, 1979, vol. 48, pp. 313-317, AFIPS Press.
18. H. Yamamoto, "Secret sharing system using threshold scheme," Electron. Commun. Jpn. (Part I: Commun.), vol. 69, no. 9, pp. 46-54, 1986. (Pubitemid 16638393)
19. R. Rivest, "All-or-nothing encryption and the package transform," in Fast Software Encryption. New York: Springer, 1997, pp. 210-218. (Pubitemid 127100717)
20. M. Bellare and P. Rogaway, "Optimal asymmetric encryption," in Proc. Advances in Cryptology (EUROCRYPT'94), 1995, pp. 92-111, Springer.
21. V. Boyko, "On the security properties of OAEP as an all-or-nothing transform," in Proc. Advances in Cryptology (Crypto'99), 1999, pp. 783-783, Springer.
22. D. R. Stinson, "Something about all or nothing (transforms)," Designs, Codes and Cryptography, vol. 22, no. 2, pp. 133-138, 2001. (Pubitemid 33672294)
23. M. O. Rabin, "Efficient dispersal of information for security, load balancing, and fault tolerance," J. ACM, vol. 36, no. 2, pp. 335-348, Apr. 1989.
24. H. Krawczyk, "Secret sharing made short," in Proc. Advances in Cryptology (CRYPTO'93), 1994, pp. 136-146, Springer.
25. A. Bessani, M. Correia, B. Quaresma, F. André, and P. Sousa, "DepSky: Dependable and secure storage in a cloud-of-clouds," in Proc. EuroSys'11, Salzburg, Austria, Apr. 2011.
26. A. Parakh and S. Kak, "A distributed data storage scheme for sensor networks," in Security and Privacy in Mobile Inform. and Commun. Syst. New York: Springer, 2009, pp. 14-22.
27. A. Parakh and S. Kak, "A distributed data storage scheme for sensor networks," in Proc. IEEE 3rd Int. Symp. on Advanced Networks and Telecommun. Syst. (ANTS), 2009, pp. 1-3.
28. J. Lacan and J. Fimes, "Systematic MDS erasure codes based on Vandermonde matrices," IEEE Commun. Lett., vol. 8, no. 9, pp. 570-572, Sep. 2004.
29. S. H. Dau, V. Skachek, and Y. M. Chee, "On the security of index coding with side information," IEEE Trans. Inf. Theory, vol. 58, no. 6, pp. 3975-3988, Jun. 2012.
30. T. Ho, M. Médard, R. Koetter, D. R. Karger, M. Effros, J. Shi, and B. Leong, "A random linear network coding approach to multicast," IEEE Trans. Inf. Theory, vol. 52, no. 10, pp. 4413-4430, Oct. 2004.
31. M. Luby, "LT codes," in Proc. 43rd Symp. Found. Comput. Sci., Washington, DC, Nov. 2002, pp. 271-280, IEEE Computer Society.
32. I. Gohberg and V. Olshevsky, "Fast algorithms with preprocessing for matrix-vector multiplication problems," J. Complexity, vol. 10, no. 4, pp. 411-427, Dec. 1994.
33. A. B. Carleial andM. E. Hellman, "A note onWyner's wiretap channel (Corresp.)," IEEE Trans. Inf. Theory, vol. 23, no. 3, pp. 387-390, May 1977.
34. P. F. Oliveira and J. Barros, "A network coding approach to secret key distribution," IEEE Trans. Inf. Forensics Security, vol. 3, no. 3, pp. 414-423, Sep. 2008.