Peeter Laud

1.6k total citations
48 papers, 417 citations indexed

About

Peeter Laud is a scholar working on Artificial Intelligence, Computer Networks and Communications and Information Systems. According to data from OpenAlex, Peeter Laud has authored 48 papers receiving a total of 417 indexed citations (citations by other indexed papers that have themselves been cited), including 39 papers in Artificial Intelligence, 12 papers in Computer Networks and Communications and 11 papers in Information Systems. Recurrent topics in Peeter Laud's work include Cryptography and Data Security (32 papers), Privacy-Preserving Technologies in Data (16 papers) and Complexity and Algorithms in Graphs (11 papers). Peeter Laud is often cited by papers focused on Cryptography and Data Security (32 papers), Privacy-Preserving Technologies in Data (16 papers) and Complexity and Algorithms in Graphs (11 papers). Peeter Laud collaborates with scholars based in Estonia, United States and Germany. Peeter Laud's co-authors include Ahto Buldas, Helger Lipmaa, Dan Bogdanov, Michael Backes, Eero Vainikko, Varmo Vene, Tarmo Uustalu, Liina Kamm, Sven Laur and Duško Pavlović and has published in prestigious journals such as SHILAP Revista de lepidopterología, IEEE Transactions on Ultrasonics Ferroelectrics and Frequency Control and Theoretical Computer Science.

In The Last Decade

Peeter Laud

43 papers receiving 387 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Peeter Laud Estonia 12 367 156 139 75 39 48 417
Yaron Sella Israel 3 424 1.2× 83 0.5× 133 1.0× 109 1.5× 38 1.0× 3 476
Oriol Farràs Spain 12 321 0.9× 90 0.6× 136 1.0× 88 1.2× 43 1.1× 27 402
Ranjit Kumaresan United States 8 365 1.0× 109 0.7× 294 2.1× 64 0.9× 16 0.4× 10 451
Fatih Emekçi United States 9 245 0.7× 177 1.1× 236 1.7× 22 0.3× 33 0.8× 11 401
Francesco Santini Italy 11 277 0.8× 112 0.7× 175 1.3× 29 0.4× 50 1.3× 74 417
Jennie Rogers United States 10 202 0.6× 191 1.2× 131 0.9× 22 0.3× 31 0.8× 15 376
Arjun Narayan United States 8 262 0.7× 135 0.9× 99 0.7× 28 0.4× 34 0.9× 10 361
Valeria Nikolaenko United States 4 533 1.5× 65 0.4× 164 1.2× 66 0.9× 43 1.1× 9 588
Melek Önen France 14 355 1.0× 228 1.5× 245 1.8× 33 0.4× 63 1.6× 55 590
Kazue Sako Japan 12 389 1.1× 98 0.6× 141 1.0× 41 0.5× 49 1.3× 36 459

Countries citing papers authored by Peeter Laud

Since Specialization
Citations

This map shows the geographic impact of Peeter Laud's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Peeter Laud with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Peeter Laud more than expected).

Fields of papers citing papers by Peeter Laud

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Peeter Laud. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Peeter Laud. The network helps show where Peeter Laud may publish in the future.

Co-authorship network of co-authors of Peeter Laud

This figure shows the co-authorship network connecting the top 25 collaborators of Peeter Laud. A scholar is included among the top collaborators of Peeter Laud based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Peeter Laud. Peeter Laud is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Laud, Peeter, et al.. (2025). Privacy-Preserving Server-Supported Decryption. 127–142. 1 indexed citations
2.
Laud, Peeter, et al.. (2024). Identifying Obstacles of PQC Migration in E-Estonia. 63–81. 1 indexed citations
3.
4.
Laud, Peeter, et al.. (2024). TOPCOAT: towards practical two-party Crystals-Dilithium. Discover Computing. 27(1). 1 indexed citations
5.
Laud, Peeter, et al.. (2020). A Framework of Metrics for Differential Privacy from Local Sensitivity. SHILAP Revista de lepidopterología. 2020(2). 175–208. 10 indexed citations
6.
Laud, Peeter, et al.. (2018). Privacy-preserving record linkage in large databases using secure multiparty computation. BMC Medical Genomics. 11(S4). 84–84. 20 indexed citations
7.
Laud, Peeter, et al.. (2015). A Domain-Specific Language for Low-Level Secure Multiparty Computation Protocols. 1492–1503. 9 indexed citations
8.
Laud, Peeter & Liina Kamm. (2015). Applications of secure multiparty computation. CERN Document Server (European Organization for Nuclear Research). 5 indexed citations
9.
Laud, Peeter, et al.. (2015). Combining Differential Privacy and Secure Multiparty Computation. 421–430. 53 indexed citations
10.
Bogdanov, Dan, et al.. (2014). From Input Private to Universally Composable Secure Multi-party Computation Primitives. 184–198. 10 indexed citations
11.
Guanciale, Roberto, Dilian Gurov, & Peeter Laud. (2014). Private intersection of regular languages. KTH Publication Database DiVA (KTH Royal Institute of Technology). 112–120. 2 indexed citations
12.
Bogdanov, Dan, et al.. (2014). Domain-Polymorphic Programming of Privacy-Preserving Applications. 53–65. 15 indexed citations
13.
Laud, Peeter, et al.. (2012). Symbolic Analysis of Cryptographic Protocols Containing Bilinear Pairings. 5663. 63–77. 5 indexed citations
14.
Laud, Peeter, et al.. (2010). Digital time stamping system based on open source technologies. IEEE Transactions on Ultrasonics Ferroelectrics and Frequency Control. 57(3). 721–727. 2 indexed citations
15.
Laud, Peeter. (2008). On the computational soundness of cryptographically masked flows. 337–348. 20 indexed citations
16.
Laud, Peeter, Tarmo Uustalu, & Varmo Vene. (2006). Type systems equivalent to data-flow analyses for imperative languages. Theoretical Computer Science. 364(3). 292–310. 12 indexed citations
17.
Laud, Peeter. (2005). Secrecy types for a simulatable cryptographic library. 26–35. 33 indexed citations
18.
Laud, Peeter, et al.. (2002). Eliminating counterevidence with applications to accountable certificate management. Journal of Computer Security. 4 indexed citations
19.
Laud, Peeter. (2002). Encryption Cycles and Two Views of Cryptography. 3 indexed citations
20.
Buldas, Ahto & Peeter Laud. (1998). New linking schemes for digital time-stamping.. 3–13. 13 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Yaron Sella Breakdown of academic impact, for papers by Oriol Farràs Breakdown of academic impact, for papers by Ranjit Kumaresan Breakdown of academic impact, for papers by Fatih Emekçi Breakdown of academic impact, for papers by Francesco Santini Breakdown of academic impact, for papers by Jennie Rogers Breakdown of academic impact, for papers by Arjun Narayan Breakdown of academic impact, for papers by Valeria Nikolaenko Breakdown of academic impact, for papers by Melek Önen Breakdown of academic impact, for papers by Kazue Sako
Rankless by CCL
2026