Unconditionally secure disjointness tests for private datasets

DOI10.1504/IJACT.2009.023471MaRDI QIDQ1017546zbMATH OpenOpenAlexWikidataFDO

Authors Qingsong Ye, Huaxiong Wang, Josef Pieprzyk, Xian-Mo Zhang

Publication date 12 May 2009

Published in International Journal of Applied Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijact.2009.023471

zbMATH Keywords

cryptographysecret sharingsecure multiparty computationprivate matchinghonest-but-curiousinformation theoretic securitymalicious adversariesprivate set disjointnessunconditional secure protocols

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient Disjointness Tests for Private Datasets
• Financial Cryptography and Data Security
• Optimal private halfspace counting via discrepancy
• Privacy-preserving disjunctive normal form operations on distributed sets
• Privacy-preserving data splitting: a combinatorial approach
• Distributed Private Data Analysis
• Unconditional differentially private mechanisms for linear queries
• Verifiable homomorphic oblivious transfer and private equality test

Cited in

(6)

• Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security
• A communication-efficient private matching scheme in client-server model
• Applied Cryptography and Network Security
• Universally composable private proximity testing
• Financial Cryptography and Data Security
• Efficient Disjointness Tests for Private Datasets

This page was built for publication: Unconditionally secure disjointness tests for private datasets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1017546)