James Bartusek will present his MSE thesis talk "Obfuscating Simple Functionalities" on Monday, May 6, 2019 at 2:30pm in CS 105
James Bartusek will present his MSE thesis talk "Obfuscating Simple Functionalities" on Monday, May 6, 2019 at 2:30pm in CS 105. The members of his committee are Mark Zhandry (adviser) and Zeev Dvir. Everyone is invited to attend his talk. His abstract follows below. Title: Obfuscating Simple Functionalities Abstract: Program obfuscation is the study of how to securely hide secrets within computer programs. An obfuscator is a compiler that takes as input a computer program P and scrambles it to produce a new program P' that maintains the functionality of P but hides as much as possible about how P is implemented. While constructing a secure and efficient obfuscator that works for any program P appears out of reach with current techniques, there has been a long line of research constructing secure and efficient obfuscators that work for certain simple classes of programs. In this thesis, we continue this line of research and improve on existing work in various ways. In one direction, we present novel obfuscation constructions that are simple, efficient, and secure under standard assumptions. We focus on obfuscating conjunction functions, and construct one obfuscator that is secure under the LPN (learning parity with noise) assumption and another that is secure information theoretically. In another direction, we consider additional security properties that may be useful in the context of obfuscation, such as encrypted inputs and non-malleability. In particular, we give a construction of obfuscation with encrypted inputs that can be compiled into a public-key function-private hidden vector encryption scheme, resolving an open problem of Boneh, Raghunathan, and Segev (Asiacrypt 2013). In addition, we give a standard model construction of point function obfuscation that is provably non-malleable under a large class of mauling functions.
James Bartusek will present his MSE thesis talk "Obfuscating Simple Functionalities" on Tuesday, May 7, 2019 at 2pm in CS 401 - (Please note change of date and location) The members of his committee are Mark Zhandry (adviser) and Zeev Dvir. Everyone is invited to attend his talk. His abstract follows below. Title: Obfuscating Simple Functionalities Abstract: Program obfuscation is the study of how to securely hide secrets within computer programs. An obfuscator is a compiler that takes as input a computer program P and scrambles it to produce a new program P' that maintains the functionality of P but hides as much as possible about how P is implemented. While constructing a secure and efficient obfuscator that works for any program P appears out of reach with current techniques, there has been a long line of research constructing secure and efficient obfuscators that work for certain simple classes of programs. In this thesis, we continue this line of research and improve on existing work in various ways. In one direction, we present novel obfuscation constructions that are simple, efficient, and secure under standard assumptions. We focus on obfuscating conjunction functions, and construct one obfuscator that is secure under the LPN (learning parity with noise) assumption and another that is secure information theoretically. In another direction, we consider additional security properties that may be useful in the context of obfuscation, such as encrypted inputs and non-malleability. In particular, we give a construction of obfuscation with encrypted inputs that can be compiled into a public-key function-private hidden vector encryption scheme, resolving an open problem of Boneh, Raghunathan, and Segev (Asiacrypt 2013). In addition, we give a standard model construction of point function obfuscation that is provably non-malleable under a large class of mauling functions. _______________________________________________ talks mailing list talks@lists.cs.princeton.edu To edit subscription settings or remove yourself, use this link: https://lists.cs.princeton.edu/mailman/listinfo/talks
Jerry Wei will present his MSE thesis talk "Browser Beware: An Empirical Study of Disinformation Warning Effectiveness" on Wednesday, May 8, 2019 at 1:30pm in CS 402. The members of his committee are Jonathan Mayer (adviser) and Marshini Chetty.. Everyone is invited to attend his talk. His abstract follows below. We present the first-of-its-kind user experience study to assess whether browser warnings are effective measures for preventing users from accessing disinformation websites. Current browser warning research has focused on the use of warnings to protect users from malware, phising, and security vulnerabilities. We create warnings in Google Chrome that caution users against disinformation by adapting the existing security warnings, and conduct a laboratory experiment to examine users’ reactions when they encounter disinformation sites. To our knowledge, we present the first in-depth field study of browser disinformation warnings, and their impact on user behavior.
participants (1)
-
Nicki Mahler