Sophia Yakoubov

Sophia graduated from MIT in 2011 with a B.S. in Mathematics with Computer Science (course 18c), and from Boston University in 2020 with a Ph.D. in Computer Science (specifically, Cryptography) under the advisement of Professor Leo Reyzin. Before and during her graduate studies, she worked as a cryptographer and software engineer at MIT Lincoln Laboratory. She is currently an assistant professor at Aarhus University.

Sophia has an Erdös number of 3. (She co-authored with Ivan Damgård, who co-authored with Carl Pomerance, who co-authored with Paul Erdös.)

Publications

• Multi Designated Verifier Ring Signatures (Communications in Cryptology 2024)
  With S. Kolby and E. Pagnin.
  
• Constant-Round YOSO MPC Without Setup (Communications in Cryptology 2024)
  WIth S. Kolby and D. Ravi.
  
• Efficient Secure Communication Over Dynamic Incomplete Networks With Minimal Connectivity (TCC 2024)
  With I. Damgård, D. Ravi, L. Roy and D. Tschudi.
  
• Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels (Latincrypt 2023)
  With I. Damgård, D. Ravi and L. Siniscalchi .
  
• Broadcast-Optimal Four-Round MPC in the Plain Model (TCC 2023)
  With M. Chiampi, I. Damgård, D. Ravi, L. Siniscalchi and Y. Xia.
  
• Taming Adaptivity in YOSO Protocols: The Modular Way (TCC 2023)
  With R. Canetti, S. Kolby, D. Ravi and E. Soria-Vazquez.
  
• Secure Communication in Dynamic Incomplete Networks (ITC 2023)
  With I. Damgård, D. Ravi and D. Tschudi.
  
• Minimizing Setup in Broadcast-Optimal Two Round MPC (Eurocrypt 2023)
  With I. Damgård, D. Ravi and L. Siniscalchi.
  
• Threshold-Optimal MPC with Friends and Foes (Indocrypt 2023)
  With D. Ravi N. Melissaris.
  
• The State of the Union: Union-Only Signatures for Data Aggregation (SCN 2022)
  With D. F. Aranha, F. Engelmann and S. Kolby.
  
• On Sufficient Oracles for Secure Computation with Identifiable Abort (SCN 2022)
  With M. Simkin and L. Siniscalchi.
  
• Distributed (Correlation) Samplers: How to Remove a Trusted Dealer in One Round (Eurocrypt 2022)
  With D. Abram and P. Scholl.
  
• Count Me In! Extendability for Threshold Ring Signatures (PKC 2022)
  With D. F. Aranha, M. Hall-Andersen, A. Nitulescu and E. Pagnin.
  
• Random-index PIR with Applications to Large-Scale Secure MPC (TCC 2021)
  With C. Gentry, S. Halevi, B. Magri and J. B. Nielsen.
  
• Stronger Notions and a More Efficient Construction of Threshold Ring Signatures (Latincrypt 2021)
  With A. Munch-Hansen and C. Orlandi.
  
• Broadcast-Optimal Two Round MPC with an Honest Majority (Crypto 2021)
  With I. Damgård, B. Magri, D. Ravi and L. Siniscalchi.
  
• YOSO: You Only Speak Once / Secure MPC with Stateless Ephemeral Roles (Crypto 2021)
  With C. Gentry, S. Halevi, H. Krawczyk, B. Magri, J. B. Nielsen and T. Rabin.
  
• The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT (Eurocrypt 2021)
  With C. Orlandi and P. Scholl.
  
• Broadcast Secret-Sharing, Bounds and Applications (ITC 2021)
  With I. Damgård and K. G. Larsen.
  
• Turning HATE Into LOVE: Compact Homomorphic Ad Hoc Threshold Encryption for Scalable MPC (CSCML 2021)
  With L. Reyzin and A. Smith.
  
• Stronger Notions and Constructions for Multi-Designated Verifier Signatures (TCC 2020)
  With I. Damgård, H. Haagh, R. Mercer, A. Nitulescu and C. Orlandi.
  
• Universally Composable Accumulators (CT-RSA 2020)
  With R. Canetti and F. Baldimtsi.
  
• Fuzzy Password-Authenticated Key Exchange (Eurocrypt 2018)
  With P.A. Dupont, J. Hesse, D. Pointcheval and L. Reyzin.
  PPT, video from TPMPC 2018, video from Eurocrypt 2018
  
• Catching MPC Cheaters: Identification and Openability (ICITS 2017)
  With R. Cunningham and B. Fuller.
  
• Efficient Accumulators with Applications to Anonymity-Preserving Revocation (Euro S&P 2017)
  With F. Baldimtsi, J. Camenisch, M. Dubovitskaya, A. Lysyanskaya, K. Samelin and L. Reyzin.
  
• Efficient Asynchronous Accumulators for Distributed PKI (SCN 2016)
  With L. Reyzin.
  PPT
• Cryptography for Big Data Security (2016)
  With A. Yerukhimovich, A. Hamlin, N. Schear, E. Shen and M. Varia.
  This work appeared as a book chapter in Big Data: Storage, Sharing, and Security in May 2016.
• Automated Assessment of Secure Search Systems (ACM SIGOPS Operating Systems Review; Special Issue on Repeatability and Sharing of Experimental Artifacts 2015)
  With M. Varia, B. Price, N. Hwang, R. K. Cunningham, A. Hamlin, J. Herzog, J. Poland, and M. Reschly.
  
• HEtest: A Homomorphic Encryption Testing Framework (Workshop on Encrypted Computing and Applied Homomorphic Cryptography 2015)
  With M. Varia and Y. Yang.
  The associated codebase can be found here.
• A Survey of Cryptographic Approaches to Securing Big-Data Analytics in the Cloud (HPEC 2014)
  With V. Gadepally, N. Schear, E. Shen and A. Yerukhimovich.
  
• Pattern Avoidance in Extensions of Comb-Like Posets (Permutation Patterns 2013, Journal of Combinatorics 2015)
  PPT
  

Unpublished Manuscripts and Notes

• A Decentralized Public Key Infrastructure with Identity Retention
  With C. Fromknecht and D. Velicanu.
  This work was completed as a class project for 6.857 (Computer and Network Security) at MIT.
• A Gentle Introduction to Yao's Garbled Circuits
  

Other

• LLCipher is a summer cryptography program for high-school students.
  
  • (2015) LLCipher on MITLL and MIT news
  • (2016) LLCipher on MITLL and MIT news
  On the first morning of the program, the students crack some classical ciphers. These exercises can be found here here.
• My Favorite Puzzles
  More puzzles can be found at...
  • Sam Steingold's site
  • xkcd
  • Tanya Khovanova
  • Algorithmic Puzzles, by Levitin and Levitin