메뉴 건너뛰기




Volumn , Issue , 2006, Pages

Enabling confidentiality in Content-Based Publish/Subscribe infrastructures

Author keywords

Confidentiality; Content based publish subscribe; Privacy preserving range matches

Indexed keywords

CONFIDENTIALITY; CONTENT-BASED; CONTENT-BASED PUBLISH/SUBSCRIBE; EVALUATION RESULTS; FORMAL SECURITY; INTERACTION MODELING; PRIVACY-PRESERVING RANGE MATCHES; PROVABLY SECURE; PUBLISH/SUBSCRIBE; SUBSCRIPTION LANGUAGES; SYSTEMATIC ANALYSIS;

EID: 50049089599     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SECCOMW.2006.359552     Document Type: Conference Paper
Times cited : (47)

References (27)
  • 1
    • 0001655450 scopus 로고    scopus 로고
    • Design and evaluation of a wide-area event notification service
    • Antonio Carzaniga, David S. Rosenblum, and Alexander L. Wolf, "Design and evaluation of a wide-area event notification service", ACM Transactions on Computer Systems, vol. 19, no. 3, pp. 332-383, 2001.
    • (2001) ACM Transactions on Computer Systems , vol.19 , Issue.3 , pp. 332-383
    • Carzaniga, A.1    Rosenblum, D.S.2    Wolf, A.L.3
  • 3
    • 50049092935 scopus 로고    scopus 로고
    • Akamai, "http://www.akamai.com".
  • 7
    • 0345565893 scopus 로고    scopus 로고
    • A survey of key management for secure group communication
    • Sandro Rafaeli and David Hutchison, "A survey of key management for secure group communication", ACM Comput. Surv., vol. 35, no. 3, pp. 309-329, 2003.
    • (2003) ACM Comput. Surv , vol.35 , Issue.3 , pp. 309-329
    • Rafaeli, S.1    Hutchison, D.2
  • 8
    • 1242332561 scopus 로고    scopus 로고
    • Forwarding in a content-based network
    • Karlsruhe, Germany, Aug
    • Antonio Carzaniga and Alexander L. Wolf, "Forwarding in a content-based network", in Proceedings of ACM SIGCOMM, Karlsruhe, Germany, Aug. 2003, pp. 163-174.
    • (2003) Proceedings of ACM SIGCOMM , pp. 163-174
    • Carzaniga, A.1    Wolf, A.L.2
  • 9
    • 0023861309 scopus 로고
    • The dining cryptographers problem: Unconditional sender and recipient untraceability
    • D. Chaum, "The dining cryptographers problem: unconditional sender and recipient untraceability", Journal of Cryptology, vol. 1, no. 1, 1988.
    • (1988) Journal of Cryptology , vol.1 , Issue.1
    • Chaum, D.1
  • 13
    • 33244488406 scopus 로고    scopus 로고
    • Secure indexes
    • Cryptology ePrint Archive, Report 2003/216
    • Eu-Jin Goh, "Secure indexes", Cryptology ePrint Archive, Report 2003/216, 2003.
    • (2003)
    • Goh, E.-J.1
  • 14
    • 0014814325 scopus 로고
    • Space/time trade-offs in hash coding with allowable errors
    • Burton H. Bloom, "Space/time trade-offs in hash coding with allowable errors", Communications of the ACM, vol. 13, no. 7, 1970.
    • (1970) Communications of the ACM , vol.13 , Issue.7
    • Bloom, B.H.1
  • 15
    • 44049096900 scopus 로고    scopus 로고
    • Privacy preserving keyword searches on remote encrypted data
    • Yan-Cheng Chang and Michael Mitzenmacher, "Privacy preserving keyword searches on remote encrypted data.", in ACNS, 2005.
    • (2005) ACNS
    • Chang, Y.-C.1    Mitzenmacher, M.2
  • 20
    • 0003629990 scopus 로고    scopus 로고
    • National Institute of Standards and Technology
    • National Institute of Standards and Technology, "Secure hash standard", 2002.
    • (2002) Secure hash standard
  • 25
    • 50049113532 scopus 로고    scopus 로고
    • An efficient scheme for preserving confidentiality in content-based publish/subscribe systems
    • Tech. Rep. GIT-CC-04-01, Georgia Institute of Technology
    • Jun Li, Chengluai Lu, and Weidong Shi, "An efficient scheme for preserving confidentiality in content-based publish/subscribe systems", Tech. Rep. GIT-CC-04-01, Georgia Institute of Technology, 2004.
    • (2004)
    • Li, J.1    Lu, C.2    Shi, W.3
  • 26
    • 50049090041 scopus 로고    scopus 로고
    • "Siena documentation", http://www.cs.colorado.edu/ serl/cbn/forwarding/.
    • Siena documentation


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.