Cryptography and Information Security (CIS) Seminar
 |
Silas Richelson: On the Hardness of Learning with Rounding with Small Modulus Friday, September 18, 2015 - 10:30am to 12:00pm Abstract: 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, Revisited Friday, September 11, 2015 - 10:30am to 12:00pm Abstract: 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 Watermarking Friday, May 15, 2015 - 10:30am to 12:00pm Abstract: 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 Learning Friday, May 8, 2015 - 10:30am to 12:00pm |
 |
Justin Holmgren: Succinctly Garbling and Obfuscating RAM programs Friday, 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 Computation Friday, March 6, 2015 - 10:30am to 12:00pm Abstract: 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? |
 |
Ranjit Kumaresan: How to Use Bitcoin to Design Fair Protocols Friday, March 13, 2015 - 10:30am to 12:00pm Abstract:
We study a model of fairness in secure computation in which an adversarial party that
aborts on receiving output is forced to pay a mutually predefined monetary penalty. We |
 |
Silas Richelson: Topology-Hiding Computation Friday, February 13, 2015 - 10:30am to 12:00pm Abstract: |
 |
Vanishree Rao: Adaptive Multiparty Non-Interactive Key Exchange without Setup in the Standard Model Friday, January 23, 2015 - 10:30am to 12:00pm Abstract: Non-interactive key exchange (NIKE) is a fundamental notion in Cryptography. This notion was introduced by Diffie and Hellman in 1976. |
 |
Raphael Bost: Machine Learning Classification over Encrypted Data Friday, February 6, 2015 - 10:30am to 12:00pm Abstract: Machine learning classification is used in numerous settings nowadays, such as medical or genomics predictions, spam detection, face recognition, and financial predictions. |
 |
Breaking a real life signature scheme with only 20 signature queries Thursday, October 30, 2014 - 4:00pm to 5:30pm Abstract: I will discuss recent joint work with Uni. Adelaide on |
 |
Obfuscating Circuits via Composite-Order Graded Encoding Friday, October 31, 2014 - 10:30am to 12:00pm Abstract:
|
 |
On the Communication Complexity of Secure Function Evaluation with Long Output Friday, November 14, 2014 - 10:30am to 12:00pm Abstract: We study the communication complexity of secure function evaluation (SFE). |
 |
Dual System Encryption via Predicate Encodings Friday, November 7, 2014 - 10:30am to 12:00pm Abstract: In this talk, I will present the notion of predicate encodings, an information-theoretic primitive reminiscent of linear secret-sharing that in addition, satisfies a novel notion of reusability. Using this notion, we obtain a unifying framework for adaptively-secure |
 |
Strong Key Derivation from Noisy Sources Friday, December 12, 2014 - 10:30am to 12:00pm Abstract: A shared cryptographic key enables strong authentication. Candidate sources for creating such a shared key include biometrics and physically unclonable functions. However, these sources come with a substan |
 |
Sergey Gorbunov: New Advances in Fuctional Encryption Friday, October 10, 2014 - 10:30am to 12:00pm Abstract: Functional encryption is an emerging vision for public-key cryptography offering fine-grained mechanism for computing on encrypted data. Unfortunately, currently all of the more powerful constructions of functional encryption are built from non |
Pages
