Watermarking Cryptographic Functionalities from Standard Lattice Assumptions
Speaker
Sam Kim
Host
Vinod Vaikuntanathan
MIT CSAIL
Abstract: A software watermarking scheme allows one to embed a "mark" into a program
without significantly altering the behavior of the program. Moreover, it should
be difficult to remove the watermark without destroying the functionality of the
program. Recently, Cohen et al. (STOC 2016) and Boneh et al. (PKC 2017) showed
how to watermark cryptographic functions such as PRFs against arbitrary removal
strategies using indistinguishability obfuscation. A natural question is whether
we can build watermarking schemes from standard assumptions.
In this talk, I will present a watermarkable family of PRFs that are secure
against arbitrary removal strategies from only standard lattice assumptions.
Along the way, I will introduce a new intermediate primitive called a
translucent PRF and show that it can be used to construct a watermarkable family
of PRFs. Finally, I will present our construction of translucent PRF using only standard
lattice assumptions.
This is joint work with David J. Wu
without significantly altering the behavior of the program. Moreover, it should
be difficult to remove the watermark without destroying the functionality of the
program. Recently, Cohen et al. (STOC 2016) and Boneh et al. (PKC 2017) showed
how to watermark cryptographic functions such as PRFs against arbitrary removal
strategies using indistinguishability obfuscation. A natural question is whether
we can build watermarking schemes from standard assumptions.
In this talk, I will present a watermarkable family of PRFs that are secure
against arbitrary removal strategies from only standard lattice assumptions.
Along the way, I will introduce a new intermediate primitive called a
translucent PRF and show that it can be used to construct a watermarkable family
of PRFs. Finally, I will present our construction of translucent PRF using only standard
lattice assumptions.
This is joint work with David J. Wu