Secure two-party computation with reusable bit-commitments, via a cut-and-choose with forge-and-lose technique (extended abstract) (Q2867169)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6237171
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Secure two-party computation with reusable bit-commitments, via a cut-and-choose with forge-and-lose technique (extended abstract) |
scientific article; zbMATH DE number 6237171 |
Statements
Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique (English)
0 references
10 December 2013
0 references
secure two-party computation
0 references
cut-and-choose
0 references
garbled circuits
0 references
forge-and-lose
0 references
homomorphic bit-commitments with trapdoor
0 references
0.857361912727356
0 references
0.8507938981056213
0 references
0.8455997109413147
0 references
0.8434998393058777
0 references
0.8368616104125977
0 references
