The following pages link to Charles W. Rackoff (Q964870):
Displaying 34 items.
- (Q626614) (redirect page) (← links)
- (Q1924197) (redirect page) (← links)
- The black-box query complexity of polynomial summation (Q626615) (← links)
- Lower bounds for concurrent zero knowledge (Q812826) (← links)
- Characterizing sets of jobs that admit optimal greedy-like algorithms (Q964871) (← links)
- A study of password security (Q1121243) (← links)
- The covering and boundedness problems for vector addition systems (Q1242682) (← links)
- The computational complexity of logical theories (Q1256445) (← links)
- CBC MAC for real-time data sources (Q1573769) (← links)
- (Incremental) priority algorithms (Q1762982) (← links)
- A secure protocol for the oblivious transfer. (Extended abstract) (Q1924198) (← links)
- Simple permutations mix well (Q2581269) (← links)
- Secure Key Exchange and Sessions without Credentials (Q2922652) (← links)
- (Q3211252) (← links)
- (Q3348850) (← links)
- Password Mistyping in Two-Factor-Authenticated Key Exchange (Q3519545) (← links)
- (Q3773819) (← links)
- The Notion of Security for Probabilistic Cryptosystems (Q3787915) (← links)
- How to Construct Pseudorandom Permutations from Pseudorandom Functions (Q3787920) (← links)
- The Knowledge Complexity of Interactive Proof Systems (Q3833627) (← links)
- Space Lower Bounds for Maze Threadability on Restricted Machines (Q3890116) (← links)
- Limitations on Separating Nondeterministic Complexity Classes (Q3922171) (← links)
- Relativized Questions Involving Probabilistic Algorithms (Q3935473) (← links)
- (Q4035737) (← links)
- A Decision Procedure for the First Order Theory of Real Addition with Order (Q4046035) (← links)
- (Q4131018) (← links)
- On the complexity of the theories of weak direct powers (Q4163506) (← links)
- The knowledge complexity of interactive proof-systems (Q4365519) (← links)
- (Q4401928) (← links)
- (Q4829011) (← links)
- Cryptographic defense against traffic analysis (Q5248538) (← links)
- Relativized questions involving probabilistic algorithms (Q5402574) (← links)
- On Seed-Incompressible Functions (Q5445496) (← links)
- Automata, Languages and Programming (Q5466512) (← links)
- Theory of Cryptography (Q5898644) (← links)