Dana Dachman-Soled

According to our database, Dana Dachman-Soled authored at least 86 papers between 2007 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Balancing Fairness and Accuracy in Data-Restricted Binary Classification.

Zachary McBride Lazri, Danial Dervovic, Antigoni Polychroniadou, Ivan Brugere, Dana Dachman-Soled, Min Wu

CoRR, 2024

Bounding the Excess Risk for Linear Models Trained on Marginal-Preserving, Differentially-Private, Synthetic Data.

Yvonne Zhou, Mingyu Liang, Ivan Brugere, Dana Dachman-Soled, Danial Dervovic, Antigoni Polychroniadou, Min Wu

CoRR, 2024

2023

On the Privacy of Sublinear-Communication Jaccard Index Estimation via Min-hash Sketching.

Seung Geol Choi, Dana Dachman-Soled, Mingyu Liang, Linsheng Liu, Arkady Yerukhimovich

IACR Cryptol. ePrint Arch., 2023

Extracting Randomness from Samplable Distributions, Revisited.

Marshall Ball, Dana Dachman-Soled, Eli Goldin, Saachi Mutreja

Electron. Colloquium Comput. Complex., 2023

(Inefficient Prover) ZAPs from Hard-to-Invert Functions.

Marshall Ball, Dana Dachman-Soled

Electron. Colloquium Comput. Complex., 2023

A Canonical Data Transformation for Achieving Inter- and Within-group Fairness.

Zachary McBride Lazri, Ivan Brugere, Xin Tian, Dana Dachman-Soled, Antigoni Polychroniadou, Danial Dervovic, Min Wu

CoRR, 2023

Revisiting Security Estimation for LWE with Hints from a Geometric Perspective.

Dana Dachman-Soled, Huijing Gong, Tom Hanson, Hunter Kippen

Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022

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

IACR Cryptol. ePrint Arch., 2022

Breaking RSA Generically is Equivalent to Factoring, with Preprocessing.

Dana Dachman-Soled, Julian Loss, Adam O'Neill, Nikki Sigurdson

IACR Cryptol. ePrint Arch., 2022

Refined Security Estimation for LWE with Hints via a Geometric Approach.

Dana Dachman-Soled, Huijing Gong, Tom Hanson, Hunter Kippen

IACR Cryptol. ePrint Arch., 2022

Secure Sampling with Sublinear Communication.

Dana Dachman-Soled, Seung Geol Choi, S. Dov Gordon, Linsheng Liu, Arkady Yerukhimovich

IACR Cryptol. ePrint Arch., 2022

(Nondeterministic) Hardness vs. Non-Malleability.

Marshall Ball, Dana Dachman-Soled, Julian Loss

Electron. Colloquium Comput. Complex., 2022

2021

Towards a Ring Analogue of the Leftover Hash Lemma.

Dana Dachman-Soled, Huijing Gong, Mukul Kulkarni, Aria Shahverdi

J. Math. Cryptol., 2021

(In)Security of Ring-LWE Under Partial Key Exposure.

Dana Dachman-Soled, Huijing Gong, Mukul Kulkarni, Aria Shahverdi

J. Math. Cryptol., 2021

BKW Meets Fourier: New Algorithms for LPN with Sparse Parities.

Dana Dachman-Soled, Huijing Gong, Hunter Kippen, Aria Shahverdi

IACR Cryptol. ePrint Arch., 2021

Compressed Oblivious Encoding for Homomorphically Encrypted Search.

Seung Geol Choi, Dana Dachman-Soled, S. Dov Gordon, Linsheng Liu, Arkady Yerukhimovich

IACR Cryptol. ePrint Arch., 2021

Database Reconstruction from Noisy Volumes: A Cache Side-Channel Attack on SQLite.

Aria Shahverdi, Mahammad Shirinov, Dana Dachman-Soled

Proceedings of the 30th USENIX Security Symposium, 2021

Non-malleable Codes for Bounded Parallel-Time Tampering.

Dana Dachman-Soled, Ilan Komargodski, Rafael Pass

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020

Differentially-Private Multi-Party Sketching for Large-Scale Statistics.

Seung Geol Choi, Dana Dachman-Soled, Mukul Kulkarni, Arkady Yerukhimovich

Proc. Priv. Enhancing Technol., 2020

Locally Decodable and Updatable Non-malleable Codes and Their Applications.

Dana Dachman-Soled, Feng-Hao Liu, Elaine Shi, Hong-Sheng Zhou

J. Cryptol., 2020

Feasibility and Infeasibility of Secure Computation with Malicious PUFs.

Dana Dachman-Soled, Nils Fleischhacker, Jonathan Katz, Anna Lysyanskaya, Dominique Schröder

J. Cryptol., 2020

Non-Malleable Codes for Bounded Polynomial Depth Tampering.

Dana Dachman-Soled, Ilan Komargodski, Rafael Pass

IACR Cryptol. ePrint Arch., 2020

LWE with Side Information: Attacks and Concrete Security Estimation.

Dana Dachman-Soled, Léo Ducas, Huijing Gong, Mélissa Rossi

IACR Cryptol. ePrint Arch., 2020

Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures.

Dana Dachman-Soled

IACR Cryptol. ePrint Arch., 2020

Transparency Tools for Fairness in AI (Luskin).

Mingliang Chen, Aria Shahverdi, Sarah Anderson, Se Yong Park, Justin Zhang, Dana Dachman-Soled, Kristin E. Lauter, Min Wu

CoRR, 2020

How to 0wn the NAS in Your Spare Time.

Sanghyun Hong, Michael Davinroy, Yigitcan Kaya, Dana Dachman-Soled, Tudor Dumitras

Proceedings of the 8th International Conference on Learning Representations, 2020

New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust.

Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019

Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness.

Dana Dachman-Soled, Chang Liu, Charalampos Papamanthou, Elaine Shi, Uzi Vishkin

J. Cryptol., 2019

Leakage Resilience from Program Obfuscation.

Dana Dachman-Soled, S. Dov Gordon, Feng-Hao Liu, Adam O'Neill, Hong-Sheng Zhou

J. Cryptol., 2019

TMPS: Ticket-Mediated Password Strengthening.

John Kelsey, Dana Dachman-Soled, Sweta Mishra, Meltem Sönmez Turan

IACR Cryptol. ePrint Arch., 2019

Limits to Non-Malleability.

Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin

IACR Cryptol. ePrint Arch., 2019

New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions and Interaction.

Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni

IACR Cryptol. ePrint Arch., 2019

Constant-Round Group Key Exchange from the Ring-LWE Assumption.

Daniel Apon, Dana Dachman-Soled, Huijing Gong, Jonathan Katz

IACR Cryptol. ePrint Arch., 2019

Mitigating Reverse Engineering Attacks on Deep Neural Networks.

Yuntao Liu, Dana Dachman-Soled, Ankur Srivastava

Proceedings of the 2019 IEEE Computer Society Annual Symposium on VLSI, 2019

2018

A Black-Box Construction of Non-malleable Encryption from Semantically Secure Encryption.

Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee

J. Cryptol., 2018

Upper and Lower Bounds for Continuous Non-Malleable Codes.

Dana Dachman-Soled, Mukul Kulkarni

IACR Cryptol. ePrint Arch., 2018

Partial Key Exposure in Ring-LWE-Based Cryptosystems: Attacks and Resilience.

Dana Dachman-Soled, Huijing Gong, Mukul Kulkarni, Aria Shahverdi

IACR Cryptol. ePrint Arch., 2018

Non-Malleable Codes Against Bounded Polynomial Time Tampering.

Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Huijia Lin, Tal Malkin

IACR Cryptol. ePrint Arch., 2018

Non-Malleable Codes for Small-Depth Circuits.

Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan

Electron. Colloquium Comput. Complex., 2018

Improved, black-box, non-malleable encryption from semantic security.

Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee

Des. Codes Cryptogr., 2018

Security Analysis of Deep Neural Networks Operating in the Presence of Cache Side-Channel Attacks.

Sanghyun Hong, Michael Davinroy, Yigitcan Kaya, Stuart Nevans Locke, Ian Rackow, Kevin Kulda, Dana Dachman-Soled, Tudor Dumitras

CoRR, 2018

Local Non-malleable Codes in the Bounded Retrieval Model.

Dana Dachman-Soled, Mukul Kulkarni, Aria Shahverdi

Proceedings of the Public-Key Cryptography - PKC 2018, 2018

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

Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

2017

Locally Decodable and Updatable Non-Malleable Codes in the Bounded Retrieval Model.

Dana Dachman-Soled, Mukul Kulkarni, Aria Shahverdi

IACR Cryptol. ePrint Arch., 2017

Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-Malleable Codes.

Dana Dachman-Soled, Mukul Kulkarni, Aria Shahverdi

IACR Cryptol. ePrint Arch., 2017

On the Leakage Resilience of Ideal-Lattice Based Public Key Encryption.

Dana Dachman-Soled, Huijing Gong, Mukul Kulkarni, Aria Shahverdi

IACR Cryptol. ePrint Arch., 2017

Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering.

Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin

IACR Cryptol. ePrint Arch., 2017

2016

Towards a Characterization of the Related-Key Attack Security of the Iterated Even-Mansour Cipher.

Dana Dachman-Soled, Angela Park, Ben San Nicolas

IACR Cryptol. ePrint Arch., 2016

Leakage-Resilient Public-Key Encryption from Obfuscation.

Dana Dachman-Soled, S. Dov Gordon, Feng-Hao Liu, Adam O'Neill, Hong-Sheng Zhou

IACR Cryptol. ePrint Arch., 2016

Towards Non-Black-Box Separations of Public Key Encryption and One Way Function.

Dana Dachman-Soled

IACR Cryptol. ePrint Arch., 2016

Non-Malleable Codes for Bounded Depth, Bounded Fan-in Circuits.

Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin

IACR Cryptol. ePrint Arch., 2016

Efficient Concurrent Covert Computation of String Equality and Set Intersection.

Chongwon Cho, Dana Dachman-Soled, Stanislaw Jarecki

Proceedings of the Topics in Cryptology - CT-RSA 2016 - The Cryptographers' Track at the RSA Conference 2016, San Francisco, CA, USA, February 29, 2016

2015

Oblivious Network RAM.

Dana Dachman-Soled, Chang Liu, Charalampos Papamanthou, Elaine Shi, Uzi Vishkin

IACR Cryptol. ePrint Arch., 2015

10-Round Feistel is Indifferentiable from an Ideal Cipher.

Dana Dachman-Soled, Jonathan Katz, Aishwarya Thiruvengadam

IACR Cryptol. ePrint Arch., 2015

Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds.

Dana Dachman-Soled, Jonathan Katz, Vanishree Rao

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Approximate resilience, monotonicity, and the complexity of agnostic learning.

Dana Dachman-Soled, Vitaly Feldman, Li-Yang Tan, Andrew Wan, Karl Wimmer

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Leakage-Resilient Circuits Revisited - Optimal Number of Computing Components without Leak-free Hardware.

Dana Dachman-Soled, Feng-Hao Liu, Hong-Sheng Zhou

IACR Cryptol. ePrint Arch., 2014

Adaptively Secure, Universally Composable, Multi-Party Computation in Constant Rounds.

Dana Dachman-Soled, Jonathan Katz, Vanishree Rao

IACR Cryptol. ePrint Arch., 2014

Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?

Dana Dachman-Soled, Mohammad Mahmoody, Tal Malkin

Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Securing Circuits and Protocols against 1/poly(k) Tampering Rate.

Dana Dachman-Soled, Yael Tauman Kalai

Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

On Minimal Assumptions for Sender-Deniable Public Key Encryption.

Dana Dachman-Soled

Proceedings of the Public-Key Cryptography - PKC 2014, 2014

A Black-Box Construction of a CCA2 Encryption Scheme from a Plaintext Aware (sPA1) Encryption Scheme.

Dana Dachman-Soled

Proceedings of the Public-Key Cryptography - PKC 2014, 2014

Leakage-Tolerant Computation with Input-Independent Preprocessing.

Nir Bitansky, Dana Dachman-Soled, Huijia Lin

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013

A Black-Box Construction of a CCA2 Encryption Scheme from a Plaintext Aware Encryption Scheme.

Dana Dachman-Soled

IACR Cryptol. ePrint Arch., 2013

Why "Fiat-Shamir for Proofs" Lacks a Proof.

Nir Bitansky, Dana Dachman-Soled, Sanjam Garg, Abhishek Jain, Yael Tauman Kalai, Adriana López-Alt, Daniel Wichs

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments.

Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Muthuramakrishnan Venkitasubramaniam

Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012

Efficient robust private set intersection.

Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Moti Yung

Int. J. Appl. Cryptogr., 2012

Securing Circuits Against Constant-Rate Tampering.

Dana Dachman-Soled, Yael Tauman Kalai

IACR Cryptol. ePrint Arch., 2012

Enhanced Chosen-Ciphertext Security and Applications.

Dana Dachman-Soled, Georg Fuchsbauer, Payman Mohassel, Adam O'Neill

IACR Cryptol. ePrint Arch., 2012

On the Impossibility of Sender-Deniable Public Key Encryption.

Dana Dachman-Soled

IACR Cryptol. ePrint Arch., 2012

On the (In)security of the Fiat-Shamir Paradigm, Revisited.

Dana Dachman-Soled, Abhishek Jain, Yael Tauman Kalai, Adriana López-Alt

IACR Cryptol. ePrint Arch., 2012

On the Centrality of Off-Line E-Cash to Concrete Partial Information Games.

Seung Geol Choi, Dana Dachman-Soled, Moti Yung

Proceedings of the Security and Cryptography for Networks - 8th International Conference, 2012

Efficient Password Authenticated Key Exchange via Oblivious Transfer.

Ran Canetti, Dana Dachman-Soled, Vinod Vaikuntanathan, Hoeteck Wee

Proceedings of the Public Key Cryptography - PKC 2012, 2012

2011

On Black-Box Complexity and Adaptive, Universal Composability of Cryptographic Tasks.

Dana Dachman-Soled

PhD thesis, 2011

Adaptive and Concurrent Secure Computation from New Notions of Non-Malleability.

Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Muthuramakrishnan Venkitasubramaniam

IACR Cryptol. ePrint Arch., 2011

Computational Extractors and Pseudorandomness.

Dana Dachman-Soled, Rosario Gennaro, Hugo Krawczyk, Tal Malkin

IACR Cryptol. ePrint Arch., 2011

On the Black-Box Complexity of Optimally-Fair Coin Tossing.

Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody, Tal Malkin

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

A Canonical Form for Testing Boolean Function Properties.

Dana Dachman-Soled, Rocco A. Servedio

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications.

Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Moti Yung

Proceedings of the Applied Cryptography and Network Security, 2011

2009

Distribution-Free Testing Lower Bound for Basic Boolean Functions.

Dana Glasner, Rocco A. Servedio

Theory Comput., 2009

Optimal Cryptographic Hardness of Learning Monotone Functions.

Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee

Theory Comput., 2009

Simple, Black-Box Constructions of Adaptively Secure Protocols.

Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Improved Non-committing Encryption with Applications to Adaptively Secure Protocols.

Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee

Proceedings of the Advances in Cryptology, 2009

2008

Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One.

Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

2007

Distribution-Free Testing Lower Bounds for Basic Boolean Functions.

Dana Glasner, Rocco A. Servedio

Proceedings of the Approximation, 2007

Configuration Reasoning and Ontology ForWeb.

Dana Glasner, Vugranam C. Sreedhar

Proceedings of the 2007 IEEE International Conference on Services Computing (SCC 2007), 2007