Oblivious key-value stores and amplification for private set intersection (Q2128570): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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-030-84245-1_14 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3183199186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient pseudorandom correlation generators: silent OT extension and more / rank
 
Normal rank
Property / cites work
 
Property / cites work: Private set intersection in the internet setting from lightweight oblivious PRF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Concurrent Covert Computation of String Equality and Set Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic approach to maliciously secure private set intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: The communication complexity of threshold private set intersection / 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: Scalable Multi-party Private Set-Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient scalable multiparty private set-intersection via garbled Bloom filters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More general completeness theorems for secure two-party computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: More Robust Hashing: Cuckoo Hashing with a Stash / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privacy-Preserving Set Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable private set union from symmetric-key techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privacy-Preserving Group Discovery with Linear Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious transfer and polynomial evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: SpOT-light: lightweight private set intersection from sparse OT extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSI from PaXoS: fast, malicious private set intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient circuit-based PSI with linear communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Private Set Intersection Against Malicious Adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE / rank
 
Normal rank

Latest revision as of 18:36, 28 July 2024

scientific article
Language Label Description Also known as
English
Oblivious key-value stores and amplification for private set intersection
scientific article

    Statements

    Oblivious key-value stores and amplification for private set intersection (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 April 2022
    0 references
    failure probability
    0 references
    two-party PSI protocols
    0 references
    0 references
    0 references

    Identifiers