- B 3 6 B 9 F 5 7 6 B 7 9 F 4 A 1
- F 9 B B B 1 5 D 3 5 7 D A D 5 6
- 1 E 1 C 8 C D C 0 2 4 5 C C B 7
- E 3 7 E 0 4 3 9 E 5 3 1 2 2 F A
- C 6 1 E 2 B E B B 0 9 A F 5 E C
- C F 9 E 6 7 8 A 8 2 C C D 8 6 C
- 3 7 D 8 F 7 A 9 2 9 4 7 5 9 9 D
- 5 1 8 A 0 B 0 B E 4 4 E 8 4 9 D
Quarter 4: Autumnal Equinox to Winter Solstice
Doctoral Program
The unequivocally predominant accomplishment this quarter was finishing my first semester at The Graduate School and University Center of the City University of New York (GC - CUNY). Completing the four courses comprising 13 credits which I was enrolled in this semester was quite time consuming. However, the end of term projects and papers yielded some new avenues of research. I have begun reflecting with Professor Sergei Artemov on the foundational mathematics problem of proving an axiomatic system’s consistency within the system. Additionally, I have started work with my doctoral advisor, Professor Subash Shankar, along with Professor Jun LI in applying program synthesis in deriving bit-manipulation techniques to remove control flow by utilizing abstractions from coding theory. I am excited to learn where these avenues of inquiry lead over the coming months.
TreeKEM Formal Verification
After the completion of my master’s thesis on formal verification of TreeKEM via explicit model checking, I have continued refining the model encoding and performance tuning the verification strategy. The results of this endeavor have been manifold.
- The model’s state vector length has been (roughly) reduced from 200 to 60 bytes.
- The utilization of bit-manipulation techniques to remove control flow within the model encoding reduced the state-space by one order of magnitude and, unsurprisingly, noticeably shortened the verification time.
- An abstraction was applied which allowed removing the T parameter from the model, permitting verification of LTL properties for any number of communication epochs, rather that only verify for a number of communication epochs up to the fixed bound T.
- Overall space requirements have been reduced by multiple orders of magnitude.
- Overall time of verification has been reduced by multiple orders of magnitude.
I am in the process of completing a manuscript for publication in 2023 detailing the techniques utilized to make verification tractable. The manuscript will include the results of verifying TreeKEM and the relationship of the results to prior work. For those individuals using secure group messaging platforms which utilize the TreeKEM protocol, the take away the impending manuscript is that forward secrecy and post-compromise security are security guarantees we can continue to enjoy for the foreseeable future.