- Rate-1 Non-malleable Codes for Polysize Tampering
- Project Year:
2022
- REU Student (s):
Guillermo Gaboa | Charles University (Prague, Czech Republic)
- Student 1 Institution:
Charles University (Prague, Czech Republic)
- Project Mentor:
Marshall Ball
- Project Mentor Area:
Department of Computer Science, Courant Institute of Mathematical Sciences, NYU
- Project Abstract:
In this project, we attempted to construct a rate-1 compiler for a non-malleable code with respect to tampering from functions that can be computed by circuits of polynomial size. We extend the ideas presented by Ball, Dachman-Soled and Loss who presented such a code with rate 0. Ourc ompiler does not preserve the non-malleability properties of the code and we present an attack that shows this. Finally, we present some possible improvements in this direction.