Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDana Dachman-Soled
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[c52]Michael Fahr, Hunter Kippen, Andrew Kwong, Thinh Dang, Jacob Lichtinger, Dana Dachman-Soled, Daniel Genkin, Alexander Nelson, Ray A. Perlner, Arkady Yerukhimovich, Daniel Apon:
When Frodo Flips: End-to-End Key Recovery on FrodoKEM via Rowhammer. CCS 2022: 979-993- [c51]Marshall Ball
, Dana Dachman-Soled, Julian Loss:
(Nondeterministic) Hardness vs. Non-malleability. CRYPTO (1) 2022: 148-177 - [c50]Seung Geol Choi, Dana Dachman-Soled, S. Dov Gordon, Linsheng Liu, Arkady Yerukhimovich:
Secure Sampling with Sublinear Communication. TCC (2) 2022: 348-377 - [e1]Dana Dachman-Soled:
3rd Conference on Information-Theoretic Cryptography, ITC 2022, July 5-7, 2022, Cambridge, MA, USA. LIPIcs 230, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-238-9 [contents] - [i51]Marshall Ball, Dana Dachman-Soled, Julian Loss:
(Nondeterministic) Hardness vs. Non-Malleability. Electron. Colloquium Comput. Complex. TR22 (2022) - [i50]Marshall Ball, Dana Dachman-Soled, Julian Loss:
(Nondeterministic) Hardness vs. Non-Malleability. IACR Cryptol. ePrint Arch. 2022: 70 (2022) - [i49]Dana Dachman-Soled, Seung Geol Choi, S. Dov Gordon, Linsheng Liu, Arkady Yerukhimovich:
Secure Sampling with Sublinear Communication. IACR Cryptol. ePrint Arch. 2022: 660 (2022) - [i48]Michael Fahr, Hunter Kippen, Andrew Kwong, Thinh Dang, Jacob Lichtinger, Dana Dachman-Soled, Daniel Genkin, Alexander Nelson, Ray A. Perlner, Arkady Yerukhimovich, Daniel Apon:
When Frodo Flips: End-to-End Key Recovery on FrodoKEM via Rowhammer. IACR Cryptol. ePrint Arch. 2022: 952 (2022) - [i47]Dana Dachman-Soled, Julian Loss, Adam O'Neill, Nikki Sigurdson:
Breaking RSA Generically is Equivalent to Factoring, with Preprocessing. IACR Cryptol. ePrint Arch. 2022: 1261 (2022) - [i46]Dana Dachman-Soled, Huijing Gong, Tom Hanson, Hunter Kippen:
Refined Security Estimation for LWE with Hints via a Geometric Approach. IACR Cryptol. ePrint Arch. 2022: 1345 (2022) - 2021
- [j12]Dana Dachman-Soled, Huijing Gong, Mukul Kulkarni, Aria Shahverdi:
(In)Security of Ring-LWE Under Partial Key Exposure. J. Math. Cryptol. 15(1): 72-86 (2021) - [j11]Dana Dachman-Soled, Huijing Gong, Mukul Kulkarni, Aria Shahverdi:
Towards a Ring Analogue of the Leftover Hash Lemma. J. Math. Cryptol. 15(1): 87-110 (2021) - [c49]Seung Geol Choi, Dana Dachman-Soled, S. Dov Gordon, Linsheng Liu, Arkady Yerukhimovich:
Compressed Oblivious Encoding for Homomorphically Encrypted Search. CCS 2021: 2277-2291 - [c48]Dana Dachman-Soled, Ilan Komargodski, Rafael Pass:
Non-malleable Codes for Bounded Parallel-Time Tampering. CRYPTO (3) 2021: 535-565 - [c47]Dana Dachman-Soled, Huijing Gong, Hunter Kippen, Aria Shahverdi:
BKW Meets Fourier New Algorithms for LPN with Sparse Parities. TCC (2) 2021: 658-688 - [c46]Aria Shahverdi, Mahammad Shirinov, Dana Dachman-Soled:
Database Reconstruction from Noisy Volumes: A Cache Side-Channel Attack on SQLite. USENIX Security Symposium 2021: 1019-1035 - [i45]Seung Geol Choi, Dana Dachman-Soled, S. Dov Gordon, Linsheng Liu, Arkady Yerukhimovich:
Compressed Oblivious Encoding for Homomorphically Encrypted Search. CoRR abs/2109.07708 (2021) - [i44]Dana Dachman-Soled, Huijing Gong, Hunter Kippen, Aria Shahverdi:
BKW Meets Fourier: New Algorithms for LPN with Sparse Parities. IACR Cryptol. ePrint Arch. 2021: 994 (2021) - [i43]Seung Geol Choi, Dana Dachman-Soled, S. Dov Gordon, Linsheng Liu, Arkady Yerukhimovich:
Compressed Oblivious Encoding for Homomorphically Encrypted Search. IACR Cryptol. ePrint Arch. 2021: 1199 (2021) - 2020
- [j10]Dana Dachman-Soled, Feng-Hao Liu, Elaine Shi, Hong-Sheng Zhou:
Locally Decodable and Updatable Non-malleable Codes and Their Applications. J. Cryptol. 33(1): 319-355 (2020) - [j9]Dana Dachman-Soled, Nils Fleischhacker, Jonathan Katz, Anna Lysyanskaya, Dominique Schröder:
Feasibility and Infeasibility of Secure Computation with Malicious PUFs. J. Cryptol. 33(2): 595-617 (2020) - [j8]Seung Geol Choi, Dana Dachman-Soled, Mukul Kulkarni, Arkady Yerukhimovich:
Differentially-Private Multi-Party Sketching for Large-Scale Statistics. Proc. Priv. Enhancing Technol. 2020(3): 153-174 (2020) - [c45]Dana Dachman-Soled, Léo Ducas, Huijing Gong, Mélissa Rossi:
LWE with Side Information: Attacks and Concrete Security Estimation. CRYPTO (2) 2020: 329-358 - [c44]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni:
New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust. CRYPTO (3) 2020: 674-703 - [c43]John Kelsey, Dana Dachman-Soled, Sweta Mishra, Meltem Sönmez Turan:
TMPS: Ticket-Mediated Password Strengthening. CT-RSA 2020: 225-253 - [c42]Sanghyun Hong, Michael Davinroy, Yigitcan Kaya, Dana Dachman-Soled, Tudor Dumitras:
How to 0wn the NAS in Your Spare Time. ICLR 2020 - [c41]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin:
Limits to Non-Malleability. ITCS 2020: 80:1-80:32 - [c40]Dana Dachman-Soled:
Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures. TCC (2) 2020: 595-620 - [i42]Sanghyun Hong, Michael Davinroy, Yigitcan Kaya, Dana Dachman-Soled, Tudor Dumitras:
How to 0wn NAS in Your Spare Time. CoRR abs/2002.06776 (2020) - [i41]Aria Shahverdi, Mahammad Shirinov, Dana Dachman-Soled:
Database Reconstruction from Noisy Volumes: A Cache Side-Channel Attack on SQLite. CoRR abs/2006.15007 (2020) - [i40]Mingliang Chen, Aria Shahverdi, Sarah Anderson, Se Yong Park, Justin Zhang, Dana Dachman-Soled, Kristin E. Lauter, Min Wu:
Transparency Tools for Fairness in AI (Luskin). CoRR abs/2007.04484 (2020) - [i39]Seung Geol Choi, Dana Dachman-Soled, Mukul Kulkarni, Arkady Yerukhimovich:
Differentially-Private Multi-Party Sketching for Large-Scale Statistics. IACR Cryptol. ePrint Arch. 2020: 29 (2020) - [i38]Dana Dachman-Soled, Léo Ducas, Huijing Gong, Mélissa Rossi:
LWE with Side Information: Attacks and Concrete Security Estimation. IACR Cryptol. ePrint Arch. 2020: 292 (2020) - [i37]Dana Dachman-Soled, Ilan Komargodski, Rafael Pass:
Non-Malleable Codes for Bounded Polynomial Depth Tampering. IACR Cryptol. ePrint Arch. 2020: 776 (2020) - [i36]Dana Dachman-Soled:
Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures. IACR Cryptol. ePrint Arch. 2020: 1430 (2020)
2010 – 2019
- 2019
- [j7]Dana Dachman-Soled, Mukul Kulkarni, Aria Shahverdi:
Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes. Inf. Comput. 268 (2019) - [j6]Dana Dachman-Soled, S. Dov Gordon, Feng-Hao Liu, Adam O'Neill, Hong-Sheng Zhou:
Leakage Resilience from Program Obfuscation. J. Cryptol. 32(3): 742-824 (2019) - [j5]Dana Dachman-Soled, Chang Liu, Charalampos Papamanthou, Elaine Shi, Uzi Vishkin:
Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness. J. Cryptol. 32(3): 941-972 (2019) - [c39]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Huijia Lin, Tal Malkin:
Non-Malleable Codes Against Bounded Polynomial Time Tampering. EUROCRYPT (1) 2019: 501-530 - [c38]Yuntao Liu, Dana Dachman-Soled, Ankur Srivastava:
Mitigating Reverse Engineering Attacks on Deep Neural Networks. ISVLSI 2019: 657-662 - [c37]Dana Dachman-Soled, Mukul Kulkarni:
Upper and Lower Bounds for Continuous Non-Malleable Codes. Public Key Cryptography (1) 2019: 519-548 - [c36]Daniel Apon, Dana Dachman-Soled, Huijing Gong, Jonathan Katz:
Constant-Round Group Key Exchange from the Ring-LWE Assumption. PQCrypto 2019: 189-205 - [i35]Daniel Apon, Dana Dachman-Soled, Huijing Gong, Jonathan Katz:
Constant-Round Group Key Exchange from the Ring-LWE Assumption. IACR Cryptol. ePrint Arch. 2019: 398 (2019) - [i34]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin:
Limits to Non-Malleability. IACR Cryptol. ePrint Arch. 2019: 449 (2019) - [i33]John Kelsey, Dana Dachman-Soled, Sweta Mishra, Meltem Sönmez Turan:
TMPS: Ticket-Mediated Password Strengthening. IACR Cryptol. ePrint Arch. 2019: 543 (2019) - [i32]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni:
New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions and Interaction. IACR Cryptol. ePrint Arch. 2019: 1464 (2019) - 2018
- [j4]Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee:
Improved, black-box, non-malleable encryption from semantic security. Des. Codes Cryptogr. 86(3): 641-663 (2018) - [j3]Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee:
A Black-Box Construction of Non-malleable Encryption from Semantically Secure Encryption. J. Cryptol. 31(1): 172-201 (2018) - [c35]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin:
Non-malleable Codes from Average-Case Hardness: $${\mathsf {A}}{\mathsf {C}}^0$$ , Decision Trees, and Streaming Space-Bounded Tampering. EUROCRYPT (3) 2018: 618-650 - [c34]Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan:
Non-Malleable Codes for Small-Depth Circuits. FOCS 2018: 826-837 - [c33]Dana Dachman-Soled, Mukul Kulkarni, Aria Shahverdi:
Local Non-malleable Codes in the Bounded Retrieval Model. Public Key Cryptography (2) 2018: 281-311 - [i31]Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan:
Non-Malleable Codes for Small-Depth Circuits. CoRR abs/1802.07673 (2018) - [i30]Sanghyun Hong, Michael Davinroy, Yigitcan Kaya, Stuart Nevans Locke, Ian Rackow, Kevin Kulda, Dana Dachman-Soled, Tudor Dumitras:
Security Analysis of Deep Neural Networks Operating in the Presence of Cache Side-Channel Attacks. CoRR abs/1810.03487 (2018) - [i29]Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan:
Non-Malleable Codes for Small-Depth Circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - [i28]Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan:
Non-Malleable Codes for Small-Depth Circuits. IACR Cryptol. ePrint Arch. 2018: 207 (2018) - [i27]Dana Dachman-Soled, Mukul Kulkarni:
Upper and Lower Bounds for Continuous Non-Malleable Codes. IACR Cryptol. ePrint Arch. 2018: 517 (2018) - [i26]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Huijia Lin, Tal Malkin:
Non-Malleable Codes Against Bounded Polynomial Time Tampering. IACR Cryptol. ePrint Arch. 2018: 1015 (2018) - [i25]Dana Dachman-Soled, Huijing Gong, Mukul Kulkarni, Aria Shahverdi:
Partial Key Exposure in Ring-LWE-Based Cryptosystems: Attacks and Resilience. IACR Cryptol. ePrint Arch. 2018: 1068 (2018) - 2017
- [c32]Dana Dachman-Soled, Mukul Kulkarni, Aria Shahverdi:
Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes. Public Key Cryptography (1) 2017: 310-332 - [i24]Dana Dachman-Soled, Mukul Kulkarni, Aria Shahverdi:
Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-Malleable Codes. IACR Cryptol. ePrint Arch. 2017: 15 (2017) - [i23]Dana Dachman-Soled, Mukul Kulkarni, Aria Shahverdi:
Locally Decodable and Updatable Non-Malleable Codes in the Bounded Retrieval Model. IACR Cryptol. ePrint Arch. 2017: 303 (2017) - [i22]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin:
Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering. IACR Cryptol. ePrint Arch. 2017: 1061 (2017) - [i21]Dana Dachman-Soled, Huijing Gong, Mukul Kulkarni, Aria Shahverdi:
On the Leakage Resilience of Ideal-Lattice Based Public Key Encryption. IACR Cryptol. ePrint Arch. 2017: 1127 (2017) - 2016
- [c31]Chongwon Cho, Dana Dachman-Soled, Stanislaw Jarecki:
Efficient Concurrent Covert Computation of String Equality and Set Intersection. CT-RSA 2016: 164-179 - [c30]Dana Dachman-Soled, Jonathan Katz, Aishwarya Thiruvengadam:
10-Round Feistel is Indifferentiable from an Ideal Cipher. EUROCRYPT (2) 2016: 649-678 - [c29]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin:
Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits. EUROCRYPT (2) 2016: 881-908 - [c28]Dana Dachman-Soled, S. Dov Gordon, Feng-Hao Liu, Adam O'Neill, Hong-Sheng Zhou:
Leakage-Resilient Public-Key Encryption from Obfuscation. Public Key Cryptography (2) 2016: 101-128 - [c27]Dana Dachman-Soled:
Towards Non-Black-Box Separations of Public Key Encryption and One Way Function. TCC (B2) 2016: 169-191 - [i20]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin:
Non-Malleable Codes for Bounded Depth, Bounded Fan-in Circuits. IACR Cryptol. ePrint Arch. 2016: 307 (2016) - [i19]Dana Dachman-Soled, Angela Park, Ben San Nicolas:
Towards a Characterization of the Related-Key Attack Security of the Iterated Even-Mansour Cipher. IACR Cryptol. ePrint Arch. 2016: 707 (2016) - [i18]Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee:
A Black-Box Construction of Non-Malleable Encryption from Semantically Secure Encryption. IACR Cryptol. ePrint Arch. 2016: 720 (2016) - [i17]Dana Dachman-Soled, S. Dov Gordon, Feng-Hao Liu, Adam O'Neill, Hong-Sheng Zhou:
Leakage-Resilient Public-Key Encryption from Obfuscation. IACR Cryptol. ePrint Arch. 2016: 730 (2016) - [i16]Dana Dachman-Soled:
Towards Non-Black-Box Separations of Public Key Encryption and One Way Function. IACR Cryptol. ePrint Arch. 2016: 812 (2016) - [i15]Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee:
Improved, Black-Box, Non-Malleable Encryption from Semantic Security. IACR Cryptol. ePrint Arch. 2016: 842 (2016) - 2015
- [c26]Dana Dachman-Soled, Chang Liu, Charalampos Papamanthou, Elaine Shi, Uzi Vishkin:
Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness. ASIACRYPT (1) 2015: 337-359 - [c25]Dana Dachman-Soled, Feng-Hao Liu, Hong-Sheng Zhou:
Leakage-Resilient Circuits Revisited - Optimal Number of Computing Components Without Leak-Free Hardware. EUROCRYPT (2) 2015: 131-158 - [c24]Dana Dachman-Soled, Vitaly Feldman, Li-Yang Tan, Andrew Wan, Karl Wimmer:
Approximate resilience, monotonicity, and the complexity of agnostic learning. SODA 2015: 498-511 - [c23]Dana Dachman-Soled, Feng-Hao Liu, Elaine Shi, Hong-Sheng Zhou:
Locally Decodable and Updatable Non-malleable Codes and Their Applications. TCC (1) 2015: 427-450 - [c22]Dana Dachman-Soled, Jonathan Katz, Vanishree Rao:
Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds. TCC (2) 2015: 586-613 - [i14]Dana Dachman-Soled, Chang Liu, Charalampos Papamanthou, Elaine Shi, Uzi Vishkin:
Oblivious Network RAM. IACR Cryptol. ePrint Arch. 2015: 73 (2015) - [i13]Dana Dachman-Soled, Nils Fleischhacker, Jonathan Katz, Anna Lysyanskaya, Dominique Schröder:
Feasibility and Infeasibility of Secure Computation with Malicious PUFs. IACR Cryptol. ePrint Arch. 2015: 405 (2015) - [i12]Dana Dachman-Soled, Jonathan Katz, Aishwarya Thiruvengadam:
10-Round Feistel is Indifferentiable from an Ideal Cipher. IACR Cryptol. ePrint Arch. 2015: 876 (2015) - 2014
- [c21]Nir Bitansky, Dana Dachman-Soled, Huijia Lin:
Leakage-Tolerant Computation with Input-Independent Preprocessing. CRYPTO (2) 2014: 146-163 - [c20]Dana Dachman-Soled, Nils Fleischhacker, Jonathan Katz, Anna Lysyanskaya, Dominique Schröder:
Feasibility and Infeasibility of Secure Computation with Malicious PUFs. CRYPTO (2) 2014: 405-420 - [c19]Dana Dachman-Soled:
A Black-Box Construction of a CCA2 Encryption Scheme from a Plaintext Aware (sPA1) Encryption Scheme. Public Key Cryptography 2014: 37-55 - [c18]Dana Dachman-Soled, Georg Fuchsbauer, Payman Mohassel, Adam O'Neill:
Enhanced Chosen-Ciphertext Security and Applications. Public Key Cryptography 2014: 329-344 - [c17]Dana Dachman-Soled:
On Minimal Assumptions for Sender-Deniable Public Key Encryption. Public Key Cryptography 2014: 574-591 - [c16]Dana Dachman-Soled, Mohammad Mahmoody, Tal Malkin:
Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? TCC 2014: 217-239 - [c15]Dana Dachman-Soled, Yael Tauman Kalai:
Securing Circuits and Protocols against 1/poly(k) Tampering Rate. TCC 2014: 540-565 - [i11]Dana Dachman-Soled, Vitaly Feldman, Li-Yang Tan, Andrew Wan, Karl Wimmer:
Approximate resilience, monotonicity, and the complexity of agnostic learning. CoRR abs/1405.5268 (2014) - [i10]Dana Dachman-Soled, Feng-Hao Liu, Elaine Shi, Hong-Sheng Zhou:
Locally Decodable and Updatable Non-Malleable Codes and Their Applications. IACR Cryptol. ePrint Arch. 2014: 663 (2014) - [i9]Dana Dachman-Soled, Feng-Hao Liu, Hong-Sheng Zhou:
Leakage-Resilient Circuits Revisited - Optimal Number of Computing Components without Leak-free Hardware. IACR Cryptol. ePrint Arch. 2014: 856 (2014) - [i8]Dana Dachman-Soled, Jonathan Katz, Vanishree Rao:
Adaptively Secure, Universally Composable, Multi-Party Computation in Constant Rounds. IACR Cryptol. ePrint Arch. 2014: 858 (2014) - 2013
- [c14]Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Muthuramakrishnan Venkitasubramaniam:
Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments. ASIACRYPT (1) 2013: 316-336 - [c13]Nir Bitansky, Dana Dachman-Soled, Sanjam Garg, Abhishek Jain, Yael Tauman Kalai, Adriana López-Alt, Daniel Wichs:
Why "Fiat-Shamir for Proofs" Lacks a Proof. TCC 2013: 182-201 - [i7]Dana Dachman-Soled:
A Black-Box Construction of a CCA2 Encryption Scheme from a Plaintext Aware Encryption Scheme. IACR Cryptol. ePrint Arch. 2013: 680 (2013) - 2012
- [j2]Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Moti Yung:
Efficient robust private set intersection. Int. J. Appl. Cryptogr. 2(4): 289-303 (2012) - [c12]Dana Dachman-Soled, Yael Tauman Kalai:
Securing Circuits against Constant-Rate Tampering. CRYPTO 2012: 533-551 - [c11]Ran Canetti, Dana Dachman-Soled, Vinod Vaikuntanathan, Hoeteck Wee:
Efficient Password Authenticated Key Exchange via Oblivious Transfer. Public Key Cryptography 2012: 449-466 - [c10]Seung Geol Choi, Dana Dachman-Soled, Moti Yung:
On the Centrality of Off-Line E-Cash to Concrete Partial Information Games. SCN 2012: 264-280 - [c9]Dana Dachman-Soled, Rosario Gennaro, Hugo Krawczyk, Tal Malkin:
Computational Extractors and Pseudorandomness. TCC 2012: 383-403 - [i6]Dana Dachman-Soled, Yael Tauman Kalai:
Securing Circuits Against Constant-Rate Tampering. IACR Cryptol. ePrint Arch. 2012: 366 (2012) - [i5]Dana Dachman-Soled, Georg Fuchsbauer, Payman Mohassel, Adam O'Neill:
Enhanced Chosen-Ciphertext Security and Applications. IACR Cryptol. ePrint Arch. 2012: 543 (2012) - [i4]Dana Dachman-Soled, Abhishek Jain, Yael Tauman Kalai, Adriana López-Alt:
On the (In)security of the Fiat-Shamir Paradigm, Revisited. IACR Cryptol. ePrint Arch. 2012: 706 (2012) - [i3]Dana Dachman-Soled:
On the Impossibility of Sender-Deniable Public Key Encryption. IACR Cryptol. ePrint Arch. 2012: 727 (2012) - 2011
- [b1]Dana Dachman-Soled:
On Black-Box Complexity and Adaptive, Universal Composability of Cryptographic Tasks. Columbia University, USA, 2011 - [c8]Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Moti Yung:
Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications. ACNS 2011: 130-146 - [c7]Dana Dachman-Soled, Rocco A. Servedio:
A Canonical Form for Testing Boolean Function Properties. APPROX-RANDOM 2011: 460-471 - [c6]Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody, Tal Malkin:
On the Black-Box Complexity of Optimally-Fair Coin Tossing. TCC 2011: 450-467 - [i2]Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Muthuramakrishnan Venkitasubramaniam:
Adaptive and Concurrent Secure Computation from New Notions of Non-Malleability. IACR Cryptol. ePrint Arch. 2011: 611 (2011) - [i1]Dana Dachman-Soled, Rosario Gennaro, Hugo Krawczyk, Tal Malkin:
Computational Extractors and Pseudorandomness. IACR Cryptol. ePrint Arch. 2011: 708 (2011)
2000 – 2009
- 2009
- [j1]Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee:
Optimal Cryptographic Hardness of Learning Monotone Functions. Theory Comput. 5(1): 257-282 (2009) - [c5]Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Moti Yung:
Efficient Robust Private Set Intersection. ACNS 2009: 125-142 - [c4]Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee:
Improved Non-committing Encryption with Applications to Adaptively Secure Protocols. ASIACRYPT 2009: 287-302 - [c3]Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee:
Simple, Black-Box Constructions of Adaptively Secure Protocols. TCC 2009: 387-402 - 2008
- [c2]Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee:
Optimal Cryptographic Hardness of Learning Monotone Functions. ICALP (1) 2008: 36-47 - [c1]Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee:
Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One. TCC 2008: 427-444
Coauthor Index