 |
||||||||||
|
Condado Plaza Hilton, San Juan, Puerto Rico, USA
December 3-4, 2018
Collocated with
ACSAC
2018
Keynote Speaker
Christian Collberg, Professor, University of Arizona
Talk: "Tigress: A Source-to-Source-ish Obfuscation Tool"
Christian Collberg is a Professor in the Department of Computer Science at the University of Arizona. Prior to arriving in Tucson he worked at the University of Auckland, New Zealand, and before that got his Ph.D. from Lund University, Sweden. He has also held a visiting position at the Chinese Academy of Sciences in Beijing, China, and taught courses at universities in Russia and Belarus.
Dr. Collberg's main research interest is the so-called Man-At-The-End Attack which occurs in settings where an adversary has physical access to a device and compromises it by tampering with its hardware or software. He is the co-author of Surreptitious Software: Obfuscation, Watermarking, and Tamperproofing for Software Protection, published in Addison-Wesley's computer security series. It has also been translated into Portuguese and Chinese.
In addition to his security research, Dr. Collberg is an advocate for Reproducibility, Repeatability, and Sharing in Computer Science. He maintains the site FindResearch.org which aims to be the most authoritative and complete catalog of research artifacts (e.g., code and data) related to Computer Science publications. .
Invited Talk
Saeed Nejati, Doctoral Candidate, University of Waterloo
Talk: "Enhancing SAT Solvers for Cryptanalysis Tasks"
Over the last two decades we have seen a dramatic improvement in the efficiency of SAT solvers over industrial instances generated. Inspired by this success many researchers have used SAT solvers for cryptanalysis of cryptographic primitives. Most of these approaches used a direct encoding of the problems into a satisfiability instance and used SAT solvers as a black-box. In this presentation we look into tailoring some of the search heuristics in sequential and parallel SAT solvers to improve the general performance of the solvers specially for cryptographic instances. We leverage the domain knowledge to enhance internal components of the solver in a programmatic way to improve solving time of algebraic cryptanalysis problems.
Saeed Nejati is a PhD candidate in Electrical and Computer Engineering at University of Waterloo, working with Professors Vijay Ganesh and Catherine Gebotys. His research focuses on parallel Boolean satisfiability solvers and their application in algebraic cryptanalysis.