Charles Rackoff

	2011
47		Charles Rackoff: On "identities", "names", "NAMES", "ROLES" and Security: A Manifesto. IACR Cryptology ePrint Archive 2011: 214 (2011)
	2010
46		Periklis A. Papakonstantinou, Charles Rackoff: Characterizing sets of jobs that admit optimal greedy-like algorithms. J. Scheduling 13(2): 163-176 (2010)
	2009
45		Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka: The Black-Box Query Complexity of Polynomial Summation. Computational Complexity 18(1): 59-79 (2009)
	2008
44		Dan Boneh, Periklis A. Papakonstantinou, Charles Rackoff, Yevgeniy Vahlis, Brent Waters: On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations. FOCS 2008: 283-292
43		Vladimir Kolesnikov, Charles Rackoff: Password Mistyping in Two-Factor-Authenticated Key Exchange. ICALP (2) 2008: 702-714
42		Shai Halevi, Steven Myers, Charles Rackoff: On Seed-Incompressible Functions. TCC 2008: 19-36
41		Vladimir Kolesnikov, Charles Rackoff: Password Mistyping in Two-Factor-Authenticated Key Exchange. IACR Cryptology ePrint Archive 2008: 413 (2008)
	2007
40		Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka: The black-box query complexity of polynomial summation. Electronic Colloquium on Computational Complexity (ECCC) 14(125): (2007)
	2006
39		Vladimir Kolesnikov, Charles Rackoff: Key Exchange Using Passwords and Long Keys. TCC 2006: 100-119
38		Vladimir Kolesnikov, Charles Rackoff: Key Exchange Using Passwords and Long Keys. IACR Cryptology ePrint Archive 2006: 57 (2006)
	2005
37		Joe Kilian, Charles Rackoff, Erez Petrank: Lower Bounds For Concurrent Zero Knowledge*. Combinatorica 25(2): 217-249 (2005)
36		Shlomo Hoory, Avner Magen, Steven Myers, Charles Rackoff: Simple permutations mix well. Theor. Comput. Sci. 348(2-3): 251-261 (2005)
	2004
35		Rafail Ostrovsky, Charles Rackoff, Adam Smith: Efficient Consistency Proofs for Generalized Queries on a Committed Database. ICALP 2004: 1041-1053
34		Shlomo Hoory, Avner Magen, Steven Myers, Charles Rackoff: Simple Permutations Mix Well. ICALP 2004: 770-781
33		Rafail Ostrovsky, Charles Rackoff, Adam Smith: Efficient Consistency Proofs for Generalized Queries on a Committed Database. IACR Cryptology ePrint Archive 2004: 170 (2004)
	2003
32		Allan Borodin, Morten N. Nielsen, Charles Rackoff: (Incremental) Priority Algorithms. Algorithmica 37(4): 295-326 (2003)
	2002
31		Allan Borodin, Morten N. Nielsen, Charles Rackoff: (Incremental) priority algorithms. SODA 2002: 752-761
	2001
30		Joe Kilian, Erez Petrank, Charles Rackoff: Lower Bounds for Zero-knowledge on the Internet CoRR cs.CR/0107003: (2001)
	2000
29		Valentine Kabanets, Charles Rackoff, Stephen A. Cook: Efficiently Approximable Real-Valued Functions Electronic Colloquium on Computational Complexity (ECCC) 7(34): (2000)
28		Erez Petrank, Charles Rackoff: CBC MAC for Real-Time Data Sources. J. Cryptology 13(3): 315-338 (2000)
	1998
27		Joe Kilian, Erez Petrank, Charles Rackoff: Lower Bounds for Zero Knowledge on the Internet. FOCS 1998: 484-492
	1996
26		Michael J. Fischer, Silvio Micali, Charles Rackoff: A Secure Protocol for the Oblivious Transfer (Extended Abstract). J. Cryptology 9(3): 191-195 (1996)
	1993
25		Charles Rackoff, Daniel R. Simon: Cryptographic defense against traffic analysis. STOC 1993: 672-681
	1992
24		Charles Rackoff: Some definitions, protocols and proofs about secure authentication. CASCON 1992: 361-374
	1991
23		Charles Rackoff, Daniel R. Simon: Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack. CRYPTO 1991: 433-444
	1989
22		Michael Luby, Charles Rackoff: A Study of Password Security. J. Cryptology 1(3): 151-158 (1989)
21		Shafi Goldwasser, Silvio Micali, Charles Rackoff: The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comput. 18(1): 186-208 (1989)
	1988
20		Charles Rackoff: A Basic Theory of Public and Private Cryptosystems. CRYPTO 1988: 249-255
19		Michael Luby, Charles Rackoff: How to Construct Pseudorandom Permutations from Pseudorandom Functions. SIAM J. Comput. 17(2): 373-386 (1988)
18		Silvio Micali, Charles Rackoff, Bob Sloan: The Notion of Security for Probabilistic Cryptosystems. SIAM J. Comput. 17(2): 412-426 (1988)
	1987
17		Michael Luby, Charles Rackoff: A Study of Password Security. CRYPTO 1987: 392-397
	1986
16		Silvio Micali, Charles Rackoff, Bob Sloan: The Notion of Security for Probabilistic Cryptosystems. CRYPTO 1986: 381-392
15		Michael Luby, Charles Rackoff: Pseudo-random Permutation Generators and Cryptographic Composition STOC 1986: 356-363
	1985
14		Michael Luby, Charles Rackoff: How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract). CRYPTO 1985: 447
13		Shafi Goldwasser, Silvio Micali, Charles Rackoff: The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract) STOC 1985: 291-304
	1983
12		Michael Luby, Silvio Micali, Charles Rackoff: How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin FOCS 1983: 11-21
11		Leslie G. Valiant, Sven Skyum, S. Berkowitz, Charles Rackoff: Fast Parallel Computation of Polynomials Using Few Processors. SIAM J. Comput. 12(4): 641-644 (1983)
	1982
10		Charles Rackoff: Relativized Questions Involving Probabilistic Algorithms. J. ACM 29(1): 261-268 (1982)
	1981
9		Charles Rackoff, Joel I. Seiferas: Limitations on Separating Nondeterministic Complexity Classes. SIAM J. Comput. 10(4): 742-745 (1981)
	1980
8		Stephen A. Cook, Charles Rackoff: Space Lower Bounds for Maze Threadability on Restricted Machines. SIAM J. Comput. 9(3): 636-652 (1980)
	1979
7		Romas Aleliunas, Richard M. Karp, Richard J. Lipton, László Lovász, Charles Rackoff: Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems FOCS 1979: 218-223
	1978
6		Charles Rackoff: Relativized Questions Involving Probabilistic Algorithms STOC 1978: 338-342
5		Charles Rackoff: The Covering and Boundedness Problems for Vector Addition Systems. Theor. Comput. Sci. 6: 223-231 (1978)
	1976
4		Charles Rackoff: On the Complexity of the Theories of Weak Direct Powers. J. Symb. Log. 41(3): 561-573 (1976)
	1975
3		Jeanne Ferrante, Charles Rackoff: A Decision Procedure for the First Order Theory of Real Addition with Order. SIAM J. Comput. 4(1): 69-76 (1975)
	1974
2		Charles Rackoff: On the Complexity of the Theories of Weak Direct Products: A Preliminary Report STOC 1974: 149-160
	1972
1		R. Hossley, Charles Rackoff: The Emptiness Problem for Automata on Infinite Trees SWAT (FOCS) 1972: 121-124

Coauthor Index

1	Romas Aleliunas	[7]
2	S. Berkowitz	[11]
3	Dan Boneh	[44]
4	Allan Borodin	[31] [32]
5	Stephen A. Cook	[8] [29]
6	Jeanne Ferrante	[3]
7	Michael J. Fischer	[26]
8	Shafi Goldwasser	[13] [21]
9	Shai Halevi	[42]
10	Shlomo Hoory	[34] [36]
11	R. Hossley	[1]
12	Ali Juma	[40] [45]
13	Valentine Kabanets	[29] [40] [45]
14	Richard M. Karp	[7]
15	Joe Kilian	[27] [30] [37]
16	Vladimir Kolesnikov	[38] [39] [41] [43]
17	Richard J. Lipton	[7]
18	László Lovász	[7]
19	Michael Luby	[12] [14] [15] [17] [19] [22]
20	Avner Magen	[34] [36]
21	Silvio Micali	[12] [13] [16] [18] [21] [26]
22	Steven Myers	[34] [36] [42]
23	Morten N. Nielsen	[31] [32]
24	Rafail Ostrovsky	[33] [35]
25	Periklis A. Papakonstantinou	[44] [46]
26	Erez Petrank	[27] [28] [30] [37]
27	Joel I. Seiferas	[9]
28	Amir Shpilka	[40] [45]
29	Daniel R. Simon	[23] [25]
30	Sven Skyum	[11]
31	Bob Sloan	[16] [18]
32	Adam Smith (Adam D. Smith)	[33] [35]
33	Yevgeniy Vahlis	[44]
34	Leslie G. Valiant	[11]
35	Brent Waters (Brent R. Waters)	[44]

Colors in the list of coauthors

Last update Sat Feb 11 22:55:45 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page