The page of my PhD-thesis.

The page of a protocol analyser.

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. © IEEE. (Slides of the talk (replaced 19.10.2005)). A longer version (with proofs) is also available.

A Type System for Computationally Secure Information Flow (together with Varmo Vene). In proceedings of the 15th International Symposium on Fundamentals of Computation Theory, FCT 2005 (LNCS 3623), August 17-20, 2005, Lübeck, Germany, pages 365-377. © Springer-Verlag

Type Systems Equivalent to Data-Flow Analyses of Imperative Languages (Extended Abstract) (together with Tarmo Uustalu and Varmo Vene). In proceedings of the Third Workshop on Applied Semantics (APPSEM05), Frauenchiemsee, Germany, Septermber 12-15, 2005.

The journal version of this paper appeared in Theoretical Computer Science, volume 364, number 3, pages 292-310, 2006. (© Elsevier Science)

Universally Composable Time-Stamping Schemes with Audit (together with Ahto Buldas, Märt Saarepera and Jan Willemson). In Information Security, 8th International Conference, ISC 2005 (LNCS 3650), Singapore, September 20-23, 2005, pp 359-373. © Springer-Verlag

Digital Signature in Automatic Analyses for Confidentiality against Active Adversaries (together with Ilja Tšahhirov). In proceedings of Nordsec 2005, 10th Nordic Workshop on Secure IT Systems, Tartu, Estonia, October 20-21, 2005, pp 29-41.

Secrecy Types for a Simulatable Cryptographic Library. In proceedings of the 12th ACM Conference on Computer and Communications Security, Alexandria, VA, USA, November 7-11, 2005, pages 26-35. © ACM (Slides of a bit expanded version of the talk given at Estonian Theory Days in Viinistu)

Computationally Sound Secrecy Proofs by Mechanized Flow Analysis (together with Michael Backes). An extended abstract appeared at the proceedings of the 2nd workshop on Formal and Computational Cryptography, pages 1-6, July 9th, 2006, Venice, Italy (slides of the talk) and a fuller paper at the 13th ACM Conference on Computer and Communications Security, Alexandria, VA, USA, October 30th - November 3rd, 2006, pages 370-379. © ACM. The full paper can be accessed here.

Rational Choice of Security Measures via Multi-Parameter Attack Trees (together with Ahto Buldas, Jaan Priisalu, Märt Saarepera and Jan Willemson). In 1st International Workshop on Critical Information Infrastructures Security (CRITIS'06), August 30 - September 2, 2006, Samos Island, Greece. © Springer-Verlag

Application of Dependency Graphs to Security Protocol Analysis (together with Ilja Tšahhirov). In the 3rd Symposium on Trustworthy Global Computing (TGC 2007), November 5th - 6th, 2007, Sophia-Antipolis, France. © Springer-Verlag

On the Computational Soundness of Cryptographically Masked Flows. In the 35th Annual ACM SIGPLAN—SIGACT Symposium on Principles of Programming Languages (POPL), January 10th - 12th, 2008, San Francisco, CA, USA. © ACM

Typing Computationally Secure Information Flow in Jif (together with Liisi Haav). In proceedings of Nordsec 2008, 13th Nordic Workshop on Secure IT Systems, Lyngby, Denmark, October 9-10, 2008.

Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library (together with Long Ngo). In proceedings of ProvSec 2008 (LNCS 5324), the second conference on provable security, Shanghai, China, October 30 - November 1, 2008,, pp. 298 - 312. © Springer-Verlag

Formal Analysis of the Estonian Mobile-ID Protocol (together with Meelis Roos). In proceedings of Nordsec 2009, 14th Nordic Workshop on Secure IT Systems (LNCS 5838), Oslo, Norway, October 15-16, 2009, pp. 271-286. © Springer-Verlag

A user interface for a game-based protocol verification tool (together with Ilja Tšahhirov). In proceedings of the sixth International Workshop on Formal Aspects in Security and Trust (FAST2009), Eindhoven, Netherlands, November 5-6, 2009. © Springer-Verlag

On the (Im)possibility of Perennial Message Recognition Protocols without Public-Key Cryptography (together with Madeline González Muñiz). In proceedings of the 26th ACM Symposium on Applied Computing, Taichung, Taiwan, March 21-24, 2011. © ACM. See also the full paper.

Implementing Cryptographic Primitives in the Symbolic Model. In proceedings of the 3rd NASA Formal Methods Symposium, Pasadena, CA, USA, April 18-20, 2011. © Springer-Verlag.

Formal Security analysis of OpenID with GBA protocol (together with Abu Shohel Ahmed). In proceedings of the 3rd International ICST Conference on Security and Privacy in Mobile Information and Communication Systems, Aalborg, Denmark, May 17-19, 2011. © Springer-Verlag

Secure Mobile Access to Homecare Patients‘ Data (together with Sven Heiberg, Sigurður Másson and Claus Popp Larsen). In proceedings of ICEGOV 2011, Tallinn, Estonia, September 26-28, 2011. © ACM.

The Application of I-voting for Estonian Parliamentary Elections of 2011 (together with Sven Heiberg and Jan Willemson). In proceedings of VoteID 2011, Tallinn, Estonia, September 29-30, 2011. © Springer-Verlag.

Securing the Future — an Information Flow Analysis of a Distributed OO Language (together with Martin Pettai). In proceedings of SOFSEM 2012, Špindlerův Mlýn, Czech Republic, January 21-27, 2012. © Springer-Verlag. The full version is also available.

Symbolic Analysis of Cryptographic Protocols Containing Bilinear Pairings (together with Alisa Pankova). In proceedings of CSF 2012, Cambridge, MA, USA, June 25-27, 2012. © IEEE. The full version is also available.

Secure Implementation of Asynchronous Method Calls and Futures. In proceedings of Intrust 2012, Royal Holloway, University of London, UK, December 17-18, 2012. © Springer-Verlag.

New Attacks against Transformation-Based Privacy-Preserving Linear Programming (together with Alisa Pankova). In proceedings of the 9th Security and Trust Management Workshop, STM 2013 (LNCS 8203), Royal Holloway, University of London, UK, September 12-13, 2013. © Springer-Verlag.

Dynamics and Secure Information Flow for a Higher-Order Pi-Calculus (together with Martin Pettai). In proceedings of Nordsec 2013, 18th Nordic Workshop on Secure IT Systems (LNCS 8208), Ilulissat, Greenland, October 18-21, 2013. © Springer-Verlag.

Domain-polymorphic language for privacy-preserving applications (together with Dan Bogdanov and Jaak Randmets). In proceedings of the 2013 ACM Workshop on Language Support for Privacy-Enhancing Technologies, PETShop'13, Berlin, Germany, November 4th, 2013. © ACM. The full version of the paper is also available.

Specifying Sharemind's arithmetic black box (together with Alisa Pankova, Martin Pettai and Jaak Randmets). In proceedings of the 2013 ACM Workshop on Language Support for Privacy-Enhancing Technologies, PETShop'13, Berlin, Germany, November 4th, 2013. © ACM.

On the (Im)possibility of privately outsourcing linear programming (together with Alisa Pankova). In proceedings of the 2013 ACM Cloud Computing Security Workshop, Berlin, Germany, November 8th, 2013. © ACM.

From Input Private to Universally Composable Secure Multiparty Computation Primitives (together with Dan Bogdanov, Sven Laur and Pille Pullonen). In the proceedings of the 27th IEEE Computer Security Foundations Symposium, CSF 2014, Vienna, Austria, July 19-22, 2014. © IEEE.

Private Intersection of Regular Languages (together with Roberto Guanciale and Dilian Gurov). In the proceedings of the Twelfth Annual Conference on Privacy, Security and Trust (PST 2014), Toronto, Canada, July 23-24, 2014. © IEEE.

Domain-Polymorphic Programming of Privacy-Preserving Applications (together with Dan Bogdanov and Jaak Randmets). In the proceedings of ACM Ninth Workshop on Programming Languages and Analysis for Security (PLAS 2014), Uppsala, Sweden, July 29, 2014. © ACM.

Verifiable Computation in Multiparty Protocols with Honest Majority (together with Alisa Pankova). In the proceedings of 8th International Conference on Provable Security, ProvSec 2014 (LNCS 8782), Hong Kong, October 9-10, 2014. © Springer.

Bounded Pre-image Awareness and the Security of Hash-Tree Keyless Signatures (together with Ahto Buldas, Risto Laanoja and Ahto Truu). In the proceedings of 8th International Conference on Provable Security, ProvSec 2014 (LNCS 8782), Hong Kong, October 9-10, 2014. © Springer.

Composable Oblivious Extended Permutations (together with Jan Willemson). In the proceedings of 7th International symposium on Foundations and Practice of Security, FPS 2014 (LNCS 8930), Montreal, Canada, November 3-5, 2014. © Springer.

A Private Lookup Protocol with Low Online Complexity for Secure Multiparty Computation. In the proceedings of 16th International Conference on Information and Communications Security, ICICS 2014 (LNCS 8958), Hong Kong, December 16-17, 2014. © Springer.

Parallel Oblivious Array Access for Secure Multiparty Computation and Privacy-Preserving Minimum Spanning Trees. Proceedings on Privacy Enhancing Technologies. Volume 2015, Issue 2, Pages 188-205. Presented at the 15th Privacy Enhancing Technologies Symposium, PETS 2015, Philadelphia, PA, USA, June 30th - July 2nd, 2015.

Automatic Proofs of Privacy of Secure Multi-Party Computation Protocols Against Active Adversaries (together with Martin Pettai). In the proceedings of the 28th IEEE Computer Security Foundations Symposium, CSF 2015, Verona, Italy, July 14-17, 2015. © IEEE.

Privacy Preserving Business Process Matching (together with Roberto Guanciale and Dilian Gurov). In the proceedings of the 13th Annual Conference on Privacy, Security and Trust (PST 2015), Izmir, Turkey, July 21-23, 2015. © IEEE.

A Domain-Specific Language for Low-Level Secure Multiparty Computation Protocols (together with Jaak Randmets). In proceedings of the 22nd ACM Conference on Computer and Communications Security, Denver, CO, USA, October 12-16, 2015.

Combining Differential Privacy and Secure Multiparty Computation (together with Martin Pettai). In proceedings of the 31st Annual Computer Security Applications Conference (ACSAC 2015), Los Angeles, CA, USA, December 7-11, 2015.

Optimizing MPC for robust and scalable integer and floating-point arithmetic (together with Liisi Kerik and Jaak Randmets). In proceedings of the 4th Workshop on Encrypted Computing and Applied Homomorphic Cryptography (WAHC 2016), Barbados, February 26th, 2016. © Springer.

Differential Privacy Analysis of Data Processing Workflows (together with Marlon Dumas and Luciano Garcia Bañuelos). In proceedings of the Third International Workshop on Graphical Models for Security (GraMSec 2016) Lisbon, Portugal, June 27th, 2016. © Springer.

Securing Multiparty Protocols against the Exposure of Data to Honest Parties (together with Alisa Pankova). In proceedings of the 11th DPM International Workshop on Data Privacy Management (DPM 2016), Heraklion, Greece, September 26-27, 2016. © Springer. Full version

Secure Multiparty Sorting Protocols with Covert Privacy (together with Martin Pettai). In proceedings of the 21st Nordic Conference on Secure IT Systems (NordSec 2016), Oulu, Finland, November 2-4, 2016. © Springer.

Optimizing Secure Computation Programs with Private Conditionals (together with Alisa Pankova). In proceedings of the 18th International Conference on Information and Communications Security (ICICS2016), Singapore, November 29th — December 2nd, 2016. © Springer. Full version

Combining Differential Privacy and Mutual Information for Analyzing Leakages in Workflows (together with Martin Pettai). In proceedings of the 6th International Conference on Principles of Security and Trust (POST), Uppsala, Sweden, April 24-25, 2017. © Springer.

Preprocessing Based Verification of Multiparty Protocols with Honest Majority (together with Alisa Pankova and Roman Jagomägis). Proceedings on Privacy Enhancing Technologies. Volume 2017, Issue 4, Pages 19-72. Presented at the 17th Privacy Enhancing Technologies Symposium, PETS 2017, Minneapolis, MN, USA, July 18-21, 2017.

Server-Supported RSA Signatures for Mobile Devices (together with Ahto Buldas, Aivo Kalu and Mart Oruaas). In proceedings of the 22nd European Symposium on Research in Computer Security (ESORICS 2017), Oulu, Norway, September 11-13, 2017. © Springer.

Privacy-preserving Frequent Itemset Mining for Sparse and Dense Data (together with Alisa Pankova). In proceedings of the 22nd Nordic Conference on Secure IT Systems (NordSec 2017), Tartu, Estonia, November 8-10, 2017. © Springer.

Edited

Information Security Technology for Applications — 16th Nordic Conference on Secure IT Systems, NordSec 2011, Tallinn, Estonia, October 26-28, 2011, Revised Selected Papers. LNCS 7161, Springer 2012.

Applications of Secure Multiparty Computation (together with Liina Kamm), Cryptology and Information Security Series 13, IOS Press, 2015.

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.

A Type System for Computationally Secure Information Flow (together with Varmo Vene). Research report IT-LU-O-043-050307 of Cybernetica AS, 2005.

Slides of some talks


e-mail: peeter(dot)laud(at)cyber(dot)ee