Understand the Multi-party circuit: Priority Encoder

  • Thread starter zak100
  • Start date
  • #1
zak100
462
11
TL;DR Summary
Hi, I am reading a paper from butI can't understand the circuitry
Paper link is:

MPCircuits: Optimized Circuit Generation for Secure Multi-Party Computation

I have a question:
What is the reason for using priority encode?

The circuit diagram is given. I want to give some text from book:

In secure stable matching, the match list is computed while
keeping the preference lists private to their respective owners.
This problem has been studied in the recent literature [21],
[22] where the secure stable matching problem is reduced to a
two-party secure computation scenario. Each individual XORshares
her preference list and sends it to two non-colluding
servers who perform the secure computation. However, stable
matching is inherently a multi-party problem and the assumption
of two non-colluding servers may not be feasible in
practice. To the best of our knowledge, we provide the first
solution for multi-party secure stable matching.



From the above text I want to understand why its a multi-party? It is taking input of 2 groups but why this circuit works as ##n * n## and not as ##2 * 2##?










Somebody please guide me



How we have multiparty stable matching_priority Encode.jpg

Zulfi.
 

Attachments

  • How we have multiparty stable matching.jpg
    How we have multiparty stable matching.jpg
    46.4 KB · Views: 186
Last edited:

Answers and Replies

  • #2
zak100
462
11
Hi,
The quotation is not displaying some text.

Zulfi.
 

Suggested for: Understand the Multi-party circuit: Priority Encoder

Replies
6
Views
417
Replies
8
Views
984
  • Last Post
Replies
8
Views
835
  • Last Post
Replies
6
Views
3K
Replies
1
Views
2K
Replies
4
Views
1K
Replies
8
Views
1K
Replies
1
Views
1K
Replies
3
Views
1K
Replies
6
Views
1K
Top