Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters (Q3194620): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Marc Fischlin / rank
Normal rank
 
Property / author
 
Property / author: Marc Fischlin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-19962-7_24 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W955100975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Scalable and Efficient Privacy Preserving Global Itemset Support Approximation Using Bloom Filters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space/time trade-offs in hash coding with allowable errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Set Intersection with Untrusted Hardware Tokens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privacy-Preserving Set Union / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs / 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: Efficient set operations in the presence of malicious adversaries / 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: Fast Secure Computation of Set Intersection / 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

Latest revision as of 22:11, 10 July 2024

scientific article
Language Label Description Also known as
English
Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters
scientific article

    Statements

    Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 October 2015
    0 references

    Identifiers