default search action
Charles Rackoff
Person information
- affiliation: University of Toronto, Canada
- award (1993): Gödel Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [p1]Shafi Goldwasser, Silvio Micali, Charles Rackoff:
The knowledge complexity of interactive proof-systems. Providing Sound Foundations for Cryptography 2019: 203-225 - 2014
- [c24]Ran Canetti, Vladimir Kolesnikov, Charles Rackoff, Yevgeniy Vahlis:
Secure Key Exchange and Sessions without Credentials. SCN 2014: 40-56 - 2013
- [i12]Wesley George, Charles Rackoff:
Rethinking Definitions of Security for Session Key Agreement. IACR Cryptol. ePrint Arch. 2013: 139 (2013) - [i11]Ran Canetti, Vladimir Kolesnikov, Charles Rackoff, Yevgeniy Vahlis:
Secure Key Exchange and Sessions Without Credentials. IACR Cryptol. ePrint Arch. 2013: 693 (2013) - 2012
- [i10]Periklis A. Papakonstantinou, Charles Rackoff, Yevgeniy Vahlis:
How powerful are the DDH hard groups? Electron. Colloquium Comput. Complex. TR12 (2012) - [i9]Periklis A. Papakonstantinou, Charles Rackoff, Yevgeniy Vahlis:
How powerful are the DDH hard groups? IACR Cryptol. ePrint Arch. 2012: 653 (2012) - 2011
- [i8]Charles Rackoff:
On "identities", "names", "NAMES", "ROLES" and Security: A Manifesto. IACR Cryptol. ePrint Arch. 2011: 214 (2011) - 2010
- [j18]Periklis A. Papakonstantinou, Charles Rackoff:
Characterizing sets of jobs that admit optimal greedy-like algorithms. J. Sched. 13(2): 163-176 (2010)
2000 – 2009
- 2009
- [j17]Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka
:
The Black-Box Query Complexity of Polynomial Summation. Comput. Complex. 18(1): 59-79 (2009) - 2008
- [c23]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 - [c22]Vladimir Kolesnikov, Charles Rackoff:
Password Mistyping in Two-Factor-Authenticated Key Exchange. ICALP (2) 2008: 702-714 - [c21]Shai Halevi, Steven A. Myers, Charles Rackoff:
On Seed-Incompressible Functions. TCC 2008: 19-36 - [i7]Vladimir Kolesnikov, Charles Rackoff:
Password Mistyping in Two-Factor-Authenticated Key Exchange. IACR Cryptol. ePrint Arch. 2008: 413 (2008) - 2007
- [i6]Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka:
The black-box query complexity of polynomial summation. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c20]Vladimir Kolesnikov, Charles Rackoff:
Key Exchange Using Passwords and Long Keys. TCC 2006: 100-119 - [i5]Vladimir Kolesnikov, Charles Rackoff:
Key Exchange Using Passwords and Long Keys. IACR Cryptol. ePrint Arch. 2006: 57 (2006) - 2005
- [j16]Joe Kilian, Charles Rackoff, Erez Petrank:
Lower Bounds For Concurrent Zero Knowledge*. Comb. 25(2): 217-249 (2005) - [j15]Shlomo Hoory, Avner Magen, Steven A. Myers, Charles Rackoff:
Simple permutations mix well. Theor. Comput. Sci. 348(2-3): 251-261 (2005) - 2004
- [c19]Shlomo Hoory, Avner Magen, Steven A. Myers, Charles Rackoff:
Simple Permutations Mix Well. ICALP 2004: 770-781 - [c18]Rafail Ostrovsky, Charles Rackoff, Adam D. Smith:
Efficient Consistency Proofs for Generalized Queries on a Committed Database. ICALP 2004: 1041-1053 - [i4]Rafail Ostrovsky, Charles Rackoff, Adam D. Smith:
Efficient Consistency Proofs for Generalized Queries on a Committed Database. IACR Cryptol. ePrint Arch. 2004: 170 (2004) - 2003
- [j14]Allan Borodin, Morten N. Nielsen, Charles Rackoff:
(Incremental) Priority Algorithms. Algorithmica 37(4): 295-326 (2003) - 2002
- [c17]Allan Borodin, Morten N. Nielsen, Charles Rackoff:
(Incremental) priority algorithms. SODA 2002: 752-761 - 2001
- [i3]Joe Kilian, Erez Petrank, Charles Rackoff:
Lower Bounds for Zero-knowledge on the Internet. CoRR cs.CR/0107003 (2001) - 2000
- [j13]Erez Petrank, Charles Rackoff:
CBC MAC for Real-Time Data Sources. J. Cryptol. 13(3): 315-338 (2000) - [i2]Valentine Kabanets, Charles Rackoff, Stephen A. Cook:
Efficiently Approximable Real-Valued Functions. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1998
- [c16]Joe Kilian, Erez Petrank, Charles Rackoff:
Lower Bounds for Zero Knowledge on the Internet. FOCS 1998: 484-492 - 1997
- [i1]Erez Petrank, Charles Rackoff:
CBC MAC for Real-Time Data Sources. IACR Cryptol. ePrint Arch. 1997: 10 (1997) - 1996
- [j12]Michael J. Fischer, Silvio Micali, Charles Rackoff:
A Secure Protocol for the Oblivious Transfer (Extended Abstract). J. Cryptol. 9(3): 191-195 (1996) - 1993
- [c15]Charles Rackoff, Daniel R. Simon:
Cryptographic defense against traffic analysis. STOC 1993: 672-681 - 1992
- [c14]Charles Rackoff:
Some definitions, protocols and proofs about secure authentication. CASCON 1992: 361-374 - 1991
- [c13]Charles Rackoff, Daniel R. Simon:
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack. CRYPTO 1991: 433-444
1980 – 1989
- 1989
- [j11]Michael Luby, Charles Rackoff:
A Study of Password Security. J. Cryptol. 1(3): 151-158 (1989) - [j10]Shafi Goldwasser, Silvio Micali, Charles Rackoff:
The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comput. 18(1): 186-208 (1989) - [c12]Michael J. Fischer, Michael S. Paterson, Charles Rackoff:
Secret Bit Transmission Using a Random Deal of Cards. Distributed Computing And Cryptography 1989: 173-182 - 1988
- [j9]Michael Luby, Charles Rackoff:
How to Construct Pseudorandom Permutations from Pseudorandom Functions. SIAM J. Comput. 17(2): 373-386 (1988) - [j8]Silvio Micali, Charles Rackoff, Bob Sloan:
The Notion of Security for Probabilistic Cryptosystems. SIAM J. Comput. 17(2): 412-426 (1988) - [c11]Charles Rackoff:
A Basic Theory of Public and Private Cryptosystems. CRYPTO 1988: 249-255 - 1987
- [c10]Michael Luby, Charles Rackoff:
A Study of Password Security. CRYPTO 1987: 392-397 - 1986
- [c9]Silvio Micali, Charles Rackoff, Bob Sloan:
The Notion of Security for Probabilistic Cryptosystems. CRYPTO 1986: 381-392 - [c8]Michael Luby, Charles Rackoff:
Pseudo-random Permutation Generators and Cryptographic Composition. STOC 1986: 356-363 - 1985
- [c7]Michael Luby, Charles Rackoff:
How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract). CRYPTO 1985: 447 - [c6]Shafi Goldwasser, Silvio Micali, Charles Rackoff:
The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract). STOC 1985: 291-304 - 1983
- [j7]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) - [c5]Michael Luby, Silvio Micali, Charles Rackoff:
How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin. FOCS 1983: 11-21 - 1982
- [j6]Charles Rackoff:
Relativized Questions Involving Probabilistic Algorithms. J. ACM 29(1): 261-268 (1982) - 1981
- [j5]Charles Rackoff, Joel I. Seiferas:
Limitations on Separating Nondeterministic Complexity Classes. SIAM J. Comput. 10(4): 742-745 (1981) - 1980
- [j4]Stephen A. Cook, Charles Rackoff:
Space Lower Bounds for Maze Threadability on Restricted Machines. SIAM J. Comput. 9(3): 636-652 (1980)
1970 – 1979
- 1979
- [c4]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
- [j3]Charles Rackoff:
The Covering and Boundedness Problems for Vector Addition Systems. Theor. Comput. Sci. 6: 223-231 (1978) - [c3]Charles Rackoff:
Relativized Questions Involving Probabilistic Algorithms. STOC 1978: 338-342 - 1976
- [j2]Charles Rackoff:
On the Complexity of the Theories of Weak Direct Powers. J. Symb. Log. 41(3): 561-573 (1976) - 1975
- [j1]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
- [c2]Charles Rackoff:
On the Complexity of the Theories of Weak Direct Products: A Preliminary Report. STOC 1974: 149-160 - 1972
- [c1]R. Hossley, Charles Rackoff:
The Emptiness Problem for Automata on Infinite Trees. SWAT 1972: 121-124
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-21 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: