This week's post touches on subjects spanning almost 2000 years — we start with a cryptographic problem and go back in time to discover a theorem that could be known to the Greeks. Its content is based on a paper co-authored with Anton Mityagin and Kobbi Nissim that appeared in ANTS VII in 2006. The … Continue reading From Discrete Logarithm Problem to Menelaus Theorem

This is a followup to the previous post on program obfuscation written jointly with Guy Rothblum.The problem of program obfuscation is fascinating.  The question at hand is whether one can transform a program (say, described as a Boolean circuit) into a form that is executable (i.e., has the same input/output behavior), but is otherwise completely … Continue reading Progress and Challenges in Code Obfuscation: Part II