Jiaxin Guan will present his General Exam "Simple Schemes in the Bounded Storage Model" on May 13, 2019 at 2pm in CS 402. The members of his committee are Mark Zhandry (adviser), Arvind Narayanan, and Ran Raz. Everyone is invited to attend his talk, and those faculty wishing to remain for the oral exam following are welcome to do so. His abstract and reading list follow below. Abstract: The bounded storage model promises unconditional security proofs against computationally unbounded adversaries, so long as the adversary’s space is bounded. In this work, we develop simple new constructions of two-party key agreement, bit commitment, and oblivious transfer in this model. In addition to simplicity, our constructions have several advantages over prior work, including an improved number of rounds and enhanced correctness. Our schemes are based on Raz’s lower bound for learning parities. Reading List: Textbook: Katz, Jonathan, and Yehuda Lindell. Introduction to modern cryptography. CRC press, 2014. Papers (in alphabetic order): Badrinarayanan, Saikrishna, et al. "Post-zeroizing obfuscation: New mathematical tools, and the case of evasive circuits." Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, Berlin, Heidelberg, 2016. Barak, Boaz, et al. "On the (im) possibility of obfuscating programs." Annual International Cryptology Conference. Springer, Berlin, Heidelberg, 2001. De Santis, Alfredo, Giuseppe Persiano, and Moti Yung. "One-message statistical Zero-Knowledge Proofs and space-bounded verifier." International Colloquium on Automata, Languages, and Programming. Springer, Berlin, Heidelberg, 1992. Ding, Yan Zong, et al. "Constant-round oblivious transfer in the bounded storage model." Theory of Cryptography Conference. Springer, Berlin, Heidelberg, 2004. Ding, Yan Zong. "Oblivious transfer in the bounded storage model." Annual International Cryptology Conference. Springer, Berlin, Heidelberg, 2001. Goldreich, Oded, and Leonid A. Levin. "A hard-core predicate for all one-way functions." Proceedings of the twenty-first annual ACM symposium on Theory of computing. ACM, 1989. Goldwasser, Shafi, Silvio Micali, and Charles Rackoff. "The knowledge complexity of interactive proof systems." SIAM Journal on computing 18.1 (1989): 186-208. Kilian, Joe. "Founding crytpography on oblivious transfer." Proceedings of the twentieth annual ACM symposium on Theory of computing. ACM, 1988. Maurer, Ueli M. "Conditionally-perfect secrecy and a provably-secure randomized cipher." Journal of Cryptology 5.1 (1992): 53-66. Raz, Ran. "Fast learning requires good memory: A time-space lower bound for parity learning." Journal of the ACM (JACM) 66.1 (2018): 3.