<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0">
    <channel>
        <title>Research</title>
        <link>http://www.cs.virginia.edu/~shelat/research/</link>
        <description></description>
        <language>en</language>
        <copyright>Copyright 2011</copyright>
        <lastBuildDate>Thu, 27 Jan 2011 22:06:49 -0500</lastBuildDate>
        <generator>http://www.sixapart.com/movabletype/</generator>
        <docs>http://www.rssboard.org/rss-specification</docs>
        
        <item>
            <title>Two-output Secure Computation With Malicious Adversaries</title>
            <description><![CDATA[Chih-hao Shen and a. shelat <br />Eurocrypt 2011 ]]></description>
            <link>http://www.cs.virginia.edu/~shelat/research/2011/01/two-output_secure_computation.html</link>
            <guid>http://www.cs.virginia.edu/~shelat/research/2011/01/two-output_secure_computation.html</guid>
            
            
            <pubDate>Thu, 27 Jan 2011 22:06:49 -0500</pubDate>
        </item>
        
        <item>
            <title>A Sub-0.5V Lattice-Based Public-Key Encryption Scheme for RFID Platforms in 130nm CMOS </title>
            <description><![CDATA[Yu Yao, Sudhanshu Khanna, Ben Calhoun, Dave Evans, John Lach, and a. shelat<br />RFIDSEC'11 Asia]]></description>
            <link>http://www.cs.virginia.edu/~shelat/research/2011/01/a_sub-05v_lattice-based_public.html</link>
            <guid>http://www.cs.virginia.edu/~shelat/research/2011/01/a_sub-05v_lattice-based_public.html</guid>
            
            
            <pubDate>Thu, 27 Jan 2011 22:05:06 -0500</pubDate>
        </item>
        
        <item>
            <title>Renegotiation-safe Protocols </title>
            <description><![CDATA[Rafael Pass and a. shelat <br />Innovations in Computer Science '11 (ICS'11) ]]></description>
            <link>http://www.cs.virginia.edu/~shelat/research/2011/01/renegotiation-safe_protocols.html</link>
            <guid>http://www.cs.virginia.edu/~shelat/research/2011/01/renegotiation-safe_protocols.html</guid>
            
            
            <pubDate>Thu, 27 Jan 2011 22:04:21 -0500</pubDate>
        </item>
        
        <item>
            <title>Optimistic Concurrent Zero Knowledge </title>
            <description><![CDATA[Alon Rosen and a. shelat <br />Asiacrypt '10 ]]></description>
            <link>http://www.cs.virginia.edu/~shelat/research/2011/01/optimistic_concurrent_zero_kno.html</link>
            <guid>http://www.cs.virginia.edu/~shelat/research/2011/01/optimistic_concurrent_zero_kno.html</guid>
            
            
            <pubDate>Thu, 27 Jan 2011 22:03:38 -0500</pubDate>
        </item>
        
        <item>
            <title>Additive Combinatorics and Discrete Logarithm Based Range Protocols </title>
            <description>R. Chaabouni, H. Lipmaa, a.shelat </description>
            <link>http://www.cs.virginia.edu/~shelat/research/2011/01/additive_combinatorics_and_dis.html</link>
            <guid>http://www.cs.virginia.edu/~shelat/research/2011/01/additive_combinatorics_and_dis.html</guid>
            
            
            <pubDate>Thu, 27 Jan 2011 21:58:44 -0500</pubDate>
        </item>
        
        <item>
            <title>Bit Encryption is Complete</title>
            <description><![CDATA[Steven Myers and abhi shelat.&nbsp; FOCS 2009.<br /><br />Proceedings version: [<a href="http://www.cs.virginia.edu/%7Eshelat/papers/ms09-1bit.pdf">pdf</a>] <br />]]></description>
            <link>http://www.cs.virginia.edu/~shelat/research/2009/08/bit_encryption_is_complete.html</link>
            <guid>http://www.cs.virginia.edu/~shelat/research/2009/08/bit_encryption_is_complete.html</guid>
            
            
            <pubDate>Tue, 04 Aug 2009 10:12:43 -0500</pubDate>
        </item>
        
        <item>
            <title>Collusion-Free Multiparty Computation in the Mediated Model</title>
            <description><![CDATA[J. Alwen, J. Katz, Y. Lindell, G. Persiano,&nbsp; abhi shelat, and I. Visconti.<br />CRYPTO 2009. Santa Barbara, CA.<br /><br /> ]]></description>
            <link>http://www.cs.virginia.edu/~shelat/research/2009/05/collusion-free_multiparty_comp.html</link>
            <guid>http://www.cs.virginia.edu/~shelat/research/2009/05/collusion-free_multiparty_comp.html</guid>
            
            
            <pubDate>Fri, 15 May 2009 12:07:39 -0500</pubDate>
        </item>
        
        <item>
            <title>Purely Rational Secret Sharing</title>
            <description><![CDATA[Silvio Micalli and abhi shelat.<br />Theory of Cryptography Conference (TCC) 2009.<br /><br /> ]]></description>
            <link>http://www.cs.virginia.edu/~shelat/research/2009/05/purely_rational_secret_sharing.html</link>
            <guid>http://www.cs.virginia.edu/~shelat/research/2009/05/purely_rational_secret_sharing.html</guid>
            
            
            <pubDate>Fri, 15 May 2009 12:03:18 -0500</pubDate>
        </item>
        
        <item>
            <title>Efficient Protocols for Set Membership and Range Proofs</title>
            <description><![CDATA[Jan Camenisch, Raﬁk Chaabouni, and abhi shelat<br><br>To Appear in ASIACRYPT 2008<br><br> ]]></description>
            <link>http://www.cs.virginia.edu/~shelat/research/2008/08/efficient-protocols-for-set-me.html</link>
            <guid>http://www.cs.virginia.edu/~shelat/research/2008/08/efficient-protocols-for-set-me.html</guid>
            
            
            <pubDate>Fri, 29 Aug 2008 08:40:49 -0500</pubDate>
        </item>
        
        <item>
            <title>Collusion-Free Protocols in the Mediated Model</title>
            <description><![CDATA[Joel Alwen, abhi shelat, and Ivan Visconti<br><br>CRYPTO 2008<br>]]></description>
            <link>http://www.cs.virginia.edu/~shelat/research/2008/08/collusionfree-protocols-in-the.html</link>
            <guid>http://www.cs.virginia.edu/~shelat/research/2008/08/collusionfree-protocols-in-the.html</guid>
            
            
            <pubDate>Fri, 29 Aug 2008 08:33:29 -0500</pubDate>
        </item>
        
        <item>
            <title>Relations Among Notions of Non-Malleability for Encryption</title>
            <description><![CDATA[Rafael Pass, abhi shelat, and Vinod Vaikuntanathan.<br><br>ASIACRYPT'07, December 2007, Kuching, Malaysia.<br> ]]></description>
            <link>http://www.cs.virginia.edu/~shelat/research/2007/08/relations-among-notions-of-non.html</link>
            <guid>http://www.cs.virginia.edu/~shelat/research/2007/08/relations-among-notions-of-non.html</guid>
            
            
            <pubDate>Wed, 29 Aug 2007 18:26:43 -0500</pubDate>
        </item>
        
        <item>
            <title>Bounded CCA2-Secure Encryption</title>
            <description><![CDATA[Ronald Cramer, Goichiro Hanaoka, Dennis Hofheinz, Hideki Imai, Eike Kiltz, Rafael Pass, abhi shelat, and Vinod Vaikuntanathan.&nbsp; <br><br>To appear in ASIACRYPT'07, December 2007, Kuching, Malaysia.<br><br>This paper is a merger of three papers: one by Cramer, Hofheinz, and Kiltz, one by Hanaoka and Imai, and one by Pass, shelat, and Vaikuntanathan.<br>]]></description>
            <link>http://www.cs.virginia.edu/~shelat/research/2007/08/bounded-cca2secure-encryption.html</link>
            <guid>http://www.cs.virginia.edu/~shelat/research/2007/08/bounded-cca2secure-encryption.html</guid>
            
            
            <pubDate>Wed, 29 Aug 2007 18:19:02 -0500</pubDate>
        </item>
        
        <item>
            <title>Cryptography from Sunspots: How to use an Imperfect Reference String</title>
            <description><![CDATA[Ran Canetti, Rafael Pass, and abhi shelat<br>To appear in Foundations of Computer Science (FOCS'07), Providence, Rhode Island, October 2007.<br> ]]></description>
            <link>http://www.cs.virginia.edu/~shelat/research/2007/07/cryptography-from-sunspots-how.html</link>
            <guid>http://www.cs.virginia.edu/~shelat/research/2007/07/cryptography-from-sunspots-how.html</guid>
            
            
            <pubDate>Wed, 25 Jul 2007 16:34:22 -0500</pubDate>
        </item>
        
        <item>
            <title>Efficient Fork-Linearizable Access to Untrusted Shared Memory</title>
            <description><![CDATA[Christian Cachin, abhi shelat, and Alex Shraer<br>Principles of Distributed Computing (PODC'07), Portland, Oregan, Aug 2007.<br> ]]></description>
            <link>http://www.cs.virginia.edu/~shelat/research/2007/07/efficient-forklinearizable-acc.html</link>
            <guid>http://www.cs.virginia.edu/~shelat/research/2007/07/efficient-forklinearizable-acc.html</guid>
            
            
            <pubDate>Wed, 25 Jul 2007 16:09:02 -0500</pubDate>
        </item>
        
        <item>
            <title>Simulatable Adaptive Oblivious Transfer</title>
            <description><![CDATA[Jan Camenisch, Gregory Neven, and abhi shelat<br>EUROCRYPT 2007, Barcelona, Spain, May 2007. p.573-590. ]]></description>
            <link>http://www.cs.virginia.edu/~shelat/research/2007/07/simulatable-adaptive-oblivious.html</link>
            <guid>http://www.cs.virginia.edu/~shelat/research/2007/07/simulatable-adaptive-oblivious.html</guid>
            
            
            <pubDate>Wed, 25 Jul 2007 16:08:20 -0500</pubDate>
        </item>
        
    </channel>
</rss>

