(Enter summary)
Abstract: It is often necessary for two or more or more parties that
do not fully trust each other to selectively share data.
We propose a search scheme based on Bloom filters and
Pohlig-Hellman encryption. A semi-trusted third party
can transform one party's search queries to a form suitable
for querying the other party's database, in such a
way that neither the third party nor the database owner
can see the original query. Furthermore, the encryption
keys used to construct the Bloom filters are not... (Update)
Cited by: More
Searchable Symmetric Encryption: Improved.. - Curtmola, Garay.. (2006)
(Correct)
Exclusion-Intersection Encryption and Its Application to.. - Chow (2005)
(Correct)
Secure Indexes - Goh (2004)
(Correct)
Active bibliography (related documents): More All
1.1: Privacy-Enhanced Searches Using Encrypted Bloom Filters - Steven Bellovin Smb (2004)
(Correct)
0.2: Heisenberg en de Duitse atoombom - Landsman
(Correct)
0.2: Authentication and Integrity in Outsourced Databases - Mykletun, Narasimha, Tsudik (2004)
(Correct)
Similar documents based on text: More All
0.3: EIDs, IPsec, and HostNAT - Bellovin (1998)
(Correct)
0.2: Augmented Encrypted Key Exchange: a Password-Based Protocol.. - Bellovin, Merritt (1993)
(Correct)
0.2: DDoS Attacks and Pushback - Bellovin (2001)
(Correct)
Related documents from co-citation: More All
3: Public-key encryption with keyword search
- Boneh, Crescenzo et al. - 2004
3: in hash coding with allowable errors (context) - Bloom, time - 1970
3: Software Protection and Simulation on Oblivious RAMs
- Goldreich, Ostrovsky - 1996
BibTeX entry: (Update)
S. M. Bellovin and W. R. Cheswick. Privacy-enhanced searches using encrypted Bloom filters. Draft, 2004. http://www.research.att.com/~smb/papers/bloom-encrypt.ps. http://citeseer.ist.psu.edu/bellovin04privacyenhanced.html More
@misc{ bellovin04privacyenhanced,
author = "S. Bellovin and W. Cheswick",
title = "Privacy-enhanced searches using encrypted Bloom filters",
text = "S. M. Bellovin and W. R. Cheswick. Privacy-enhanced searches using encrypted
Bloom filters. Draft, 2004. http://www.research.att.com/~smb/papers/bloom-encrypt.ps.",
year = "2004",
url = "citeseer.ist.psu.edu/bellovin04privacyenhanced.html" }
Citations (may not include all citations):
181
Space/time trade-offs in hash coding with allowable errors
- Bloom - 1970
168
An improved algorithm for computing logarithms over GF (p) a.. (context) - Pohlig, Hellman - 1978
110
The eternity service
- Anderson - 1996
98
An Introduction to the Theory of Numbers (context) - Niven, Zuckerman et al. - 1991
89
Untraceable electronic mail, return addresses, and digital p.. (context) - Chaum - 1981
56
HTTP state management mechanism
- Kristol, Montulli - 2000
50
Practical techniques for searches on encrypted data
- Song, Wagner et al. - 2000
23
Universal re-encryption for mixnets
- Golle, Jakobsson et al. - 2002
20
Divertible protocols and atomic proxy cryptography (context) - Blaze, Bleumer et al. - 1998
9
Augmented encrypted key exchange (context) - Bellovin, Merritt - 1993
8
privacy protocol using the RSA crypto algorithm (context) - Simmons, weak - 1983
5
Secure indexes for efficient searching on encrypted compress.. (context) - Goh - 2003
4
The Making of the Atomic Bomb (context) - Rhodes - 1987
3
Cryptology ePrint Archive (context) - key - 2003
Documents on the same site (http://www.tcs.hut.fi/~helger/crypto/link/data_mining/): More
Efficient Private Matching and Set Intersection - Freedman, Nissim, Pinkas (2004)
(Correct)
Privacy-Preserving Collaborative Filtering Using Randomized.. - Polat, Du (2003)
(Correct)
Achieving K-Anonymity Privacy Protection Using Generalization and .. - Sweeney (2002)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC