Efficient set intersection with simulation-based security (Q271588)

From MaRDI portal
Revision as of 18:48, 11 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Efficient set intersection with simulation-based security
scientific article

    Statements

    title
    Efficient set intersection with simulation-based security (English)
    0 references
    author
    Michael J. Freedman
    0 references
    Carmit Hazay
    0 references
    Kobbi Nissim
    0 references
    Benny Pinkas
    0 references
    publication date
    7 April 2016
    0 references
    cites work
    Balanced Allocations
    0 references
    Cuckoo hashing
    0 references
    Q2778845
    0 references
    Q4035733
    0 references
    Q2724587
    0 references
    Theory of Cryptography
    0 references
    Q4279565
    0 references
    Q3777937
    0 references
    Q5750403
    0 references
    Q3149675
    0 references
    Q2768332
    0 references
    Q4035712
    0 references
    Q4247202
    0 references
    Q3549621
    0 references

    Identifiers

    zbMATH DE Number
    6566224
    0 references
    Wikidata QID
    Q59379588
    0 references
    OpenAlex ID
    W2129550671
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q271588&oldid=36240400"
    Powered by MediaWiki