Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Charles
Last name:	Rackoff
DBLP:	88/1341
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 10 of 42  

Select a publication
Show	Title	Venue	Rating	Date
	Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka. The Black-Box Query Complexity of Polynomial Summation.	Computational Complexity 2009, Volume 18	(0)	2009
	Dan Boneh, Periklis A. Papakonstantinou, Charles Rackoff, Yevgeniy Vahlis, Brent Waters. On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations.	49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA 2008	(0)	2008
	Vladimir Kolesnikov, Charles Rackoff. Password Mistyping in Two-Factor-Authenticated Key Exchange.	Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming Track C: Security and Cryptography Foundations 2008	(0)	2008
	Shai Halevi, Steven Myers, Charles Rackoff. On Seed-Incompressible Functions.	Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008. 2008	(0)	2008
	Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka. The black-box query complexity of polynomial summation.	Electronic Colloquium on Computational Complexity (ECCC) 2007, Volume 14	(0)	2007
	Vladimir Kolesnikov, Charles Rackoff. Key Exchange Using Passwords and Long Keys.	Theory of Cryptography, Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006, Proceedings 2006	(0)	2006
	Joe Kilian, Charles Rackoff, Erez Petrank. Lower Bounds For Concurrent Zero Knowledge*.	Combinatorica 2005, Volume 25	(0)	2005
	Shlomo Hoory, Avner Magen, Steven Myers, Charles Rackoff. Simple permutations mix well.	Theor. Comput. Sci. 2005, Volume 348	(0)	2005
	Shlomo Hoory, Avner Magen, Steven Myers, Charles Rackoff. Simple Permutations Mix Well.	Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings 2004	(0)	2004
	Rafail Ostrovsky, Charles Rackoff, Adam Smith. Efficient Consistency Proofs for Generalized Queries on a Committed Database.	Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings 2004	(0)	2004

Your query returned 42 matches in the database.