Seminars
View all Seminars | Download ICal for this eventThe Right to Deny
Series: Infosys Science Foundation Lecture
Speaker: Prof. Shafi Goldwesser Director of Simons Institute Theory of Computing Professor at UC Berkeley MIT, Weizmann Institute
Date/Time: Jan 06 16:00:00
Location: Faculty Hall, Indian Institute of Science
Abstract:
Plausible deniability seems like the ultimate get-out-of-jail-free card. But how can we make it work when it comes to digital information sent in a public network.
Deniable encryption, defined by Canetti et al (Crypto 1997), suggests a method to achieve deniability by the sender of encrypted messages to overcome this problem. The idea is especially interesting in the context of electronic elections to eliminate the threat of vote buying after a vote has been cast.
I will present two new works on the subject.
1) With Agarwal and S. Mossel (Crypto21) we define and construct sender Deniable Fully Homomorphic Encryption with compact ciphertexts based on the Learning With Errors (LWE) polynomial hardness assumption. Deniable FHE enables storing encrypted data in the cloud to be processed securely without decryption, maintaining deniability of the encrypted data.
2) With Coladangelo and Vazirani (STOC22), we show a sender deniable encryption scheme where the encryption scheme is a quantum algorithm but the ciphertext is classical which is secure under the LWE polynomial hardness assumption. This scheme achieves for the first time simultaneously compactness, negligible deniability and polynomial encryption timeunder LWE. Furthermore, it is possible to extend the scheme so that coercion in an election cannot take place when the coercer is able to dictate all inputs to the deniable encryption algorithm even prior to encryption.
Speaker Bio:
Shafi Goldwasser is Director of Simons Institute for the Theory of Computing and is a professor at UC Berkeley (EECS), MIT (EECS) and Weizmann Institute (CS, Applied Math). Goldwasser holds B.S. Applied Mathematics, CMU (1979), and M.S. (1981) and Ph.D. (1984) in CS, UC Berkeley.
Goldwassers discoveries include the introduction of probabilistic encryption, interactive zero knowledge protocols, elliptic curve primality testings, hardness of approximation proofs for combinatorial problems, and combinatorial property testing.
Goldwasser received the ACM Turing Award (2012), Gödel Prize (1993, 2001), ACM Hopper Award (1996), RSA Award in Mathematics (1998), ACM Athena Award (2008), Franklin Medal (2010), IEEE Piore Award (2011), Simons Foundation Investigator Award (2012), BBVA Foundation Frontiers of Knowledge Award (2018), and LOréal-UNESCO For Women in Science Award (2021). Goldwasser is a member of the NAS, NAE, AAAS, Russian and Israeli Academies of Science, and London Royal Mathematical Society. Goldwasser holds honorary degrees from many universities.
Host: Dept. of C.S.A