Efficient and private three-party publish/subscribe

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7873 LNCS, Issue , 2013, Pages 278-292

  Di Crescenzo, Giovanni ^a   Burns, Jim ^a   Coan, Brian ^a   Schultz, John ^c   Stanton, Jonathan ^c   Tsang, Simon ^a   Wright, Rebecca N ^b  

^a Applied Communication Sciences   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c Spread Concepts   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT FACTORS; DATA ARRIVAL RATE; GENERAL SOLUTIONS; PARAMETER RANGE; PUBLISH/SUBSCRIBE; SECURE FUNCTION EVALUATION; SYMMETRIC CRYPTOGRAPHY; THIRD PARTIES;

PUBLISHING;

NETWORK SECURITY;

EID: 84883370369     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38631-2_21     Document Type: Conference Paper

References (19)

1. Eugster, P.T., Felber, P., Guerraoui, R., Kermarrec, A.M.: The many faces of publish/subscribe. ACM Comput. Surv. 35(2), 114-131 (2003)
2. Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162-167 (1986)
3. Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: STOC, pp. 44-61 (1989)
4. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218-229 (1987)
5. Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: STOC, pp. 73-85 (1989)
6. Feige, U., Kilian, J., Naor,M.: A minimal model for secure computation (extended abstract). In: STOC, pp. 554-563 (1994)
7. Goldreich, O., Goldwasser, S.,Micali, S.: How to construct random functions. J. ACM33(4), 792-807 (1986)
8. Raiciu, C., Rosenblum, D.S.: Enabling confidentiality in content-based publish/subscribe infrastructures. In: SecureComm, pp. 1-11 (2006)
9. Minami, K., Lee, A.J., Winslett, M., Borisov, N.: Secure aggregation in a publish-subscribe system. In: WPES, pp. 95-104 (2008)
10. Shikfa, A., Önen, M., Molva, R.: Privacy-preserving content-based publish/subscribe networks. In: Gritzalis, D., Lopez, J. (eds.) SEC 2009. IFIP AICT, vol. 297, pp. 270-282. Springer, Heidelberg (2009)
11. Tariq, M.A., Koldehofe, B., Altaweel, A., Rothermel, K.: Providing basic security mechanisms in broker-less publish/subscribe systems. In: DEBS, pp. 38-49 (2010)
12. Choi, S., Ghinita, G., Bertino, E.: A privacy-enhancing content-based publish/subscribe system using scalar product preserving transformations. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds.) DEXA 2010, Part I. LNCS, vol. 6261, pp. 368-384. Springer, Heidelberg (2010)
13. Ion, M., Russello, G., Crispo, B.: Supporting publication and subscription confidentiality in pub/sub networks. In: Jajodia, S., Zhou, J. (eds.) SecureComm 2010. LNICST, vol. 50, pp. 272-289. Springer, Heidelberg (2010)
14. Pal, P., Lauer, G., Khoury, J., Hoff, N., Loyall, J.: P3S: A privacy preserving publish-subscribe middleware. In: Narasimhan, P., Triantafillou, P. (eds.) Middleware 2012. LNCS, vol. 7662, pp. 476-495. Springer, Heidelberg (2012)
15. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS, pp. 136-145 (2001)
16. Di Crescenzo, G., Ostrovsky, R., Rajagopalan, S.: Conditional oblivious transfer and timed-release encryption. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 74-89. Springer, Heidelberg (1999)
17. Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270-299 (1984)
18. Brickell, E., Di Crescenzo, G., Frankel, Y.: Sharing block ciphers. In: Clark, A., Boyd, C., Dawson, E.P. (eds.) ACISP 2000. LNCS, vol. 1841, pp. 457-470. Springer, Heidelberg (2000)
19. Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory 22(6), 644-654 (1976)