Publications

Export 23 results:
Author Title Type [ Year(Asc)]
Filters: Keyword is Algorithm Analysis and Problem Complexity  [Clear All Filters]
2014
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.
2013
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.
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.
2012
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.
2011
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.
Dachman-Soled D, Servedio RA.  2011.  A Canonical Form for Testing Boolean Function Properties. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. :460-471.
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.
2010
Papamanthou C, Tamassia R, Triandopoulos N.  2010.  Optimal Authenticated Data Structures with Multilinear Forms. Pairing-Based Cryptography - Pairing 2010. :246-264.
2009
Tamassia R, Palazzi B, Papamanthou C.  2009.  Graph Drawing for Security Visualization. Graph Drawing. :2-13.
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.
2008
Papamanthou C, Preparata FP, Tamassia R.  2008.  Algorithms for Location Estimation Based on RSSI Sampling. Algorithmic Aspects of Wireless Sensor Networks. :72-86.
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.
2007
Goodrich MT, Papamanthou C, Tamassia R.  2007.  On the Cost of Persistence and Authentication in Skip Lists. Experimental Algorithms. :94-107.
Dachman-Soled D, Servedio RA.  2007.  Distribution-Free Testing Lower Bounds for Basic Boolean Functions. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. :494-508.
Papamanthou C, Tollis IG.  2007.  Parameterized st-Orientations of Graphs: Algorithms and Experiments. Graph Drawing. :220-233.
Papamanthou C, Tamassia R.  2007.  Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures. Information and Communications Security. :1-15.
2006
Papamanthou C, Tollis IG.  2006.  Applications of Parameterized st-Orientations in Graph Drawing Algorithms. Graph Drawing. :355-367.
2005
Papamanthou C, Tollis IG, Doerr M.  2005.  3D Visualization of Semantic Metadata Models and Ontologies. Graph Drawing. :377-388.