Publications
Export 23 results:
Author Title Type [ Year] Filters: Keyword is Algorithm Analysis and Problem Complexity [Clear All Filters]
2014. Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? Theory of Cryptography. :217-239.
2014. On Minimal Assumptions for Sender-Deniable Public Key Encryption. Public-Key Cryptography – PKC 2014. :574-591.
2013. Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments. Advances in Cryptology - ASIACRYPT 2013. :316-336.
2012. Efficient Password Authenticated Key Exchange via Oblivious Transfer. Public Key Cryptography – PKC 2012. :449-466.
2011. A Canonical Form for Testing Boolean Function Properties. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. :460-471.
2011. Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications. Applied Cryptography and Network Security. :130-146.
2010. Optimal Authenticated Data Structures with Multilinear Forms. Pairing-Based Cryptography - Pairing 2010. :246-264.
2009. Improved Non-committing Encryption with Applications to Adaptively Secure Protocols. Advances in Cryptology – ASIACRYPT 2009. :287-302.
2009. Simple, Black-Box Constructions of Adaptively Secure Protocols. Theory of Cryptography. :387-402.
2008. Algorithms for Location Estimation Based on RSSI Sampling. Algorithmic Aspects of Wireless Sensor Networks. :72-86.
2008. Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One. Theory of Cryptography. :427-444.
2007. On the Cost of Persistence and Authentication in Skip Lists. Experimental Algorithms. :94-107.
2007. Distribution-Free Testing Lower Bounds for Basic Boolean Functions. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. :494-508.
2007. Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures. Information and Communications Security. :1-15.
2006. Applications of Parameterized st-Orientations in Graph Drawing Algorithms. Graph Drawing. :355-367.