Completeness theorems with constructive proofs for finite deterministic 2-party functions (Q3000549)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Completeness theorems with constructive proofs for finite deterministic 2-party functions |
scientific article; zbMATH DE number 5897267
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Completeness theorems with constructive proofs for finite deterministic 2-party functions |
scientific article; zbMATH DE number 5897267 |
Statements
Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions (English)
0 references
19 May 2011
0 references
oblivious transfer
0 references
complete primitives
0 references
information-theoretic security
0 references
universal composability
0 references
secure function evaluation
0 references
0.8276520371437073
0 references
0.8167986869812012
0 references
0.8064702749252319
0 references
0.8047730326652527
0 references
0.800830066204071
0 references
