A communication-efficient private matching scheme in client-server model (Q726566): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ins.2014.01.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016036823 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Private Intersection of Certified Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secret Handshakes from CA-Oblivious Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Security and Privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3518415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privacy-preserving disjunctive normal form operations on distributed sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA-inspired information concealing: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Financial Cryptography and Data Security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privacy-Preserving Set Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Single-Database Private Information Retrieval: Techniques and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two methods for privacy preserving data mining with malicious participants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric cryptographic solution to Yao's millionaires' problem and an evaluation of secure multiparty computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding and Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Disjointness Tests for Private Datasets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconditionally secure disjointness tests for private datasets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privacy-preserving algorithms for distributed mining of frequent itemsets / rank
 
Normal rank

Latest revision as of 06:51, 12 July 2024

scientific article
Language Label Description Also known as
English
A communication-efficient private matching scheme in client-server model
scientific article

    Statements

    A communication-efficient private matching scheme in client-server model (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 July 2016
    0 references
    private matching
    0 references
    oblivious transfer
    0 references
    universal hash function
    0 references
    private information retrieval
    0 references
    communication complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers