Notice: Unexpected clearActionName after getActionName already called in /var/www/html/includes/context/RequestContext.php on line 338
Charles W. Rackoff - MaRDI portal

Charles W. Rackoff

From MaRDI portal
(Redirected from Person:626614)
Person:964870

Available identifiers

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

List of research outcomes

PublicationDate of PublicationType
Cryptographic defense against traffic analysis2015-05-07Paper
Secure Key Exchange and Sessions without Credentials2014-10-14Paper
Relativized questions involving probabilistic algorithms2014-03-14Paper
The black-box query complexity of polynomial summation2011-02-18Paper
Characterizing sets of jobs that admit optimal greedy-like algorithms2010-04-21Paper
Password Mistyping in Two-Factor-Authenticated Key Exchange2008-08-19Paper
On Seed-Incompressible Functions2008-03-05Paper
Theory of Cryptography2007-02-12Paper
Lower bounds for concurrent zero knowledge2006-01-26Paper
Simple permutations mix well2006-01-09Paper
Automata, Languages and Programming2005-08-24Paper
(Incremental) priority algorithms2005-02-11Paper
https://portal.mardi4nfdi.de/entity/Q48290112004-11-29Paper
CBC MAC for real-time data sources2000-08-08Paper
The knowledge complexity of interactive proof-systems1997-11-13Paper
A secure protocol for the oblivious transfer. (Extended abstract)1996-11-24Paper
https://portal.mardi4nfdi.de/entity/Q40357371993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q32112521991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33488501990-01-01Paper
A study of password security1989-01-01Paper
The Knowledge Complexity of Interactive Proof Systems1989-01-01Paper
The Notion of Security for Probabilistic Cryptosystems1988-01-01Paper
How to Construct Pseudorandom Permutations from Pseudorandom Functions1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37738191987-01-01Paper
Relativized Questions Involving Probabilistic Algorithms1982-01-01Paper
Limitations on Separating Nondeterministic Complexity Classes1981-01-01Paper
Space Lower Bounds for Maze Threadability on Restricted Machines1980-01-01Paper
The computational complexity of logical theories1979-01-01Paper
The covering and boundedness problems for vector addition systems1978-01-01Paper
On the complexity of the theories of weak direct powers1976-01-01Paper
A Decision Procedure for the First Order Theory of Real Addition with Order1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41310181974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44019281974-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Charles W. Rackoff