dblp.uni-trier.dewww.uni-trier.de

Charles Rackoff

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
41EEDan 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
40EEVladimir Kolesnikov, Charles Rackoff: Password Mistyping in Two-Factor-Authenticated Key Exchange. ICALP (2) 2008: 702-714
39EEShai Halevi, Steven Myers, Charles Rackoff: On Seed-Incompressible Functions. TCC 2008: 19-36
2007
38EEAli 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
37EEVladimir Kolesnikov, Charles Rackoff: Key Exchange Using Passwords and Long Keys. TCC 2006: 100-119
2005
36EEJoe Kilian, Charles Rackoff, Erez Petrank: Lower Bounds For Concurrent Zero Knowledge*. Combinatorica 25(2): 217-249 (2005)
35EEShlomo Hoory, Avner Magen, Steven Myers, Charles Rackoff: Simple permutations mix well. Theor. Comput. Sci. 348(2-3): 251-261 (2005)
2004
34EERafail Ostrovsky, Charles Rackoff, Adam Smith: Efficient Consistency Proofs for Generalized Queries on a Committed Database. ICALP 2004: 1041-1053
33EEShlomo Hoory, Avner Magen, Steven Myers, Charles Rackoff: Simple Permutations Mix Well. ICALP 2004: 770-781
2003
32EEAllan Borodin, Morten N. Nielsen, Charles Rackoff: (Incremental) Priority Algorithms. Algorithmica 37(4): 295-326 (2003)
2002
31EEAllan Borodin, Morten N. Nielsen, Charles Rackoff: (Incremental) priority algorithms. SODA 2002: 752-761
2001
30EEJoe Kilian, Erez Petrank, Charles Rackoff: Lower Bounds for Zero-knowledge on the Internet CoRR cs.CR/0107003: (2001)
2000
29EEValentine Kabanets, Charles Rackoff, Stephen Cook: Efficiently Approximable Real-Valued Functions Electronic Colloquium on Computational Complexity (ECCC) 7(34): (2000)
28EEErez Petrank, Charles Rackoff: CBC MAC for Real-Time Data Sources. J. Cryptology 13(3): 315-338 (2000)
1998
27EEJoe 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
25EECharles Rackoff, Daniel R. Simon: Cryptographic defense against traffic analysis. STOC 1993: 672-681
1992
24EECharles Rackoff: Some definitions, protocols and proofs about secure authentication. CASCON 1992: 361-374
1991
23EECharles 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
20EECharles 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
17EEMichael Luby, Charles Rackoff: A Study of Password Security. CRYPTO 1987: 392-397
1986
16EESilvio 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
14EEMichael 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
10EECharles 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 FOCS 1972: 121-124

Coauthor Index

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

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)