Download:
by Jun Li, Chenghuai Lu, Weidong Shi
ftp://ftp.cc.gatech.edu/pub/coc/tech_reports/2004/GIT-CC-04-01.pdf
Add To MetaCart
Abstract:
Content-based publish-subscribe is an efficient communication paradigm that supports dynamic, many-to-many data dissemination in a distributed environment. A publish-subscribe system deployed over a wide-area network must handle information dissemination across distinct authoritative domains and heterogeneous platforms. Such an environment raises serious security concerns. This paper describes a practical scheme that preserves confidentiality against eavesdroppers for private content-based publish-subscribe systems over public networks. In this scheme, publications and subscriptions are encrypted, while the publish-subscribe infrastructure is able to make correct routing decisions based on encrypted publications and subscriptions. Plaintexts are not revealed in the infrastructure for the purpose of security and efficiency. This scheme efficiently supports interval-matching as a predicate function for subscriptions. The security of this scheme is analyzed, and further improved by several techniques. Keywords: Content-based publish-subscribe system, confidentiality, intervalmatching, prefix-matching, prefix-preserving encryption/decryption. 1
Citations
|
692
|
The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract
– Goldwasser, Micali, et al.
- 1985
|
|
403
|
Design and evaluation of a wide-area event notification service
– Carzaniga, Rosenblum, et al.
|
|
268
|
Secure group communications using key graphs
– Wong, Gouda, et al.
- 1998
|
|
265
|
Protocols for secure computations
– Yao
- 1982
|
|
225
|
Private information retrieval
– Chor, Goldreich, et al.
- 1998
|
|
220
|
An Efficient Multicast Protocol for Content-Based Publish-Subscribe Systems
– Banavar, Chandra, et al.
- 1999
|
|
198
|
Elvin has left the building: A publish/subscribe notification service with quenching
– Segall, Arnold
- 1997
|
|
178
|
Matching Events in a Contentbased Subscription System
– Aguilera, Strom, et al.
- 1999
|
|
109
|
Multicast security: A taxonomy and some efficient constructions
– Canetti, Garay, et al.
- 1999
|
|
108
|
On hiding information from an oracle
– Abadi, Feigenbaum, et al.
- 1989
|
|
94
|
Efficient proofs that a committed number lies in an interval
– Boudot
- 2000
|
|
85
|
Secure multi-party computation (working draft). www.wisdom.weizmann.ac.il/oded/pp.html
– Goldreich
- 2000
|
|
85
|
Fast and scalable layer four switching
– Srinivasan, Varghese, et al.
- 1998
|
|
75
|
Practical Techniques for Searches on Encrypted Data
– Song, Wagner, et al.
- 2000
|
|
71
|
Studies in Secure Multiparty Computation and Applications
– Canetti
- 1995
|
|
66
|
AES proposal: Rijndael
– Daemen, Rijmen
- 1999
|
|
60
|
Forwarding in a Content-Based Network
– Carzaniga, Wolf
- 2003
|
|
35
|
Security issues and requirements for internet-scale publish-subscribe systems
– Wang, Carzaniga, et al.
- 2002
|
|
32
|
Prefix-Preserving IP Address Anonymization: Measurement-based Security Evaluation and a New Cryptography-based Scheme
– Xu, Fan, et al.
- 2002
|
|
27
|
Single-database private information retrieval implies oblivious transfer
– Crescenzo, Malkin, et al.
- 2000
|
|
23
|
a new protocol for efficient large-group key distribution
– Elk
- 2001
|
|
21
|
Encrypting Problem Instances, or, ..., Can You Take Advan- tage of Someone Without Having to Trust Him
– Feigenbaum
- 1986
|
|
21
|
Secure distribution of events in content-based publish subscribe systems
– Opyrchal, Prakash
- 2001
|
|
20
|
A Private Interactive Test of a Boolean Predicate and MinimumKnowledge Public Key Cryptosystems
– Galil, Haber, et al.
- 1985
|
|
14
|
New Algorithms for ContentBased Publication-Subscription Systems
– Liu, Wolf, et al.
- 2003
|
|
6
|
Guaranteed Correct Sharing of Integer Factorization with Off-line Shareholders
– Mao
- 1998
|
|
4
|
Gradual and verifiable release of a secret
– Brickell, Chaum, et al.
- 1987
|
