Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique (Q2867169): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:25, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique |
scientific article |
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
