The Byzantine Postman Problem A Trivial Attack Against PIR-based Nym Servers
نویسندگان
چکیده
Over the last several decades, there have been numerous proposals for systems which can preserve the anonymity of the recipient of some data. Some have involved trusted third-parties or trusted hardware; others have been constructed on top of link-layer anonymity systems or mix-nets. In this paper, we evaluate a pseudonymous message system which takes the different approach of using Private Information Retrieval (PIR) as its basis. We expose a flaw in the system as presented: it fails to identify Byzantine servers. We provide suggestions on correcting the flaw, while observing the security and performance trade-offs our suggestions require.
منابع مشابه
Solving the Byzantine Postman Problem
Over the last several decades, there have been numerous systems proposed which aim to preserve the anonymity of the recipient of some data. Some have involved trusted third-parties or trusted hardware; others have been constructed on top of link-layer anonymity systems or mix networks. In this paper, we examine the Pynchon Gate [34], a pseudonymous message system which takes an alternate approa...
متن کاملThe Byzantine Postman Problem
Over the last several decades, there have been numerous proposals for systems which can preserve the anonymity of the recipient of some data. Some have involved trusted third-parties or trusted hardware; others have been constructed on top of link-layer anonymity systems or mix-nets. In this paper, we evaluate a pseudonymous message system which takes the different approach of using Private Inf...
متن کاملSubliminal Channels in the Private Information Retrieval Protocols
Information-theoretic private information retrieval (PIR) protocols, such as those described by Chor et al. [5], provide a mechanism by which users can retrieve information from a database distributed across multiple servers in such a way that neither the servers nor an outside observer can determine the contents of the data being retrieved. More recent PIR protocols also provide protection aga...
متن کاملDetering Dishonest Behaviour in Private Information Retrieval
It is useful to support Byzantine robustness in a Private Information Retrieval (PIR) protocol so that any database operators that are being used cannot maliciously affect the records that a client is looking for. We analyze the problem of Byzantine servers in Goldberg’s IT-PIR protocol and relate the problem to the well known stag hunt game. To make this game more applicable, we expand it to i...
متن کاملRobust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers
A private information retrieval (PIR) scheme on coded storage systems with colluding, byzantine, and nonresponsive servers is presented. Furthermore, the scheme can also be used for symmetric PIR in the same setting. An explicit scheme using an [n, k] generalized Reed-Solomon storage code is designed, protecting against t-collusion and handling up to b byzantine and r non-responsive servers, wh...
متن کامل