Providing data confidentiality against malicious hosts in Shared Data Spaces

Science of Computer Programming

Volumn 75, Issue 6, 2010, Pages 426-439

  Russello, Giovanni ^a   Dong, Changyu ^a   Dulay, Naranker ^a   Chaudron, Michel ^b   van Steen, Maarten ^c  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b LEIDEN UNIVERSITY   (Netherlands)

^c VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

Advance proxy encryption scheme; Encrypted searches; Encrypted Shared Data Space; No shared key

Indexed keywords

ACCESS CONTROL MECHANISM; APPLICATION COMPONENTS; DATA CONFIDENTIALITY; DATA SPACE; ENCRYPTED DATA; ENCRYPTION SCHEMES; KEY MANAGEMENT; MALICIOUS HOST; PRELIMINARY PERFORMANCE RESULTS; PROXY ENCRYPTIONS; RESOURCE CONSUMPTION; SECRET KEY; SHARED DATA SPACES; SUPPORT SEARCHING;

ACCESS CONTROL; KEYS (FOR LOCKS);

CRYPTOGRAPHY;

EID: 77949657618     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2009.07.011     Document Type: Article

References (26)

1. M. Bellare, P. Rogaway, Optimal asymmetric encryption, in: EUROCRYPT, 1994, pp. 92-111
2. Bettini L., and De Nicola R. A java middleware for guaranteeing privacy of distributed tuple spaces. Proc. of FIDJI'02, Int. Workshop on Scientific Engineering of Distributed Java Applications. In: Guelfi N., Astesiano E., and Reggio G. (Eds). LNCS vol. 2604 (2003), Springer 175-184
3. M. Blaze, G. Bleumer, M. Strauss, Divertible protocols and atomic proxy cryptography, in: In EUROCRYPT, 1998, pp. 127-144
4. P. Costa, L. Mottola, A.L. Murphy, G.P. Picco, Programming wireless sensor networks with the TeenyLIME middleware, in: Proceedings of the 8th ACM/IFIP/USENIX International Middleware Conference, Middleware 2007, Newport Beach, CA, USA, November 26-30, 2007
5. R. Curtmola, J.A. Garay, S. Kamara, R. Ostrovsky, Searchable symmetric encryption: Improved definitions and efficient constructions, in: Proceeding of the 13th ACM Conference on Computer and Communications Security, Alexxandria, VA, USA, October 2006, pp. 79-88
6. Elgamal T. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory 31 4 (1985) 469-472
7. Freeman E., Hupfer S., and Arnold K. JavaSpaces, Principles, Patterns and Practice (1999), Addison-Wesley, Reading, MA
8. Focardi R., Lucchi R., and Zavattaro G. Secure shared data-space coordination languages: A process algebraic survey. Science of Computer Programming 63 1 (2006) 3-15
9. C. Fok, G. Roman, C. Lu, Rapid development and flexible deployment of adaptive wireless sensor network applications, in: Proceedings of the 24th International Conference on Distributed Computing Systems, ICDCS'05, Columbus, Ohio, June 6-10, 2005, pp. 653-662
10. Fujisaki E., Okamoto T., Pointcheval D., and Stern J. Rsa-oaep is secure under the rsa assumption. In: Kilian J. (Ed). CRYPTO. Lecture Notes in Computer Science vol. 2139 (2001), Springer 260-274
11. Gelernter D. Generative communication in Linda. ACM Transactions on Programming Languages and Systems 7 1 (1985) 80-112
12. Gelernter D., and Carriero N. Coordination languages and their significance. Communications of ACM 35 2 (1992) 96-107
13. Goldreich O. Foundations of Cryptography: Volume II Basic Applications (2004), Cambridge University Press
14. Gorrieri R., Lucchi R., and Zavattaro G. Supporting secure coordination in secspaces. Fundamenta Informaticae (2005), IOS Press
15. Handorean R., and Roman G.C. Secure sharing of tuple space in ad hoc settings. In: Focardi R., and Zavattaro G. (Eds). Electronic Notes in Theoretical Computer Science (2003), Elsevier
16. Ivan A.A., and Dodis Y. Proxy cryptography revisited. NDSS (2003), The Internet Society
17. H. Pang, A. Jain, K. Ramamritham, K. Tan, Verifying completeness of relational query results in data publishing, in: Proceeding of the 2005 ACM SIGMOD International Conference on Management of Data, Baltimore, MD, 2005, pp. 407-418
18. Picco G.P., Murphy A.L., and Roman G.-C. Lime: Linda meets mobility. In: Garlan D., and Kramer J. (Eds). Proc. 21st Int'l Conf. on Software Engineering. ICSE'99 (1999), ACM Press, Los Angeles, USA 368-377
19. Rivest R.L., Shamir A., and Adleman L.M. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21 2 (1978) 120-126
20. Rowstron A., and Wray S. Run-time system for WCL. In: Bal H., Belkhouche B., and Cardelli L. (Eds). Internet Programming Languages. LNCS vol. 1968 (1999), Springer-Verlag 78-96
21. G. Russello, Separation and adaptation of concerns in a shared data space, Ph.D. Thesis, Department of Computer Science, Eindhoven University of Technology, June 2006
22. Song D.X., Wagner D., and Tian X. Timing analysis of keystrokes and timing attacks on SSH. Proc. of 10th USENIX Security Symposium (2001)
23. Udizir N., Wood A., and Jacob J. Coordination with Multicapabilities. Proc. 7th Int'l Conf. on Coordination Models and Languages, Coordination 2005. In: Jacquet J.-M., and Picco G.P. (Eds). LNCS vol. 3454 (2005), Springer-Verlag, Berlin 79-93
24. Vitek J., Bryce C., and Oriol M. Coordinating processes with secure spaces. Proc. of Conf. on Coordination Models and Languages. Science of Computer Programming vol. 46 (2003) 163-193
25. Wood A. Coordination with attributes. Proc. of Coordination Languages and Models. LNCS vol. 1594 (1999), Springer-Verlag, Berlin, Heidelberg 21-36
26. Yumerefendi A.R., and Chase J.S. Strong accountability for network storage. ACM Transactions on Storage 3 3 (2007)