Secure multi-party computation protocol for sequencing problem (Q350932): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Practical Two-Party Computation Based on the Conditional Gate / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4823929 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Strong Conditional Oblivious Transfer and Computing on Intervals / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2724463 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Efficient Solution to the Millionaires’ Problem Based on Homomorphic Encryption / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A proof of security of Yao's protocol for two-party computation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3374918 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: How to share a secret / rank | |||
Normal rank | |||
Latest revision as of 14:06, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Secure multi-party computation protocol for sequencing problem |
scientific article |
Statements
Secure multi-party computation protocol for sequencing problem (English)
0 references
3 July 2013
0 references
secure multi-party computation
0 references
sequencing problem
0 references
secret sharing
0 references
