Travelled to:1 × Finland
1 × Iceland
5 × USA
Collaborated with:∅ V.Kolesnikov D.R.Simon M.Luby R.Ostrovsky A.Smith S.Goldwasser S.Micali S.Hoory A.Magen S.Myers
Talks about:cryptograph (2) complex (2) permut (2) proof (2) probabilist (1) preliminari (1) algorithm (1) question (1) password (1) knowledg (1)
Person: Charles Rackoff
DBLP: Rackoff:Charles
Contributed to:
20082004
19931986198519781974Wrote 8 papers:
- ICALP-C-2008-KolesnikovR #authentication
- Password Mistyping in Two-Factor-Authenticated Key Exchange (VK, CR), pp. 702–714.
- ICALP-2004-HooryMMR #permutation
- Simple Permutations Mix Well (SH, AM, SM, CR), pp. 770–781.
- ICALP-2004-OstrovskyRS #commit #consistency #database #performance #proving #query
- Efficient Consistency Proofs for Generalized Queries on a Committed Database (RO, CR, AS), pp. 1041–1053.
- STOC-1993-RackoffS #analysis #encryption
- Cryptographic defense against traffic analysis (CR, DRS), pp. 672–681.
- STOC-1986-LubyR #composition #encryption #generative #permutation #pseudo
- Pseudo-random Permutation Generators and Cryptographic Composition (ML, CR), pp. 356–363.
- STOC-1985-GoldwasserMR #complexity #interactive
- The Knowledge Complexity of Interactive Proof-Systems (SG, SM, CR), pp. 291–304.
- STOC-1978-Rackoff #algorithm #probability
- Relativized Questions Involving Probabilistic Algorithms (CR), pp. 338–342.
- STOC-1974-Rackoff #complexity #on the
- On the Complexity of the Theories of Weak Direct Products: A Preliminary Report (CR), pp. 149–160.