Sept. 5, 2022, 1:20 a.m. | Lesly-Ann Daniel, Sébastien Bardin, Tamara Rezk

cs.CR updates on arXiv.org arxiv.org

This paper tackles the problem of designing efficient binary-level
verification for a subset of information flow properties encompassing
constant-time and secret-erasure. These properties are crucial for
cryptographic implementations, but are generally not preserved by compilers.
Our proposal builds on relational symbolic execution enhanced with new
optimizations dedicated to information flow and binary-level analysis, yielding
a dramatic improvement over prior work based on symbolic execution. We
implement a prototype, Binsec/Rel, for bug-finding and bounded-verification of
constant-time and secret-erasure, and perform extensive …

applications binary secret security

SOC 2 Manager, Audit and Certification

@ Deloitte | US and CA Multiple Locations

Physical Security Operations Center - Supervisor

@ Equifax | USA-GA-Alpharetta-JVW3

Network Cybersecurity Engineer - Overland Park, KS Hybrid

@ Black & Veatch | Overland Park, KS, US

Cloud Security Engineer

@ Point72 | United States

Technical Program Manager, Security and Compliance, Cloud Compute

@ Google | New York City, USA; Kirkland, WA, USA

EWT Security | Vulnerability Management Analyst - AM

@ KPMG India | Gurgaon, Haryana, India