Cryptography and Information Security (CIS) Seminar

	Ran Gelles: Optimal Short-Circuit Resilient Formulas Friday, July 26, 2019 - 10:30am to 12:00pm Abstract: We consider fault-tolerant boolean formulas in which the output of a faulty gate is short-circuited to one of the gate’s inputs. A recent result by Kalai et al.
	Yevgeniy Dodis (NYU): Seedless Fruit is the Sweetest: Random Number Generation, Revisited Friday, April 12, 2019 - 10:30am to 12:00pm Abstract: The need for high-quality randomness in cryptography makes random-number generation one of its most fundamental tasks. A recent important line of work (initiated by Dodis et al., CCS ’13) focuses on
	Rio LaVigne: Adversarially Robust Property-Preserving Hash Functions Friday, February 22, 2019 - 10:30am to 12:00pm
	Alex Lombardi: Non-Interactive Zero Knowledge and Correlation Intractability from Circular-Secure FHE Friday, February 15, 2019 - 10:30am to 12:00pm Abstract: We construct non-interactive zero-knowledge (NIZK) arguments for NP from any circular-secure fully homomorphic encryption (FHE) scheme. In particular, we obtain such NIZKs under a circular-secure variant of the learning with errors (LWE) problem.
	Nadia Heninger: Lattice Attacks against Weak ECDSA Signatures in Cryptocurrencies Friday, May 31, 2019 - 10:30am to 12:00pm Abstract
	Elette Boyle: Compression Vector OLE and More Tuesday, January 15, 2019 - 10:30am to 12:00pm Abstract: We will speak about a CCS'18 result and the bigger picture of a new line of work in compressing different types of pseudorandom correlations. https://dl.acm.org/citation.cfm?id=3243868
	Amit Sahai: Obfuscation without multilinear maps Friday, November 30, 2018 - 10:30am to 12:00pm Abstract:
	Hoeteck Wee: Obfuscation from LWE: How Far Are We? Friday, November 16, 2018 - 10:30am to 12:00pm Abstract: GGH15 provide a way to encode many pairs of matrices, such that we can check whether any subset product is zero, while potentially hiding all other information about the matrices. This immediately yields a
	Oxana Poburinnaya: Fully bi-deniable interactive encryption Friday, November 9, 2018 - 10:30am to 12:00pm Abstract: Deniable encryption guarantees an extremely strong level of privacy: It provides the parties with algorithmic ways to come up with fake keys and random inputs that
	Mark Zhandry: Quantum Lightning Never Strikes the Same State Twice Friday, November 2, 2018 - 10:30am to 12:00pm Abstract: Quantum no-cloning states that it is physically impossible to clone a quantum state. No-cloning is a central to the study of quantum cryptography, where it allows for objects such as physically unforgeable currency.

Cryptography and Information Security (CIS) Seminar

Pages