Research http://www.cs.virginia.edu/~shelat/research/ en Copyright 2009 Tue, 04 Aug 2009 10:12:43 -0500 http://www.sixapart.com/movabletype/ http://www.rssboard.org/rss-specification Bit Encryption is Complete
Proceedings version: [pdf]
]]> http://www.cs.virginia.edu/~shelat/research/2009/08/bit_encryption_is_complete.html http://www.cs.virginia.edu/~shelat/research/2009/08/bit_encryption_is_complete.html Tue, 04 Aug 2009 10:12:43 -0500 Collusion-Free Multiparty Computation in the Mediated Model CRYPTO 2009. Santa Barbara, CA.

]]> http://www.cs.virginia.edu/~shelat/research/2009/05/collusion-free_multiparty_comp.html http://www.cs.virginia.edu/~shelat/research/2009/05/collusion-free_multiparty_comp.html Fri, 15 May 2009 12:07:39 -0500 Purely Rational Secret Sharing Theory of Cryptography Conference (TCC) 2009.

]]> http://www.cs.virginia.edu/~shelat/research/2009/05/purely_rational_secret_sharing.html http://www.cs.virginia.edu/~shelat/research/2009/05/purely_rational_secret_sharing.html Fri, 15 May 2009 12:03:18 -0500 Efficient Protocols for Set Membership and Range Proofs
To Appear in ASIACRYPT 2008

]]> http://www.cs.virginia.edu/~shelat/research/2008/08/efficient-protocols-for-set-me.html http://www.cs.virginia.edu/~shelat/research/2008/08/efficient-protocols-for-set-me.html Fri, 29 Aug 2008 08:40:49 -0500 Collusion-Free Protocols in the Mediated Model
CRYPTO 2008
]]> http://www.cs.virginia.edu/~shelat/research/2008/08/collusionfree-protocols-in-the.html http://www.cs.virginia.edu/~shelat/research/2008/08/collusionfree-protocols-in-the.html Fri, 29 Aug 2008 08:33:29 -0500 Relations Among Notions of Non-Malleability for Encryption
ASIACRYPT'07, December 2007, Kuching, Malaysia.
]]> http://www.cs.virginia.edu/~shelat/research/2007/08/relations-among-notions-of-non.html http://www.cs.virginia.edu/~shelat/research/2007/08/relations-among-notions-of-non.html Wed, 29 Aug 2007 18:26:43 -0500 Bounded CCA2-Secure Encryption
To appear in ASIACRYPT'07, December 2007, Kuching, Malaysia.

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.
]]> http://www.cs.virginia.edu/~shelat/research/2007/08/bounded-cca2secure-encryption.html http://www.cs.virginia.edu/~shelat/research/2007/08/bounded-cca2secure-encryption.html Wed, 29 Aug 2007 18:19:02 -0500 Cryptography from Sunspots: How to use an Imperfect Reference String To appear in Foundations of Computer Science (FOCS'07), Providence, Rhode Island, October 2007.
]]> http://www.cs.virginia.edu/~shelat/research/2007/07/cryptography-from-sunspots-how.html http://www.cs.virginia.edu/~shelat/research/2007/07/cryptography-from-sunspots-how.html Wed, 25 Jul 2007 16:34:22 -0500 Efficient Fork-Linearizable Access to Untrusted Shared Memory Principles of Distributed Computing (PODC'07), Portland, Oregan, Aug 2007.
]]> http://www.cs.virginia.edu/~shelat/research/2007/07/efficient-forklinearizable-acc.html http://www.cs.virginia.edu/~shelat/research/2007/07/efficient-forklinearizable-acc.html Wed, 25 Jul 2007 16:09:02 -0500 Simulatable Adaptive Oblivious Transfer EUROCRYPT 2007, Barcelona, Spain, May 2007. p.573-590. ]]> http://www.cs.virginia.edu/~shelat/research/2007/07/simulatable-adaptive-oblivious.html http://www.cs.virginia.edu/~shelat/research/2007/07/simulatable-adaptive-oblivious.html Wed, 25 Jul 2007 16:08:20 -0500 Securely Obfuscating Re-encryption Theory of Cryptography Conference (TCC'07), Amsterdam, The Netherlands, Feb 2007, p. 233-252.]]> http://www.cs.virginia.edu/~shelat/research/2007/07/securely-obfuscating-reencrypt.html http://www.cs.virginia.edu/~shelat/research/2007/07/securely-obfuscating-reencrypt.html Wed, 25 Jul 2007 16:07:41 -0500 Construction of a Non-malleable Encryption Scheme from Any Semantically-Secure One CRYPTO'06, Santa Barbara, CA, Aug 2006, p.271-289.
]]> http://www.cs.virginia.edu/~shelat/research/2007/07/construction-of-a-nonmalleable.html http://www.cs.virginia.edu/~shelat/research/2007/07/construction-of-a-nonmalleable.html Wed, 25 Jul 2007 16:05:54 -0500 Unconditional Characterizations of Non-Interactive Zero-Knowledge CRYPTO'05, Santa Barbara, CA, Aug 2005, p.118-134. ]]> http://www.cs.virginia.edu/~shelat/research/2005/08/unconditional-characterization.html http://www.cs.virginia.edu/~shelat/research/2005/08/unconditional-characterization.html Thu, 25 Aug 2005 17:36:06 -0500 Collusion-free Protocols Symposium on the Theory of Computation (STOC'05), Baltimore, MD, May 2005, p.543-552. ]]> http://www.cs.virginia.edu/~shelat/research/2005/07/collusionfree-protocols.html http://www.cs.virginia.edu/~shelat/research/2005/07/collusionfree-protocols.html Mon, 25 Jul 2005 17:43:39 -0500 The Smallest Grammar Problem IEEE Transactions on Information Theory, Vol. 51, Issue 7, Jul 2005, p2554-2576.

This paper subsumes
Approximating the Smallest Grammar: Kolmogorov Complexity in Natural Models
Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, April Rasala, Amit Sahai, abhi shelat
STOC 2002
]]> http://www.cs.virginia.edu/~shelat/research/2005/07/the-smallest-grammar-problem.html http://www.cs.virginia.edu/~shelat/research/2005/07/the-smallest-grammar-problem.html Mon, 25 Jul 2005 17:42:31 -0500