Cryptography and Information Security (CIS) Seminar

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.
Yevgeniy Dodis: Small-Box Cryptography
Friday, October 19, 2018 - 10:30am to 12:00pm

Abstract: 

Willy Quach: Laconic Function Evaluation and Applications
Friday, October 5, 2018 - 10:30am to 12:00pm

Abstract:  We introduce a new cryptographic primitive called laconic function

Aikaterini Sotiraki: PPP-Completeness with Connections to Cryptography
Friday, September 28, 2018 - 10:30am to 12:00pm
Abstract:   PPP is an important subclass of TFNP with profound connections to
the complexity of the fundamental cryptographic primitives: collision-resistant 
hash functions and one-way permutations. In contrast to most of the other subclasses 
Urmila Mahadev (Berkeley): Classical Homomorphic Encryption for Quantum Circuits
Friday, October 26, 2018 - 10:30am to 12:00pm
Abstract: We present the first leveled fully homomorphic encryption scheme for quantum circuits with classical keys.
Eylon Yogev (Weizmann Institute):On Distributional Collision Resistant Hashing
Friday, September 14, 2018 - 10:30am to 12:00pm
Abstract:
Merav Parter (Weizmann): Distributed Computing Made Secure: A New Cycle Cover Theorem
Monday, June 18, 2018 - 1:30pm to 3:00pm
Ran Cohen: Must the Communication Graph of MPC Protocols be an Expander?
Friday, May 18, 2018 - 10:30am to 12:00pm
Abstract:  Secure multiparty computation (MPC) on incomplete communication networks has been studied within two primary models: (1) Where a partial network is fixed a priori, and thus corruptions can occur dependent on its structure, and (2) Where edges in the 

Pages

Subscribe to Cryptography and Information Security (CIS) Seminar