Dachman-Soled D, Mahmoody M, Malkin T.  2014.  Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? Theory of Cryptography. :217-239.

Dachman-Soled D.  2014.  On Minimal Assumptions for Sender-Deniable Public Key Encryption. Public-Key Cryptography ? PKC 2014. :574-591.

Dachman-Soled D, Malkin T, Raykova M, Venkitasubramaniam M.  2013.  Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments. Advances in Cryptology - ASIACRYPT 2013. :316-336.

Kamara S, Papamanthou C.  2013.  Parallel and Dynamic Searchable Symmetric Encryption. Financial Cryptography and Data Security. :258-274.

Papamanthou C, Shi E, Tamassia R.  2013.  Signatures of Correct Computation. Theory of Cryptography. :222-242.

Papamanthou C, Shi E, Tamassia R, Yi K.  2013.  Streaming Authenticated Data Structures. Advances in Cryptology ? EUROCRYPT 2013. :353-370.

Bitansky N, Dachman-Soled D, Garg S, Jain A, Kalai YTauman, López-Alt A, Wichs D.  2013.  Why ?Fiat-Shamir for Proofs? Lacks a Proof. Theory of Cryptography. :182-201.

Choi SGeol, Dachman-Soled D, Yung M.  2012.  On the Centrality of Off-Line E-Cash to Concrete Partial Information Games. Security and Cryptography for Networks. :264-280.

Dachman-Soled D, Gennaro R, Krawczyk H, Malkin T.  2012.  Computational Extractors and Pseudorandomness. Theory of Cryptography. :383-403.

Canetti R, Dachman-Soled D, Vaikuntanathan V, Wee H.  2012.  Efficient Password Authenticated Key Exchange via Oblivious Transfer. Public Key Cryptography ? PKC 2012. :449-466.

Dachman-Soled D, Kalai YTauman.  2012.  Securing Circuits against Constant-Rate Tampering. Advances in Cryptology ? CRYPTO 2012. :533-551.

Dachman-Soled D, Lindell Y, Mahmoody M, Malkin T.  2011.  On the Black-Box Complexity of Optimally-Fair Coin Tossing. Theory of Cryptography. :450-467.

Papamanthou C, Tamassia R, Triandopoulos N.  2011.  Optimal Verification of Operations on Dynamic Sets. Advances in Cryptology ? CRYPTO 2011. :91-110.

Dachman-Soled D, Malkin T, Raykova M, Yung M.  2011.  Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications. Applied Cryptography and Network Security. :130-146.

Papamanthou C, Tamassia R, Triandopoulos N.  2010.  Optimal Authenticated Data Structures with Multilinear Forms. Pairing-Based Cryptography - Pairing 2010. :246-264.

Dachman-Soled D, Malkin T, Raykova M, Yung M.  2009.  Efficient Robust Private Set Intersection. Applied Cryptography and Network Security. :125-142.

Choi SGeol, Dachman-Soled D, Malkin T, Wee H.  2009.  Improved Non-committing Encryption with Applications to Adaptively Secure Protocols. Advances in Cryptology ? ASIACRYPT 2009. :287-302.

Choi SGeol, Dachman-Soled D, Malkin T, Wee H.  2009.  Simple, Black-Box Constructions of Adaptively Secure Protocols. Theory of Cryptography. :387-402.

Choi SGeol, Dachman-Soled D, Malkin T, Wee H.  2008.  Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One. Theory of Cryptography. :427-444.

Chetty M, Sung J-Y, Grinter RE.  2007.  How Smart Homes Learn: The Evolution of the Networked Home and Household. UbiComp 2007: Ubiquitous Computing. :127-144.

Papamanthou C, Tamassia R.  2007.  Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures. Information and Communications Security. :1-15.