Design and Analysis of Algorithms for Distributed Private Function Retrieval

Please enable javascript in your browser.

Khalesi, Ali | 2020

304 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 53449 (05)
University: Sharif University of Technology
Department: Electrical Engineering
Advisor(s): Mirmohseni, Mahtab; Maddah Ali, Mohammad Ali
Abstract:
In the problem of Distributed Multi¬User Secret Sharing (DMUSS), in which K users are connected through some error¬free links to N distinct storage nodes with the same size M information unit, the users desire to retrieve their corresponding secret message through an arbitrary set of accessible storage nodes. A trusted master node, which knows all of the secret messages transmits correctly and privately, the messages with a means of coding. The capacity of Distributed Multi¬User Secret Sharing is the supremum of all achievable schemes satisfying privacy and correctness conditions. In this thesis we have investigated two notions of privacy namely, individual and joint privacy. Individual privacy means that no individual user must understand anything from other user’s secret message and by joint privacy we mean that each user must not understand anything from joint distribution of other user’s messages. In this thesis, we have proposed two achievable scheme for each privacy constraint furthermore we derived the tight upper bound of size of each message for any arbitrarily access set by converse upper¬bound
Keywords:
Distributed System ; Privacy Preserving ; Storage Capacity ; Confidentiality ; Multi-User Secrecy ; Distributed Multi-User Secret Sharing (DMUSS)

No TOC