Communication Complexity in Algebraic Two-Party Protocols (Q3600230)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Communication Complexity in Algebraic Two-Party Protocols
scientific article

    Statements

    Communication Complexity in Algebraic Two-Party Protocols (English)
    0 references
    0 references
    0 references
    10 February 2009
    0 references
    homomorphic encryption
    0 references
    fully homomorphic encryption
    0 references
    private information retrieval
    0 references
    PIR writing
    0 references
    keyword search
    0 references
    communication complexity
    0 references
    algebraic lower bounds
    0 references

    Identifiers