Completeness for symmetric two-party functionalities: revisited (Q2413612): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00145-017-9267-7 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00145-017-9267-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2765939664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Zero-One Law for Boolean Privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness in two-party secure computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities / 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: Reducibility and Completeness in Private Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Full Characterization of Completeness for Two-Party Randomized Function Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privacy and Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness for Symmetric Two-Party Functionalities - Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Characterization of Completeness and Triviality for Secure Function Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Differential Privacy / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00145-017-9267-7 / rank
 
Normal rank

Latest revision as of 11:49, 18 December 2024

scientific article
Language Label Description Also known as
English
Completeness for symmetric two-party functionalities: revisited
scientific article

    Statements

    Completeness for symmetric two-party functionalities: revisited (English)
    0 references
    0 references
    0 references
    0 references
    14 September 2018
    0 references
    secure computation
    0 references
    hardness assumptions
    0 references
    completeness
    0 references
    non-black-box reductions
    0 references

    Identifiers