# Dana Dachman-Soled

According to our database

Collaborative distances:

^{1}, Dana Dachman-Soled authored at least 58 papers between 2008 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

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

J. Cryptology, 2020

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

IACR Cryptology ePrint Archive, 2020

2019

Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness.

J. Cryptology, 2019

Leakage Resilience from Program Obfuscation.

J. Cryptology, 2019

TMPS: Ticket-Mediated Password Strengthening.

IACR Cryptology ePrint Archive, 2019

Limits to Non-Malleability.

IACR Cryptology ePrint Archive, 2019

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

IACR Cryptology ePrint Archive, 2019

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

IACR Cryptology ePrint Archive, 2019

Mitigating Reverse Engineering Attacks on Deep Neural Networks.

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.

J. Cryptology, 2018

Upper and Lower Bounds for Continuous Non-Malleable Codes.

IACR Cryptology ePrint Archive, 2018

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

IACR Cryptology ePrint Archive, 2018

Non-Malleable Codes Against Bounded Polynomial Time Tampering.

IACR Cryptology ePrint Archive, 2018

Non-Malleable Codes for Small-Depth Circuits.

Electronic Colloquium on Computational Complexity (ECCC), 2018

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

Des. Codes Cryptogr., 2018

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

CoRR, 2018

Local Non-malleable Codes in the Bounded Retrieval Model.

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.

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.

IACR Cryptology ePrint Archive, 2017

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

IACR Cryptology ePrint Archive, 2017

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

IACR Cryptology ePrint Archive, 2017

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

IACR Cryptology ePrint Archive, 2017

2016

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

IACR Cryptology ePrint Archive, 2016

Leakage-Resilient Public-Key Encryption from Obfuscation.

IACR Cryptology ePrint Archive, 2016

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

IACR Cryptology ePrint Archive, 2016

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

IACR Cryptology ePrint Archive, 2016

Efficient Concurrent Covert Computation of String Equality and Set Intersection.

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.

IACR Cryptology ePrint Archive, 2015

10-Round Feistel is Indifferentiable from an Ideal Cipher.

IACR Cryptology ePrint Archive, 2015

Feasibility and Infeasibility of Secure Computation with Malicious PUFs.

IACR Cryptology ePrint Archive, 2015

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

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

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

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.

IACR Cryptology ePrint Archive, 2014

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

IACR Cryptology ePrint Archive, 2014

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

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

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

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

On Minimal Assumptions for Sender-Deniable Public Key Encryption.

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.

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

Leakage-Tolerant Computation with Input-Independent Preprocessing.

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.

IACR Cryptology ePrint Archive, 2013

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

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

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

Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012

Efficient robust private set intersection.

IJACT, 2012

Securing Circuits Against Constant-Rate Tampering.

IACR Cryptology ePrint Archive, 2012

Enhanced Chosen-Ciphertext Security and Applications.

IACR Cryptology ePrint Archive, 2012

On the Impossibility of Sender-Deniable Public Key Encryption.

IACR Cryptology ePrint Archive, 2012

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

IACR Cryptology ePrint Archive, 2012

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

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

Efficient Password Authenticated Key Exchange via Oblivious Transfer.

Proceedings of the Public Key Cryptography - PKC 2012, 2012

2011

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

IACR Cryptology ePrint Archive, 2011

Computational Extractors and Pseudorandomness.

IACR Cryptology ePrint Archive, 2011

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

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

A Canonical Form for Testing Boolean Function Properties.

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

Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications.

Proceedings of the Applied Cryptography and Network Security, 2011

2009

Optimal Cryptographic Hardness of Learning Monotone Functions.

Theory of Computing, 2009

Simple, Black-Box Constructions of Adaptively Secure Protocols.

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

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

Proceedings of the Advances in Cryptology, 2009

2008

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

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