Security and privacy are of paramount importance in the modern information age. Secure multi-party computation and private information retrieval are canonical and representative problems in cryptography that capture the key challenges in understanding the fundamentals of security and privacy. In this dissertation, we use information theoretic tools to tackle these two classical cryptographic primitives. In the first part, we consider the secure multi-party computation problem, where multiple users, each holding an independent message, wish to compute a function on the messages without revealing any additional information. We present an efficient protocol in terms of randomness cost to securely compute a vector linear function. In the second part, we discuss the symmetric private information retrieval problem, where a user wishes to retrieve one message from a number of replicated databases while keeping the desired message index a secret from each individual database. Further, the user learns nothing about the other messages. We present an optimal protocol that achieves the minimum upload cost for symmetric private information retrieval, i.e., the queries sent from the user to the databases have the minimum number of bits.
| Identifer | oai:union.ndltd.org:unt.edu/info:ark/67531/metadc1752381 |
| Date | 12 1900 |
| Creators | Zhou, Yanliang |
| Contributors | Sun, Hua, Fu, Shengli, Li, Xinrong, Si, Hongbo |
| Publisher | University of North Texas |
| Source Sets | University of North Texas |
| Language | English |
| Detected Language | English |
| Type | Thesis or Dissertation |
| Format | viii, 55 pages, Text |
| Rights | Public, Zhou, Yanliang, Copyright, Copyright is held by the author, unless otherwise noted. All rights Reserved. |
Page generated in 0.0019 seconds