| 2025 | CRYPTO | Uniform Black-Box Separations via Non-malleable Extractors. | Marshall Ball, Dana Dachman-Soled |
| 2025 | EuroCrypt | (Inefficient Prover) ZAPs from Hard-to-Invert Functions. | Marshall Ball, Dana Dachman-Soled |
| 2025 | PKC | Revisiting the Security of Approximate FHE with Noise-Flooding Countermeasures. | Flvio Bergamaschi, Anamaria Costache, Dana Dachman-Soled, Hunter Kippen, Lucas LaBuff, Rui Tang |
| 2024 | ICML | Bounding the Excess Risk for Linear Models Trained on Marginal-Preserving, Differentially-Private, Synthetic Data. | Yvonne Zhou, Mingyu Liang, Ivan Brugere, Danial Dervovic, Antigoni Polychroniadou, Min Wu, Dana Dachman-Soled |
| 2023 | CRYPTO | Revisiting Security Estimation for LWE with Hints from a Geometric Perspective. | Dana Dachman-Soled, Huijing Gong, Tom Hanson, Hunter Kippen |
| 2023 | FOCS | Extracting Randomness from Samplable Distributions, Revisited. | Marshall Ball, Eli Goldin, Dana Dachman-Soled, Saachi Mutreja |
| 2022 | CCS | When Frodo Flips: End-to-End Key Recovery on FrodoKEM via Rowhammer. | Michael Fahr, Hunter Kippen, Andrew Kwong, Thinh Dang, Jacob Lichtinger, Dana Dachman-Soled, Daniel Genkin, Alexander Nelson, Ray A. Perlner, Arkady Yerukhimovich, Daniel Apon |
| 2022 | CRYPTO | (Nondeterministic) Hardness vs. Non-malleability. | Marshall Ball, Dana Dachman-Soled, Julian Loss |
| 2022 | TCC | Secure Sampling with Sublinear Communication. | Seung Geol Choi, Dana Dachman-Soled, S. Dov Gordon, Linsheng Liu, Arkady Yerukhimovich |
| 2021 | CCS | Compressed Oblivious Encoding for Homomorphically Encrypted Search. | Seung Geol Choi, Dana Dachman-Soled, S. Dov Gordon, Linsheng Liu, Arkady Yerukhimovich |
| 2021 | CRYPTO | Non-malleable Codes for Bounded Parallel-Time Tampering. | Dana Dachman-Soled, Ilan Komargodski, Rafael Pass |
| 2021 | TCC | BKW Meets Fourier New Algorithms for LPN with Sparse Parities. | Dana Dachman-Soled, Huijing Gong, Hunter Kippen, Aria Shahverdi |
| 2020 | CRYPTO | New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust. | Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni |
| 2020 | CRYPTO | LWE with Side Information: Attacks and Concrete Security Estimation. | Dana Dachman-Soled, Lo Ducas, Huijing Gong, Mlissa Rossi |
| 2020 | ICLR | How to 0wn the NAS in Your Spare Time. | Sanghyun Hong, Michael Davinroy, Yigitcan Kaya, Dana Dachman-Soled, Tudor Dumitras |
| 2020 | TCC | Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures. | Dana Dachman-Soled |
| 2019 | EuroCrypt | Non-Malleable Codes Against Bounded Polynomial Time Tampering. | Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Huijia Lin, Tal Malkin |
| 2019 | PKC | Upper and Lower Bounds for Continuous Non-Malleable Codes. | Dana Dachman-Soled, Mukul Kulkarni |
| 2019 | PQCrypto | Constant-Round Group Key Exchange from the Ring-LWE Assumption. | Daniel Apon, Dana Dachman-Soled, Huijing Gong, Jonathan Katz |
| 2018 | EuroCrypt | Non-malleable Codes from Average-Case Hardness: $${\mathsf {A}}{\mathsf {C}}^0$$ , Decision Trees, and Streaming Space-Bounded Tampering. | Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin |
| 2018 | FOCS | Non-Malleable Codes for Small-Depth Circuits. | Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan |
| 2018 | PKC | Local Non-malleable Codes in the Bounded Retrieval Model. | Dana Dachman-Soled, Mukul Kulkarni, Aria Shahverdi |
| 2017 | PKC | Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes. | Dana Dachman-Soled, Mukul Kulkarni, Aria Shahverdi |
| 2016 | EuroCrypt | Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits. | Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin |
| 2016 | EuroCrypt | 10-Round Feistel is Indifferentiable from an Ideal Cipher. | Dana Dachman-Soled, Jonathan Katz, Aishwarya Thiruvengadam |
| 2016 | PKC | Leakage-Resilient Public-Key Encryption from Obfuscation. | Dana Dachman-Soled, S. Dov Gordon, Feng-Hao Liu, Adam O'Neill, Hong-Sheng Zhou |
| 2016 | TCC | Towards Non-Black-Box Separations of Public Key Encryption and One Way Function. | Dana Dachman-Soled |
| 2015 | ASIACRYPT | Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness. | Dana Dachman-Soled, Chang Liu, Charalampos Papamanthou, Elaine Shi, Uzi Vishkin |
| 2015 | EuroCrypt | Leakage-Resilient Circuits Revisited - Optimal Number of Computing Components Without Leak-Free Hardware. | Dana Dachman-Soled, Feng-Hao Liu, Hong-Sheng Zhou |
| 2015 | SODA | Approximate resilience, monotonicity, and the complexity of agnostic learning. | Dana Dachman-Soled, Vitaly Feldman, Li-Yang Tan, Andrew Wan, Karl Wimmer |
| 2015 | TCC | Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds. | Dana Dachman-Soled, Jonathan Katz, Vanishree Rao |
| 2015 | TCC | Locally Decodable and Updatable Non-malleable Codes and Their Applications. | Dana Dachman-Soled, Feng-Hao Liu, Elaine Shi, Hong-Sheng Zhou |
| 2014 | CRYPTO | Leakage-Tolerant Computation with Input-Independent Preprocessing. | Nir Bitansky, Dana Dachman-Soled, Huijia Lin |
| 2014 | CRYPTO | Feasibility and Infeasibility of Secure Computation with Malicious PUFs. | Dana Dachman-Soled, Nils Fleischhacker, Jonathan Katz, Anna Lysyanskaya, Dominique Schrder |
| 2014 | PKC | A Black-Box Construction of a CCA2 Encryption Scheme from a Plaintext Aware (sPA1) Encryption Scheme. | Dana Dachman-Soled |
| 2014 | PKC | On Minimal Assumptions for Sender-Deniable Public Key Encryption. | Dana Dachman-Soled |
| 2014 | PKC | Enhanced Chosen-Ciphertext Security and Applications. | Dana Dachman-Soled, Georg Fuchsbauer, Payman Mohassel, Adam O'Neill |
| 2014 | TCC | Securing Circuits and Protocols against 1/poly(k) Tampering Rate. | Dana Dachman-Soled, Yael Tauman Kalai |
| 2014 | TCC | Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? | Dana Dachman-Soled, Mohammad Mahmoody, Tal Malkin |
| 2013 | ASIACRYPT | Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments. | Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Muthuramakrishnan Venkitasubramaniam |
| 2013 | TCC | Why "Fiat-Shamir for Proofs" Lacks a Proof. | Nir Bitansky, Dana Dachman-Soled, Sanjam Garg, Abhishek Jain, Yael Tauman Kalai, Adriana Lpez-Alt, Daniel Wichs |
| 2012 | CRYPTO | Securing Circuits against Constant-Rate Tampering. | Dana Dachman-Soled, Yael Tauman Kalai |
| 2012 | PKC | Efficient Password Authenticated Key Exchange via Oblivious Transfer. | Ran Canetti, Dana Dachman-Soled, Vinod Vaikuntanathan, Hoeteck Wee |
| 2012 | SCN | On the Centrality of Off-Line E-Cash to Concrete Partial Information Games. | Seung Geol Choi, Dana Dachman-Soled, Moti Yung |
| 2012 | TCC | Computational Extractors and Pseudorandomness. | Dana Dachman-Soled, Rosario Gennaro, Hugo Krawczyk, Tal Malkin |
| 2011 | ACNS | Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications. | Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Moti Yung |
| 2011 | TCC | On the Black-Box Complexity of Optimally-Fair Coin Tossing. | Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody, Tal Malkin |
| 2009 | ACNS | Efficient Robust Private Set Intersection. | Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Moti Yung |
| 2009 | ASIACRYPT | Improved Non-committing Encryption with Applications to Adaptively Secure Protocols. | Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee |
| 2009 | TCC | Simple, Black-Box Constructions of Adaptively Secure Protocols. | Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee |
| 2008 | ICALP | Optimal Cryptographic Hardness of Learning Monotone Functions. | Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee |
| 2008 | TCC | Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One. | Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee |