@conference {17531,
	title = {Fighting Spam with the NeighborhoodWatch DHT},
	booktitle = {IEEE INFOCOM 2009},
	year = {2009},
	month = {2009/04/19/25},
	pages = {1755 - 1763},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In this paper, we present DHTBL, an anti-spam blacklist built upon a novel secure distributed hash table (DHT). We show how DHTBL can be used to replace existing DNS-based blacklists (DNSBLs) of IP addresses of mail relays that forward spam. Implementing a blacklist on a DHT improves resilience to DoS attacks and secures message delivery, when compared to DNSBLs. However, due to the sensitive nature of the blacklist, storing the data in a peer-to-peer DHT would invite attackers to infiltrate the system. Typical DHTs can withstand fail-stop failures, but malicious nodes may provide incorrect routing information, refuse to return published items, or simply ignore certain queries. The neighborhoodwatch DHT is resilient to malicious nodes and maintains the O(logiV) bounds on routing table size and expected lookup time. NeighborhoodWatch depends on two assumptions in order to make these guarantees: (1) the existence of an on-line trusted authority that periodically contacts and issues signed certificates to each node, and (2) for every sequence of k + 1 consecutive nodes in the ID space, at least one is alive and non-malicious. We show how NeighborhoodWatch maintains many of its security properties even when the second assumption is violated. Honest nodes in NeighborhoodWatch can detect malicious behavior and expel the responsible nodes from the DHT.},
	keywords = {Communications Society, computer crime, cryptography, Databases, IP addresses, IP networks, on-line trusted authority, Peer to peer computing, peer-to-peer computing, peer-to-peer distributed hash table, Postal services, Relays, Resilience, Routing, Security, table size routing, Unsolicited electronic mail},
	isbn = {978-1-4244-3512-8},
	doi = {10.1109/INFCOM.2009.5062095},
	author = {Bender,A. and Sherwood,R. and Monner,D. and Goergen,N. and Spring, Neil and Bhattacharjee, Bobby}
}
@conference {18454,
	title = {Pictorial query trees for query specification in image databases},
	booktitle = {Fourteenth International Conference on Pattern Recognition, 1998. Proceedings},
	volume = {1},
	year = {1998},
	month = {1998/08//},
	pages = {919-921 vol.1 - 919-921 vol.1},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A technique that enables specifying complex queries in image databases using pictorial query trees is presented. The leaves of a pictorial query tree correspond to individual pictorial queries that specify which objects should appear in the target images as well as how many occurrences of each object are required. In addition, the minimum required certainty of matching between query-image objects and database-image objects, as well as spatial constraints that specify bounds on the distance between objects and the relative direction between them are also specified. Internal nodes in the query tree represent logical operations (AND, OR, XOR) and their negations on the set of pictorial queries (or subtrees) represented by its children. The syntax of query trees is described. Algorithms for processing individual pictorial queries and for parsing and computing the overall result of a pictorial query tree are outlined},
	keywords = {Automation, complex queries, Computer science, content-based retrieval, Database systems, database-image objects, Educational institutions, Electrical capacitance tomography, grammars, Image databases, Image matching, parsing, pictorial query trees, Postal services, query specification, query-image objects, spatial constraints, syntax, visual databases},
	isbn = {0-8186-8512-3},
	doi = {10.1109/ICPR.1998.711383},
	author = {Soffer,A. and Samet, Hanan and Zotkin,Dmitry N}
}
