Dana Dachman-Soled

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

Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Moti Yung: Efficient robust private set intersection. IJACT 2(4): 289-303 (2012)

Dana Dachman-Soled, Yael Tauman Kalai: Securing Circuits against Constant-Rate Tampering. CRYPTO 2012: 533-551

Ran Canetti, Dana Dachman-Soled, Vinod Vaikuntanathan, Hoeteck Wee: Efficient Password Authenticated Key Exchange via Oblivious Transfer. Public Key Cryptography 2012: 449-466

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

Dana Dachman-Soled, Rosario Gennaro, Hugo Krawczyk, Tal Malkin: Computational Extractors and Pseudorandomness. TCC 2012: 383-403

Dana Dachman-Soled, Yael Tauman Kalai: Securing Circuits Against Constant-Rate Tampering. IACR Cryptology ePrint Archive 2012: 366 (2012)

Dana Dachman-Soled, Georg Fuchsbauer, Payman Mohassel, Adam O'Neill: Enhanced Chosen-Ciphertext Security and Applications. IACR Cryptology ePrint Archive 2012: 543 (2012)

Dana Dachman-Soled, Abhishek Jain, Yael Tauman Kalai, Adriana López-Alt: On the (In)security of the Fiat-Shamir Paradigm, Revisited. IACR Cryptology ePrint Archive 2012: 706 (2012)

Dana Dachman-Soled: On the Impossibility of Sender-Deniable Public Key Encryption. IACR Cryptology ePrint Archive 2012: 727 (2012)

Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Moti Yung: Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications. ACNS 2011: 130-146

Dana Dachman-Soled, Rocco A. Servedio: A Canonical Form for Testing Boolean Function Properties. APPROX-RANDOM 2011: 460-471

Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody, Tal Malkin: On the Black-Box Complexity of Optimally-Fair Coin Tossing. TCC 2011: 450-467

Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Muthuramakrishnan Venkitasubramaniam: Adaptive and Concurrent Secure Computation from New Notions of Non-Malleability. IACR Cryptology ePrint Archive 2011: 611 (2011)

Dana Dachman-Soled, Rosario Gennaro, Hugo Krawczyk, Tal Malkin: Computational Extractors and Pseudorandomness. IACR Cryptology ePrint Archive 2011: 708 (2011)

Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee: Optimal Cryptographic Hardness of Learning Monotone Functions. Theory of Computing 5(1): 257-282 (2009)

Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Moti Yung: Efficient Robust Private Set Intersection. ACNS 2009: 125-142

Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee: Improved Non-committing Encryption with Applications to Adaptively Secure Protocols. ASIACRYPT 2009: 287-302

Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee: Simple, Black-Box Constructions of Adaptively Secure Protocols. TCC 2009: 387-402

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

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