Capturing LOGSPACE over Hereditarily-Finite Sets
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Using Agents for Concurrent Querying of Web-Like Databases via a Hyper-Set-Theoretic Approach
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
Implicit complexity over an arbitrary structure: Quantifier alternations
Information and Computation
Computability over an arbitrary structure: sequential and parallel polynomial time
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Yuri, logic, and computer science
Fields of logic and computation
Quasi-interpretations and small space bounds
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Hi-index | 0.00 |
We define the class of trapdoor pseudo-random number generators, and introduce a new technique for using these in cryptography. As an application for this technique, we present a provably secure protocol for One-Bit Disclosures i.e. for giving a one-bit ...