The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Information sharing across private databases
Abstract
Literature on information integration across databases tacitly assumes that the data in each database can be revealed to the other databases. However, there is an increasing need for sharing information across autonomous entities in such a way that no information apart from the answer to the query is revealed. We formalize the notion of minimal information sharing across private databases, and develop protocols for intersection, equijoin, intersection size, and equijoin size. We also show how new applications can be built using the proposed protocols.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Introduction to Modern Information Retrieval
Salton, G., & McGill, M. J. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 11,392
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 2×
“Perfect Secrecy [43]: For any ext(v),the value of KK(ext(v))is indistinguishable from a .xed (independent of ext(v)) distribution Dextover Cextwhen I2rDomF.”
BackgroundA public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059 · cited 1×
“Our definition of commutative encryption below is similar to the constructions used in [9, 18, 20, 42] and others.”
MethodIntroduction to modern information retrieval
Dillon, M. (1983) · Information Processing & Management · doi:10.1016/0306-4573(83)90062-6 · Cited by 5,909
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Fiat, A., & Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_12 · Cited by 3,943
How to generate and exchange secrets
Yao, A. C.-C. (1986) · 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) · doi:10.1109/sfcs.1986.25 · Cited by 3,733
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335438 · Cited by 2,961
Self-citation
Cited by
L -diversity: Privacy beyond k -anonymity
Machanavajjhala, A., Kifer, D., Gehrke, J., & Venkitasubramaniam, M. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217302 · Cited by 3,617
L-diversity: privacy beyond k-anonymity
Machanavajjhala, A., Gehrke, J., Kifer, D., & Venkitasubramaniam, M. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.1 · Cited by 2,362
The new Casper: query processing for location services without compromising privacy
Mokbel, M. F., Chow, C.-Y., & Aref, W. G. (2006) · doi:10.5555/1182635.1164193 · Cited by 999
Privacy-Preserving Set Operations
Kissner, L., & Song, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_15 · Cited by 648
Information security and privacy in healthcare: current state of research
Appari, A., & Johnson, M. E. (2010) · International Journal of Internet and Enterprise Management · doi:10.1504/ijiem.2010.035624 · Cited by 406
Privacy-preserving record linkage using Bloom filters
Schnell, R., Bachteler, T., & Reiher, J. (2009) · BMC Medical Informatics and Decision Making · doi:10.1186/1472-6947-9-41 · Cited by 342
Efficient k-Anonymization Using Clustering Techniques
Byun, J.-W., Kamra, A., Bertino, E., & Li, N. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71703-4_18 · Cited by 329
Privacy preservation in wireless sensor networks: A state-of-the-art survey
Li, N., Zhang, N., Das, S. K., & Thuraisingham, B. (2009) · Ad Hoc Networks · doi:10.1016/j.adhoc.2009.04.009 · Cited by 308
A taxonomy of privacy-preserving record linkage techniques
Vatsalan, D., Christen, P., & Verykios, V. S. (2013) · Information Systems · doi:10.1016/j.is.2012.11.005 · Cited by 295
Privacy-Preserving Decision Trees over Vertically Partitioned Data
Vaidya, J., & Clifton, C. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535706_11 · Cited by 144
A Review of Anonymization for Healthcare Data
Olatunji, I. E., Rauch, J., Katzensteiner, M., & Khosla, M. (2024) · Big Data · doi:10.1089/big.2021.0169 · Cited by 101
A Survey of Privacy-Preserving Methods Across Vertically Partitioned Data
Vaidya, J. (2008) · Advances in Database Systems · doi:10.1007/978-0-387-70992-5_14 · Cited by 46
“This idea is also used by [2] to compute Set Union, Set Intersection, Size of Set Union, and Size of Set Intersection.”
BackgroundMethod
Metadata
- Authors
- Agrawal, R., Evfimievski, A., & Srikant, R.
- Venue
- Proceedings of the 2003 ACM SIGMOD international conference on Management of data
- Publisher
- ACM
- Published
- 2003-06-09
- Pages
- 86-97
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2139979322
- Cited by
- 634
- References
- 46
- FWCI
- 23.81
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.