The communication complexity of private simultaneous messages, revisited (Q5918864): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2778845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Garbled Circuits as Randomized Encodings of Functions: a Primer / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomization in Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Cryptographic Complexity of the Worst Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the classification of ideal secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of shares for secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Private information retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication and Randomness Lower Bounds for Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal model for secure computation (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Protecting data privacy in private information retrieval schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform hardness versus randomness tradeoffs for Arthur-Merlin games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Garbling Schemes and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional disclosure of secrets via non-linear reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomizing Arthur-Merlin games using hitting sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy Identity-Based Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Theory of Secrecy Systems* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization / rank
 
Normal rank

Latest revision as of 21:51, 22 July 2024

scientific article; zbMATH DE number 7211769
Language Label Description Also known as
English
The communication complexity of private simultaneous messages, revisited
scientific article; zbMATH DE number 7211769

    Statements

    The communication complexity of private simultaneous messages, revisited (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 June 2020
    0 references
    information theoretic security
    0 references
    private simultaneous messages
    0 references
    conditional disclosure of secrets
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references