The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Privacy-Preserving Set Operations
Open accessAbstract
In many important applications, a collection of mutually distrustful parties must perform private computation over multisets. Each party's input to the function is his private input multiset. In order to protect these private sets, the players perform privacy-preserving computation; that is, no party learns more information about other parties' private input sets than what can be deduced from the result. In this paper, we propose efficient techniques for privacy-preserving operations on multisets. By building a framework of multiset operations, employing the mathematical properties of polynomials, we design efficient, secure, and composable methods to enable privacy-preserving computation of the union, intersection, and element reduction operations. We apply these techniques to a wide range of practical problems, achieving more efficient results than those of previous work.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250
Untraceable electronic mail, return addresses, and digital pseudonyms
Chaum, D. L. (1981) · Communications of the ACM · doi:10.1145/358549.358563 · Cited by 4,289
Protocols for secure computations
Yao, A. C. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.38 · Cited by 3,306
Handbook of Applied Cryptography
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (2018) · CRC Press eBooks · doi:10.1201/9781439821916 · Cited by 2,896
Protocols for secure computations
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.88 · Cited by 2,661
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Ben-Or, M., & Wigderson, A. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62213 · Cited by 2,524
Goldreich, O. (2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546891 · Cited by 2,181
Lecture Notes in Computer Science 1867
Baldwin, J., Martin, T., & Tzanavari, A. (2000) · Cited by 1,643
Foundations of Cryptography: Volume 2, Basic Applications
Goldreich, O. (2004) · Cited by 1,592
Kiayias, A., Tsiounis, Y., & Yung, M. M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24676-3_34 · Cited by 1,267
Efficient Private Matching and Set Intersection
Freedman, M. J., Nissim, K., & Pinkas, B. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_1 · Cited by 1,266
Self Protecting Pirates and Black-Box Traitor Tracing
Kiayias, A., & Yung, M. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44647-8_4 · Cited by 1,121
Fischlin, M., & Coron, J.-S. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49896-5 · Cited by 882
Advances in Cryptology – ASIACRYPT 2021
(2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92062-3 · Cited by 780
Information sharing across private databases
Agrawal, R., Evfimievski, A., & Srikant, R. (2003) · Proceedings of the 2003 ACM SIGMOD international conference on Management of data · doi:10.1145/872757.872771 · Cited by 634
Advances in Cryptology — EUROCRYPT'98
(1998) · Lecture notes in computer science · doi:10.1007/bfb0054112 · Cited by 632
Oblivious transfer and polynomial evaluation
Naor, M., & Pinkas, B. (1999) · Proceedings of the thirty-first annual ACM symposium on Theory of Computing · doi:10.1145/301250.301312 · Cited by 629
(2022) · Lecture notes in computer science · doi:10.1007/978-3-031-07085-3 · Cited by 613
Multiparty Computation from Threshold Homomorphic Encryption
Cramer, R., Damgård, I., & Nielsen, J. B. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_18 · Cited by 578
A Computational Introduction to Number Theory and Algebra
Shoup, V. (2008) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814549 · Cited by 549
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
Cramer, R., Damgård, I., & Maurer, U. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_22 · Cited by 533
Advances in Cryptology — CRYPTO’ 86: Proceedings
(1987) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7 · Cited by 519
A verifiable secret shuffle and its application to e-voting
Neff, C. A. (2001) · Proceedings of the 8th ACM conference on Computer and Communications Security · doi:10.1145/501983.502000 · Cited by 513
Advances in Cryptology – ASIACRYPT 2020
Bullens, W., Katsumata, S., & Pintore, F. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64834-3 · Cited by 318
Sharing Decryption in the Context of Voting or Lotteries
Fouque, P.-A., Poupard, G., & Stern, J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45472-1_7 · Cited by 312
Proof systems for general statements about discrete logarithms
Camenisch, J. L., & Stadler, M. A. (1997) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-006651937 · Cited by 220
Comparing information without leaking it
Fagin, R., Naor, M., & Winkler, P. (1996) · Communications of the ACM · doi:10.1145/229459.229469 · Cited by 200
An Efficient Scheme for Proving a Shuffle
Furukawa, J., & Sako, K. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_22 · Cited by 199
Securing Threshold Cryptosystems against Chosen Ciphertext Attack
Shoup, V., & Gennaro, R. (2002) · Journal of Cryptology · doi:10.1007/s00145-001-0020-9 · Cited by 198
Jakobsson, M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054145 · Cited by 181
A fair and efficient solution to the socialist millionaires’ problem
Boudot, F., Schoenmakers, B., & Traoré, J. (2001) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(00)00342-5 · Cited by 171
Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks
Fouque, P.-A., & Pointcheval, D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45682-1_21 · Cited by 135
How to Break a Practical MIX and Design a New One
Desmedt, Y., & Kurosawa, K. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45539-6_39 · Cited by 131
Demonstrating Possession of a Discrete Logarithm Without Revealing it
Chaum, D., Evertse, J., van de Graaf, J., & Peralta, R. (1987) · Lecture notes in computer science · doi:10.1007/3-540-47721-7_14 · Cited by 110
On Simulation-Sound Trapdoor Commitments
MACKENZIE, P. D., & Yang, K. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24676-3_23 · Cited by 106
Verifiable Homomorphic Oblivious Transfer and Private Equality Test
Lipmaa, H. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-40061-5_27 · Cited by 105
Private and Threshold Set-Intersection
Kissner, L., & Song, D. X. (2004) · Defense Technical Information Center (DTIC) · doi:10.21236/ada461119 · Cited by 71
Self-citation
Cited by
Secure Multiparty Computation for Privacy-Preserving Data Mining
Lindell, Y., & Pinkas, B. (2009) · Journal of Privacy and Confidentiality · doi:10.29012/jpc.v1i1.566 · Cited by 554
Practical Private Set Intersection Protocols with Linear Complexity
De Cristofaro, E., & Tsudik, G. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14577-3_13 · Cited by 416
When private set intersection meets big data: an efficient and scalable protocol
Dong, C., Chen, L., & Wen, Z. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516701 · Cited by 387
Contact Tracing Mobile Apps for COVID-19: Privacy Considerations and Related Trade-offs
Cho, H., Ippolito, D., & Yu, Y. W. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.11511 · Cited by 350
Scalable Private Set Intersection Based on OT Extension
Pinkas, B., Schneider, T., & Zohner, M. (2018) · ACM Transactions on Privacy and Security · doi:10.1145/3154794 · Cited by 313
Metadata
- Authors
- Kissner, L., & Song, D.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 241-257
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2143824669
- Cited by
- 648
- References
- 39
- FWCI
- 15.50
- Type
- conference paper
- Language
- en
- Open access
- green
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.