Charles W. Rackoff

Available identifiers

zbMath Open rackoff.charles-wDBLP88/1341WikidataQ93097 ScholiaQ93097MaRDI QIDQ964870

List of research outcomes

Publication	Date of Publication	Type
Cryptographic defense against traffic analysis	2015-05-07	Paper
Secure Key Exchange and Sessions without Credentials	2014-10-14	Paper
Relativized questions involving probabilistic algorithms	2014-03-14	Paper
The black-box query complexity of polynomial summation	2011-02-18	Paper
Characterizing sets of jobs that admit optimal greedy-like algorithms	2010-04-21	Paper
Password Mistyping in Two-Factor-Authenticated Key Exchange	2008-08-19	Paper
On Seed-Incompressible Functions	2008-03-05	Paper
Theory of Cryptography	2007-02-12	Paper
Lower bounds for concurrent zero knowledge	2006-01-26	Paper
Simple permutations mix well	2006-01-09	Paper
Automata, Languages and Programming	2005-08-24	Paper
(Incremental) priority algorithms	2005-02-11	Paper
https://portal.mardi4nfdi.de/entity/Q4829011	2004-11-29	Paper
CBC MAC for real-time data sources	2000-08-08	Paper
The knowledge complexity of interactive proof-systems	1997-11-13	Paper
A secure protocol for the oblivious transfer. (Extended abstract)	1996-11-24	Paper
https://portal.mardi4nfdi.de/entity/Q4035737	1993-05-18	Paper
https://portal.mardi4nfdi.de/entity/Q3211252	1991-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3348850	1990-01-01	Paper
The Knowledge Complexity of Interactive Proof Systems	1989-01-01	Paper
A study of password security	1989-01-01	Paper
How to Construct Pseudorandom Permutations from Pseudorandom Functions	1988-01-01	Paper
The Notion of Security for Probabilistic Cryptosystems	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3773819	1987-01-01	Paper
Relativized Questions Involving Probabilistic Algorithms	1982-01-01	Paper
Limitations on Separating Nondeterministic Complexity Classes	1981-01-01	Paper
Space Lower Bounds for Maze Threadability on Restricted Machines	1980-01-01	Paper
The computational complexity of logical theories	1979-01-01	Paper
The covering and boundedness problems for vector addition systems	1978-01-01	Paper
On the complexity of the theories of weak direct powers	1976-01-01	Paper
A Decision Procedure for the First Order Theory of Real Addition with Order	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4131018	1974-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4401928	1974-01-01	Paper

Research outcomes over time

This page was built for person: Charles W. Rackoff