My page at Cybernetica AS
My page at Institute of computer science of Tartu University
Time-Stamping with Binary Linking Schemes (together with Ahto Buldas, Helger Lipmaa and Jan Willemson). In Advances in Cryptology --- proceedings of CRYPTO '98 (LNCS 1462), pages 486--501, 1998. © Springer-Verlag.
New Linking Schemes for Digital Time-Stamping (together with Ahto Buldas). In The 1st International Conference on Information Security and Cryptology, pages 3--14, Seoul, Korea, December 18--19, 1998. © Korea Institute of Information Security and Cryptology.
Accountable Certificate Management using Undeniable Attestations (together with Ahto Buldas and Helger Lipmaa). In 7th ACM Conference on Computer and Communications Security, pages 9--18, Athens, Greece, November 1--4, 2000. © ACM.
Previous paper is superceded by its journal version Eliminating counterevidence with applications to accountable certificate management (same authors), Journal of Computer Security 10(2002), pages 273--296, IOS Press.
Semantics and Program Analysis of Computationally Secure Information Flow. In Programming Languages and Systems, 10th European Symposium On Programming, ESOP 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genoa, Italy, April 2-6, 2001 Proceedings (LNCS 2028), pages 77-91, 2001. © Springer-Verlag (Slides of the talk)
Analysis for Object Inlining in Java. In JOSES: Java Optimization Strategies for Embedded Systems, Genoa, Italy, April 1, 2001. (Slides of the talk)
Alamsõnad ja nende loendamine (Subwords and counting them). Semester work at Tartu University, 1997. (In Estonian with English resume)
Osaliselt tsüklilise monoidi Möbiuse funktsioonist (On the Möbius function of the partially cyclic monoid). BSc thesis, Tartu University, 1997. (In Estonian with English resume)
Üldistatud kontekstivabad grammatikad (Generalised context-free grammars). MSc thesis, Tartu University, 1998. (In Estonian with English resume. The same material is covered in the following two technical reports.)
Automata accepting coupled-context-free languages. Research report CS102/99 of the Software Department of the Institute of Cybernetics of Tallinn Technical University, 1999.
Ogden's lemma for coupled-context-free languages; the set of Lyndon words is not coupled-context-free. Research report CS103/99 of the Software Department of the Institute of Cybernetics of Tallinn Technical University, 1999.
Handling Encryption in Analyses for Secure Information Flow. In limbo (and has errors in the proof of correctness of the abstraction of the semantics of loops), 2001.