Time-Stamping with Binary Linking Schemes. - Ahto Buldas; Peeter Laud; Helger Lipmaa; Jan Willemson (CRYPTO, 1998)

New linking schemes for digital time-stamping. - Ahto Buldas; Peeter Laud (ICISC, 1998)

Accountable Certificate Management using Undeniable Attestations. - Ahto Buldas; Peeter Laud; Helger Lipmaa (IACR Cryptol. ePrint Arch., 2000)

Semantics and Program Analysis of Computationally Secure Information Flow. - Peeter Laud (ESOP, 2001)

Eliminating Counterevidence with Applications to Accountable Certificate Management. - Ahto Buldas; Peeter Laud; Helger Lipmaa (J. Comput. Secur., 2002)

Computationally secure information flow. - Peeter Laud (2002)

Handling Encryption in an Analysis for Secure Information Flow. - Peeter Laud (ESOP, 2003)

Sound Computational Interpretation of Formal Encryption with Composed Keys. - Peeter Laud; Ricardo Corin (ICISC, 2003)

Symmetric Encryption in Automatic Analyses for Confidentiality against Active Adversaries. - Peeter Laud (S&P, 2004)

Secrecy types for a simulatable cryptographic library. - Peeter Laud (CCS, 2005)

A Type System for Computationally Secure Information Flow. - Peeter Laud; Varmo Vene (FCT, 2005)

Universally Composable Time-Stamping Schemes with Audit. - Ahto Buldas; Peeter Laud; Märt Saarepera; Jan Willemson (IACR Cryptol. ePrint Arch., 2005)

Rational Choice of Security Measures Via Multi-parameter Attack Trees. - Ahto Buldas; Peeter Laud; Jaan Priisalu; Märt Saarepera; Jan Willemson (CRITIS, 2006)

Computationally Sound Secrecy Proofs by Mechanized Flow Analysis. - Michael Backes 001; Peeter Laud (IACR Cryptol. ePrint Arch., 2006)

Type systems equivalent to data-flow analyses for imperative languages. - Peeter Laud; Tarmo Uustalu; Varmo Vene (Theor. Comput. Sci., 2006)

Application of Dependency Graphs to Security Protocol Analysis. - Ilja Tsahhirov; Peeter Laud (TGC, 2007)

On the computational soundness of cryptographically masked flows. - Peeter Laud (POPL, 2008)

Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library. - Peeter Laud; Long Ngo (IACR Cryptol. ePrint Arch., 2008)

A User Interface for a Game-Based Protocol Verification Tool. - Peeter Laud; Ilja Tsahhirov (Formal Aspects in Security and Trust, 2009)

Formal Analysis of the Estonian Mobile-ID Protocol. - Peeter Laud; Meelis Roos (NordSec, 2009)

Secure mobile access to homecare patients' data. - Sven Heiberg; Peeter Laud; Sigurðr Másson; Claus Popp Larsen (ICEGOV, 2011)

Formal Security Analysis of OpenID with GBA Protocol. - Abu Shohel Ahmed; Peeter Laud (MobiSec, 2011)

Implementing Cryptographic Primitives in the Symbolic Model. - Peeter Laud (NASA Formal Methods, 2011)

On the (im)possibility of perennial message recognition protocols without public-key cryptography. - Madeline González Muñiz; Peeter Laud (SAC, 2011)

The Application of I-Voting for Estonian Parliamentary Elections of 2011. - Sven Heiberg; Peeter Laud; Jan Willemson (VoteID, 2011)

Strong Forward Security in Identity-Based Signcryption. - Madeline González Muñiz; Peeter Laud (IACR Cryptol. ePrint Arch., 2011)

Symbolic Analysis of Cryptographic Protocols Containing Bilinear Pairings. - Alisa Pankova; Peeter Laud (CSF, 2012)

Secure Implementation of Asynchronous Method Calls and Futures. - Peeter Laud (INTRUST, 2012)

Securing the Future - An Information Flow Analysis of a Distributed OO Language. - Martin Pettai; Peeter Laud (SOFSEM, 2012)

Domain-polymorphic language for privacy-preserving applications. - Dan Bogdanov; Peeter Laud; Jaak Randmets (PETShop@CCS, 2013)

On the (Im)possibility of privately outsourcing linear programming. - Peeter Laud; Alisa Pankova (CCSW, 2013)

Specifying sharemind's arithmetic black box. - Peeter Laud; Alisa Pankova; Martin Pettai; Jaak Randmets (PETShop@CCS, 2013)

Dynamics and Secure Information Flow for a Higher-Order Pi-Calculus. - Martin Pettai; Peeter Laud (NordSec, 2013)

Domain-Polymorphic Programming of Privacy-Preserving Applications. - Dan Bogdanov; Peeter Laud; Jaak Randmets (IACR Cryptol. ePrint Arch., 2013)

New Attacks against Transformation-Based Privacy-Preserving Linear Programming. - Peeter Laud; Alisa Pankova (IACR Cryptol. ePrint Arch., 2013)

Universally composable privacy preserving finite automata execution with low online and offline complexity. - Peeter Laud; Jan Willemson (IACR Cryptol. ePrint Arch., 2013)

From Input Private to Universally Composable Secure Multi-party Computation Primitives. - Dan Bogdanov; Peeter Laud; Sven Laur; Pille Pullonen (CSF, 2014)

A Private Lookup Protocol with Low Online Complexity for Secure Multiparty Computation. - Peeter Laud (ICICS, 2014)

Private intersection of regular languages. - Roberto Guanciale; Dilian Gurov; Peeter Laud (PST, 2014)

From Input Private to Universally Composable Secure Multiparty Computation Primitives. - Dan Bogdanov; Peeter Laud; Sven Laur; Pille Pullonen (IACR Cryptol. ePrint Arch., 2014)

Bounded Pre-Image Awareness and the Security of Hash-Tree Keyless Signatures. - Ahto Buldas; Risto Laanoja; Peeter Laud; Ahto Truu (IACR Cryptol. ePrint Arch., 2014)

Efficient Oblivious Parallel Array Reads and Writes for Secure Multiparty Computation. - Peeter Laud (IACR Cryptol. ePrint Arch., 2014)

Verifiable Computation in Multiparty Protocols with Honest Majority. - Peeter Laud; Alisa Pankova (IACR Cryptol. ePrint Arch., 2014)

Composable Oblivious Extended Permutations. - Peeter Laud; Jan Willemson (IACR Cryptol. ePrint Arch., 2014)

Automatic Proofs of Privacy of Secure Multi-Party Computation Protocols Against Active Adversaries. - Martin Pettai; Peeter Laud (IACR Cryptol. ePrint Arch., 2014)

A Domain-Specific Language for Low-Level Secure Multiparty Computation Protocols. - Peeter Laud; Jaak Randmets (CCS, 2015)

Privacy preserving business process matching. - Dilian Gurov; Peeter Laud; Roberto Guanciale (PST, 2015)

Transformation-Based Outsourcing of Linear Equation Systems over Real Numbers. - Peeter Laud; Alisa Pankova (IACR Cryptol. ePrint Arch., 2015)

Privacy-preserving Frequent Itemset Mining for Sparse and Dense Data. - Peeter Laud; Alisa Pankova (IACR Cryptol. ePrint Arch., 2015)

Preprocessing-Based Verification of Multiparty Protocols with Honest Majority. - Peeter Laud; Alisa Pankova (IACR Cryptol. ePrint Arch., 2015)

Combining Differential Privacy and Secure Multiparty Computation. - Martin Pettai; Peeter Laud (IACR Cryptol. ePrint Arch., 2015)

Parallel Oblivious Array Access for Secure Multiparty Computation and Privacy-Preserving Minimum Spanning Trees. - Peeter Laud (Proc. Priv. Enhancing Technol., 2015)

Differential Privacy Analysis of Data Processing Workflows. - Marlon Dumas; Luciano García-Bañuelos; Peeter Laud (GraMSec@CSF, 2016)

Optimizing MPC for Robust and Scalable Integer and Floating-Point Arithmetic. - Liisi Kerik; Peeter Laud; Jaak Randmets (Financial Cryptography Workshops, 2016)

Secure Multiparty Sorting Protocols with Covert Privacy. - Peeter Laud; Martin Pettai (NordSec, 2016)

Securing Multiparty Protocols against the Exposure of Data to Honest Parties. - Peeter Laud; Alisa Pankova (IACR Cryptol. ePrint Arch., 2016)

Optimizing Secure Computation Programs with Private Conditionals. - Peeter Laud; Alisa Pankova (IACR Cryptol. ePrint Arch., 2016)

Server-Supported RSA Signatures for Mobile Devices. - Ahto Buldas; Aivo Kalu; Peeter Laud; Mart Oruaas (ESORICS (1), 2017)

Combining Differential Privacy and Mutual Information for Analyzing Leakages in Workflows. - Martin Pettai; Peeter Laud (POST, 2017)

Preprocessing Based Verification of Multiparty Protocols with Honest Majority. - Peeter Laud; Alisa Pankova; Roman Jagomägis (Proc. Priv. Enhancing Technol., 2017)

Bit Decomposition Protocols in Secure Multiparty Computation. - Peeter Laud; Alisa Pankova (WAHC@CCS, 2018)

Sensitivity Analysis of SQL Queries. - Peeter Laud; Martin Pettai; Jaak Randmets (PLAS@CCS, 2018)

Disclosure Analysis of SQL Workflows. - Marlon Dumas; Luciano García-Bañuelos; Peeter Laud (GraMSec@FLoC, 2018)

Achieving Differential Privacy using Methods from Calculus. - Peeter Laud; Alisa Pankova; Martin Pettai (CoRR, 2018)

Mapping the Information Flows for the Architecture of a Nationwide Situation Awareness System : (Poster). - Hayretdin Bahsi; Veiko Dieves; Taivo Kangilaski; Peeter Laud; Leo Motus; Jaan Murumets; Illimar Ploom; Jaan Priisalu; Mari Seeba; Ermo Täks; Kaide Tammel; Piia Tammpuu; et al. (CogSIMA, 2019)

Business Process Privacy Analysis in Pleak. - Aivo Toots; Reedik Tuuling; Maksym Yerokhin; Marlon Dumas; Luciano García-Bañuelos; Peeter Laud; Raimundas Matulevicius; Alisa Pankova; Martin Pettai; Pille Pullonen; Jake Tom (FASE, 2019)

Accelerate Performance for Elliptic Curve Scalar Multiplication based on NAF by Parallel Computing. - Mohammad Anagreh; Eero Vainikko; Peeter Laud (ICISSP, 2019)

Business Process Privacy Analysis in Pleak - (Extended Abstract). - Aivo Toots; Reedik Tuuling; Maksym Yerokhin; Marlon Dumas; Luciano García-Bañuelos; Peeter Laud; Raimundas Matulevicius; Alisa Pankova; Martin Pettai; Pille Pullonen; Jake Tom (Inform. Spektrum, 2019)

Shareprom: A Tool for Privacy-Preserving Inter-Organizational Process Mining. - Gamal Elkoumy; Stephan A. Fahrenkrog-Petersen; Marlon Dumas; Peeter Laud; Alisa Pankova; Matthias Weidlich 001 (BPM (PhD/Demos), 2020)

Secure Multi-party Computation for Inter-organizational Process Mining. - Gamal Elkoumy; Stephan A. Fahrenkrog-Petersen; Marlon Dumas; Peeter Laud; Alisa Pankova; Matthias Weidlich 001 (BPMDS/EMMSAD@CAiSE, 2020)

Speeding Up the Computation of Elliptic Curve Scalar Multiplication based on CRT and DRM. - Mohammad Anagreh; Eero Vainikko; Peeter Laud (ICISSP, 2020)

A Framework of Metrics for Differential Privacy from Local Sensitivity. - Peeter Laud; Alisa Pankova; Martin Pettai (Proc. Priv. Enhancing Technol., 2020)

Attribute-based encryption for named data networking. - Aleksandr Lenin; Peeter Laud (ICN, 2021)

Linear-Time Oblivious Permutations for SPDZ. - Peeter Laud (CANS, 2021)

Parallel Privacy-preserving Computation of Minimum Spanning Trees. - Mohammad Anagreh; Eero Vainikko; Peeter Laud (ICISSP, 2021)

Parallel Privacy-Preserving Shortest Paths by Radius-Stepping. - Mohammad Anagreh; Eero Vainikko; Peeter Laud (PDP, 2021)

Decision Support for Sharing Data using Differential Privacy. - Mark F. St. John; Grit Denker; Peeter Laud; Karsten Martiny; Alisa Pankova; Dusko Pavlovic (VizSec, 2021)

Content Confidentiality in Named Data Networking. - Aleksandr Lenin; Peeter Laud (CoRR, 2021)

Parallel Privacy-Preserving Shortest Path Algorithms. - Mohammad Anagreh; Peeter Laud; Eero Vainikko (Cryptogr., 2021)

Efficient permutation protocol for MPC in the head. - Peeter Laud (IACR Cryptol. ePrint Arch., 2021)

Interpreting Epsilon of Differential Privacy in Terms of Advantage in Guessing or Approximating Sensitive Attributes. - Alisa Pankova; Peeter Laud (CSF, 2022)

A Parallel Privacy-Preserving Shortest Path Protocol from a Path Algebra Problem. - Mohammad Anagreh; Peeter Laud (DPM/CBT@ESORICS, 2022)

A Comparison-Based Methodology for the Security Assurance of Novel Systems. - Peeter Laud; Jelizaveta Vakarjuk (CyberICPS/SECPRE/SPOSE/CPS4CIP/CDT&SECOMAN/EIS/SecAssure@ESORICS, 2022)

Privacy-preserving Parallel Computation of Shortest Path Algorithms with Low Round Complexity. - Mohammad Anagreh; Peeter Laud; Eero Vainikko (ICISSP, 2022)

ZK-SecreC: a Domain-Specific Language for Zero Knowledge Proofs. - Dan Bogdanov; Joosep Jääger; Peeter Laud; Härmel Nestra; Martin Pettai; Jaak Randmets; Ville Sokk; Kert Tali; Sandhra-Mirella Valdma (CoRR, 2022)

DiLizium 2.0: Revisiting Two-Party Crystals-Dilithium. - Peeter Laud; Nikita Snetkov; Jelizaveta Vakarjuk (IACR Cryptol. ePrint Arch., 2022)

Privacy-Preserving Parallel Computation of Minimum Spanning Forest. - Mohammad Anagreh; Peeter Laud; Eero Vainikko (SN Comput. Sci., 2022)

Multi-level privacy analysis of business processes: the Pleak toolset. - Marlon Dumas; Luciano García-Bañuelos; Joosep Jääger; Peeter Laud; Raimundas Matulevicius; Alisa Pankova; Martin Pettai; Pille Pullonen-Raudvere; Aivo Toots; Reedik Tuuling; Maksym Yerokhin (Int. J. Softw. Tools Technol. Transf., 2022)

CACS: A Cloud Privacy-Preserving Attribute Management System. - Aivo Kalu; Burak Can Kus; Peeter Laud; Kin Long Leung; Nikita Snetkov; Jelizaveta Vakarjuk (ARES, 2023)

TEADAL: Trustworthy, Energy-Aware federated DAta Lakes along the computing continuum. - Pierluigi Plebani; Ronen I. Kat; Frank Pallas; Sebastian Werner 001; Giacomo Inches; Peeter Laud; Rita Santiago (CAiSE Research Projects Exhibition, 2023)

Server-Supported Decryption for Mobile Devices. - Johanna Maria Kirss; Peeter Laud; Nikita Snetkov; Jelizaveta Vakarjuk (IACR Cryptol. ePrint Arch., 2023)

ZK-SecreC: a Domain-Specific Language for Zero-Knowledge Proofs. - Dan Bogdanov; Joosep Jääger; Peeter Laud; Härmel Nestra; Martin Pettai; Jaak Randmets; Raul-Martin Rebane; Ville Sokk; Kert Tali; Sandhra-Mirella Valdma (CSF, 2024)

Identifying Obstacles of PQC Migration in E-Estonia. - Jelizaveta Vakarjuk; Nikita Snetkov; Peeter Laud (CyCon, 2024)

Privacy-preserving server-supported decryption. - Peeter Laud; Alisa Pankova; Jelizaveta Vakarjuk (CoRR, 2024)

Security Proof of Single-Source Shortest Distance Protocols Built on Secure Multiparty Computation Protocols. - Mohammad Anagreh; Peeter Laud (Cryptogr., 2024)

Novel approximations of elementary functions in zero-knowledge proofs. - Kaarel August Kurik; Peeter Laud (IACR Cryptol. ePrint Arch., 2024)

Universally Composable Server-Supported Signatures for Smartphones. - Nikita Snetkov; Jelizaveta Vakarjuk; Peeter Laud (IACR Cryptol. ePrint Arch., 2024)

TOPCOAT: towards practical two-party Crystals-Dilithium. - Nikita Snetkov; Jelizaveta Vakarjuk; Peeter Laud (Discov. Comput., 2024)

Zero-Knowledge Proof-of-Location Protocols for Vehicle Subsidies and Taxation Compliance. - Dan Bogdanov; Eduardo Brito; Annika Jaakson; Peeter Laud; Raul-Martin Rebane (ARES (EU Projects Symposium Workshops 1), 2025)

Two-Party ECDSA with JavaCard-Based Smartcards. - Antonín Dufka; Peeter Laud; Petr Svenda (ACNS (2), 2025)

Trilithium: Efficient and Universally Composable Distributed ML-DSA Signing. - Antonín Dufka; Semjon Kravtsenko; Peeter Laud; Nikita Snetkov (IACR Cryptol. ePrint Arch., 2025)