default search action
Sven Laur
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c26]Hendrik Suvalov, Sven Laur
, Raivo Kolde:
Information Extraction from Medical Texts with BERT Using Human-in-the-Loop Labeling. MIE 2023: 831-832 - 2022
- [c25]Denis Firsov, Sven Laur, Ekaterina Zhuchko:
Unsatisfiability of Comparison-Based Non-malleability for Commitments. ICTAC 2022: 188-194 - [i15]Denis Firsov, Sven Laur, Ekaterina Zhuchko:
Formal Analysis of Non-Malleability for Commitments in EasyCrypt. IACR Cryptol. ePrint Arch. 2022: 32 (2022) - 2021
- [j8]Andre Ostrak
Implementing Privacy-Preserving Genotype Analysis with Consideration for Population Stratification. Cryptogr. 5(3): 21 (2021) - [j7]Sven Laur
Foundations of Programmable Secure Computation. Cryptogr. 5(3): 22 (2021) - [c24]Denis Firsov, Henri Lakk, Sven Laur, Ahto Truu:
BLT+L: Efficient Signatures from Timestamping and Endorsements. SECRYPT 2021: 75-86 - 2020
- [c23]Sven Laur, Siim Orasmaa, Dage Särg, Paul Tammo:
EstNLTK 1.6: Remastered Estonian NLP Pipeline. LREC 2020: 7152-7160
2010 – 2019
- 2018
- [j6]Dan Bogdanov
Implementation and Evaluation of an Algorithm for Cryptographically Private Principal Component Analysis on Genomic Data. IEEE ACM Trans. Comput. Biol. Bioinform. 15(5): 1427-1432 (2018) - [j5]Dan Bogdanov, Liina Kamm
Rmind: A Tool for Cryptographically Secure Statistical Analysis. IEEE Trans. Dependable Secur. Comput. 15(3): 481-495 (2018) - 2017
- [c22]Avo Muromägi, Kairit Sirts, Sven Laur:
Linear Ensembles of Word Embedding Models. NODALIDA 2017: 96-104 - [i14]Avo Muromägi, Kairit Sirts, Sven Laur:
Linear Ensembles of Word Embedding Models. CoRR abs/1704.01419 (2017) - 2016
- [j4]Raivo Kolde
seqlm: an MDL based method for identifying differentially methylated regions in high density methylation array data. Bioinform. 32(17): 2604-2610 (2016) - [c21]Siim Orasmaa, Timo Petmanson, Alexander Tkachenko, Sven Laur, Heiki-Jaan Kaalep:
EstNLTK - NLP Toolkit for Estonian. LREC 2016 - 2014
- [c20]Dan Bogdanov, Liina Kamm
Privacy-Preserving Statistical Data Analysis on Federated Databases. APF 2014: 30-55 - [c19]Dan Bogdanov, Peeter Laud
From Input Private to Universally Composable Secure Multi-party Computation Primitives. CSF 2014: 184-198 - [c18]Alexander Tkachenko, Timo Petmanson, Sven Laur:
Hybrid Lemmatizer for Estonian. Baltic HLT 2014: 244-247 - [c17]Sven Laur, Bingsheng Zhang:
Lightweight Zero-Knowledge Proofs for Crypto-Computing Protocols. ISC 2014: 140-157 - [c16]Dan Bogdanov
A Practical Analysis of Oblivious Sorting Algorithms for Secure Multi-party Computation. NordSec 2014: 59-74 - [i13]Dan Bogdanov, Peeter Laud, Sven Laur, Pille Pullonen:
From Input Private to Universally Composable Secure Multiparty Computation Primitives. IACR Cryptol. ePrint Arch. 2014: 201 (2014) - [i12]Dan Bogdanov, Liina Kamm, Sven Laur, Ville Sokk:
Rmind: a tool for cryptographically secure statistical analysis. IACR Cryptol. ePrint Arch. 2014: 512 (2014) - 2013
- [j3]Liina Kamm
A new way to protect privacy in large-scale genome-wide association studies. Bioinform. 29(7): 886-893 (2013) - [c15]Alexander Tkachenko, Timo Petmanson, Sven Laur:
Named Entity Recognition in Estonian. BSNLP@ACL 2013: 78-83 - [c14]Sven Laur, Riivo Talviste
From Oblivious AES to Efficient and Secure Database Join in the Multiparty Setting. ACNS 2013: 84-101 - [i11]Sven Laur, Bingsheng Zhang:
Lightweight Zero-Knowledge Proofs for Crypto-Computing Protocols. IACR Cryptol. ePrint Arch. 2013: 64 (2013) - [i10]Sven Laur, Riivo Talviste, Jan Willemson
From oblivious AES to efficient and secure database join in the multiparty setting. IACR Cryptol. ePrint Arch. 2013: 203 (2013) - [i9]Dan Bogdanov, Liina Kamm, Sven Laur, Pille Pruulmann-Vengerfeldt:
Secure multi-party data analysis: end user validation and practical experiments. IACR Cryptol. ePrint Arch. 2013: 826 (2013) - 2012
- [j2]Raivo Kolde
Robust rank aggregation for gene list integration and meta-analysis. Bioinform. 28(4): 573-580 (2012) - [c13]Dan Bogdanov
A Universal Toolkit for Cryptographically Secure Privacy-Preserving Data Mining. PAISI 2012: 112-126 - 2011
- [c12]Sven Laur, Jan Willemson, Bingsheng Zhang:
Round-Efficient Oblivious Database Manipulation. ISC 2011: 262-277 - [i8]Sven Laur, Jan Willemson
Round-efficient Oblivious Database Manipulation. IACR Cryptol. ePrint Arch. 2011: 429 (2011) - 2010
- [c11]Sven Laur, Helger Lipmaa
On the Feasibility of Consistent Computations. Public Key Cryptography 2010: 88-106
2000 – 2009
- 2009
- [j1]Sven Laur, Sylvain Pasini:
User-aided data authentication. Int. J. Secur. Networks 4(1/2): 69-86 (2009) - [c10]Ahto Buldas
Oracle Separation in the Non-uniform Model. ProvSec 2009: 230-244 - 2008
- [b1]Sven Laur:
Cryptographic protocol design. Helsinki University of Technology, Finland, 2008 - [c9]Dan Bogdanov, Sven Laur, Jan Willemson:
Sharemind: A Framework for Fast Privacy-Preserving Computations. ESORICS 2008: 192-206 - [c8]Sven Laur, Sylvain Pasini:
SAS-Based Group Authentication and Key Agreement Protocols. Public Key Cryptography 2008: 197-213 - [i7]Dan Bogdanov, Sven Laur, Jan Willemson
Sharemind: a framework for fast privacy-preserving computations. IACR Cryptol. ePrint Arch. 2008: 289 (2008) - 2007
- [c7]Sven Laur, Helger Lipmaa:
A New Protocol for Conditional Disclosure of Secrets and Its Applications. ACNS 2007: 207-225 - [c6]Ahto Buldas, Sven Laur:
Knowledge-Binding Commitments with Applications in Time-Stamping. Public Key Cryptography 2007: 150-165 - [i6]Ahto Buldas, Sven Laur:
Knowledge-Binding Commitments with Applications in Time-Stamping (Full Version). IACR Cryptol. ePrint Arch. 2007: 71 (2007) - 2006
- [c5]Ahto Buldas
Do Broken Hash Functions Affect the Security of Time-Stamping Schemes? ACNS 2006: 50-65 - [c4]Sven Laur, Kaisa Nyberg:
Efficient Mutual Data Authentication Using Manually Authenticated Strings. CANS 2006: 90-107 - [c3]Sven Laur, Helger Lipmaa, Taneli Mielikäinen:
Cryptographically private support vector machines. KDD 2006: 618-624 - [i5]Sven Laur, Helger Lipmaa:
On the Feasibility of Consistent Computations. IACR Cryptol. ePrint Arch. 2006: 88 (2006) - [i4]Sven Laur, Helger Lipmaa, Taneli Mielikäinen:
Cryptographically Private Support Vector Machines. IACR Cryptol. ePrint Arch. 2006: 198 (2006) - [i3]Emilia Käsper, Sven Laur, Helger Lipmaa:
Black-Box Knowledge Extraction Revisited: Universal Approach with Precise Bounds. IACR Cryptol. ePrint Arch. 2006: 356 (2006) - 2005
- [c2]Sven Laur, Helger Lipmaa
Private Itemset Support Counting. ICICS 2005: 97-111 - [i2]Sven Laur, Helger Lipmaa:
A New Protocol for Conditional Disclosure of Secrets And Its Applications. IACR Cryptol. ePrint Arch. 2005: 378 (2005) - [i1]Sven Laur, N. Asokan, Kaisa Nyberg:
Efficient Mutual Data Authentication Using Manually Authenticated Strings. IACR Cryptol. ePrint Arch. 2005: 424 (2005) - 2004
- [c1]Bart Goethals
On Private Scalar Product Computation for Privacy-Preserving Data Mining. ICISC 2004: 104-120
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: