# Cryptography and Information Security (CIS) Seminar

 Anne Broadbent: Quantam Homomorphic Encryption for Circuits of Low T-Gate ComplexityFriday, October 30, 2015 - 10:30am to 12:00pmAbstract:  Fully homomorphic encryption is an encryption method with the property that any computation on the plaintext can be performed by a party having access to the ciphertext only. Charles River Crypto Day at MITFriday, October 23, 2015 - 9:30am to 4:00pmPlease visit https://bostoncryptoday.wordpress.com/2015/10/ for Information Sidharth Telang: Output-Compressing Randomized Encodings and ApplicationsFriday, October 9, 2015 - 10:30am to 12:00pmAbstract: We consider randomized encodings (RE) that enable encoding a Turing machine P and input x into its “randomized encoding” \hat{P(x)} in sublinear, or even polylogarithmic, time in the running-time of P(x), independent of its output length. Noah Stephens-Davidowitz: Solving SVP (and CVP) in 2^n Time via Discrete Gaussian SamplingFriday, September 25, 2015 - 10:30am to 12:00pmAbstract: We show a $2^{n+o(n)}$-time algorithm for the Shortest Vector Problem on n-dimensional lattices (improving on the previous best-known a Silas Richelson: On the Hardness of Learning with Rounding with Small ModulusFriday, September 18, 2015 - 10:30am to 12:00pmAbstract: We show the following reductions from the learning with errors problem (LWE) to the learning with rounding problem (LWR): (1) Learning the se Ranjit Kumaresan: Secure Computation with Minimal Interaction, RevisitedFriday, September 11, 2015 - 10:30am to 12:00pmAbstract: Motivated by the goal of improving the concrete efficiency of secure multiparty computation (MPC), we revisit the question of MPC with only two rounds of interaction. Aloni Cohen: Publicly Verifiable Software WatermarkingFriday, May 15, 2015 - 10:30am to 12:00pmAbstract: Software Watermarking is the process of transforming a program into a functionally equivalent “marked” program in such a way that it is computationally hard to remove the mark without destroying functionality. Mark Zhandry: Order-Revealing Encryption and the Hardness of Private LearningFriday, May 8, 2015 - 10:30am to 12:00pm Justin Holmgren: Succinctly Garbling and Obfuscating RAM programsFriday, May 1, 2015 - 10:30am to 12:00pm Abstract: Program obfuscation, and in particular the notion of Indistinguishability Obfuscation (IO) has Ben Fisch: Physical Zero Knowledge and Secure ComputationFriday, March 6, 2015 - 10:30am to 12:00pmAbstract: Is it possible to prove that two DNA-fingerprints match, or that they do not match, without revealing any further information about the fingerprints? Is it possible to prove that two objects have the same design without revealing the design itself?