Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456
Peeter Laud
[go: Go Back, main page]

The page of my PhD-thesis.

Publications

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)

Encryption Cycles and Two Views of Cryptography. In NORDSEC 2002 - Proceedings of the 7th Nordic Workshop on Secure IT Systems (Karlstad University Studies 2002:31), pages 85-100, Karlstad, Sweden, November 7-8, 2002. (Slides of the talk)

Pseudorandom permutations and equivalence of formal expressions (abstract). In the 14th Nordic Workshop on Programming Theory, NWPT'02, pages 63-65, Tallinn, Estonia, November 20-22, 2002. (Slides of the talk)

Handling Encryption in an Analysis for Secure Information Flow. In Programming Languages and Systems, 12th European Symposium On Programming, ESOP 2003 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003 Warsaw, Poland, April 7-11, 2003 Proceedings (LNCS 2618), pages 159-173, 2003. © Springer-Verlag (Slides of the talk)

Improving the Gnutella protocol against poisoning (together with Meelis Roos and Jan Willemson). In proceedings of NORDSEC 2003, Gjøvik, Norway, October 15-17, 2003.

Sound Computational Interpretation of Formal Encryption with Composed Keys (together with Ricardo Corin). In Information Security and Cryptology - ICISC 2003, 6th International Conference, Seoul, Korea, November 2003, Revised Papers (LNCS 2971), pages 55-66, 2004. © Springer-Verlag (Slides of the talk)

Symmetric encryption in automatic analyses for confidentiality against active adversaries, in proceedings of 2004 IEEE Symposium on Security and Privacy, pages 71-85, Oakland, CA, May 9-12, 2004 (Slides of the talk). A longer version (with proofs) is also available.

Unrefereed publications

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.

Relative Secrecy and Semantics of Declassification. Research report IT-AR-O-029-040227 of Cybernetica AS, 2004.

Slides of some talks


e-mail: peeter(underscore)l(at)ut(dot)ee