A communication-efficient private matching scheme in client-server model

DOI10.1016/J.INS.2014.01.016MaRDI QIDQ726566zbMATH OpenOpenAlexFDO

Authors Mu-En Wu, Shih-Ying Chang, Chi-Jen Lu, Hung-Min Sun

Publication date 11 July 2016

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2014.01.016

zbMATH Keywords

communication complexityoblivious transferprivate information retrievalprivate matchinguniversal hash function

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Advances in Cryptology - EUROCRYPT 2004
• Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer
• Secure multiparty computation of approximations
• Faster unbalanced private set intersection
• Attribute-based fine-grained access control for outscored private set intersection computation

Cites work

• A Survey of Single-Database Private Information Retrieval: Techniques and Applications
• Advances in Cryptology - EUROCRYPT 2004
• Coding and Cryptography
• DNA-inspired information concealing: a survey
• Efficient k-out-of-n oblivious transfer schemes
• Efficient Disjointness Tests for Private Datasets
• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
• Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
• Financial Cryptography and Data Security
• scientific article; zbMATH DE number 1618044 (Why is no real title available?)
• scientific article; zbMATH DE number 1302806 (Why is no real title available?)
• Information Security
• Information Security and Privacy
• Privacy-preserving algorithms for distributed mining of frequent itemsets
• Privacy-preserving disjunctive normal form operations on distributed sets
• Privacy-Preserving Set Operations
• Private intersection of certified sets
• Probability and Computing
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Secret Handshakes from CA-Oblivious Encryption
• Symmetric cryptographic solution to Yao's millionaires' problem and an evaluation of secure multiparty computations
• Theory of Cryptography
• Two methods for privacy preserving data mining with malicious participants
• Unconditionally secure disjointness tests for private datasets

Cited in

(7)

• Quantum solution to a class of two-party private summation problems
• Cryptanalysis and improvement of a quantum private set intersection protocol
• Quantum secure multi-party private set intersection cardinality
• A novel quantum protocol for private set intersection
• Quantum private set intersection cardinality and its application to anonymous authentication
• An efficient quantum scheme for private set intersection
• A novel quantum private set intersection scheme with a semi-honest third party

This page was built for publication: A communication-efficient private matching scheme in client-server model

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