Sven Laur
|
Interests
- Datamining
- Cryptography
- Applied Abstract Algebra
- Art and Art History
Courses
Current Term
Recent Past
Ancient Times
Publications
List of publications
Recent publications
- Tretyakov K, Laur S, Vilo J. G = MAT: linking transcription factor expression and DNA binding data. In PLoS One, 2011 Jan 31;6(1):e14559, 2011. [DOI]
- Sven Laur, Helger Lipmaa. On the Feasibility of Consistent Computations. In Public Key Cryptography - PKC 2010, 13th International Conference on Practice and Theory in Public Key Cryptography, Paris, France, May 26-28, 2010, volume 6056 of Lecture Notes in Computer Science, pages 88-106, Springer, 2010. [PDF] [DOI]
- Ahto Buldas, Sven Laur, Margus Niitsoo. Oracle Separation in the Non-uniform Model. In Provable Security, Third International Conference, ProvSec 2009, Guangzhou, China, November 11-13, 2009, volume 5848 of Lecture Notes in Computer Science, pages 230-244, Springer, 2009. [DOI]
- Sven Laur and Sylvain Pasini. User-aided data authentication. International Journal of Security and Networks, volume 4(1/2), pages 69-86, 2009 [PDF] [DOI]
- Dan Bogdanov, Sven Laur, Jan Willemson. Sharemind: A Framework for Fast Privacy-Preserving Computations. In Computer Security - ESORICS 2008, 13th European Symposium on Research in Computer Security, Málaga, Spain, October 6-8, 2008, volume 5283 of Lecture Notes in Computer Science, pages 192-206. Springer, 2008. [PDF] [DOI]
- Sven Laur and Sylvain Pasini. SAS-based group authentication and key agreement protocols. In Public Key Cryptography - PKC 2008, 11th International Workshop on Practice and Theory in Public-Key Cryptography, Barcelona, Spain, March 9-12, 2008, volume 4939 of Lecture Notes in Computer Science, pages 197-213. Springer, 2008. [PDF] [DOI]
- Sven Laur. Cryptographic Protocol Design. Doctoral dissertation, Helsinki University of Technology, 2008. TKK Dissertations in Information and Computer Science, TKK-ISC-D2. [PDF] [DOI]
- Ahto Buldas and Sven Laur. Knowledge-binding commitments with applications in time-stamping. In Public Key Cryptography - PKC 2007, 10th International Conferenc on Practice and Theory in Public-Key Cryptography, Beijing, China, April 16-20, 2007, volume 4450 of Lecture Notes in Computer Science, pages 150-165. Springer, 2007. [PDF] [DOI]
- Sven Laur and Helger Lipmaa. A new protocol for conditional disclosure of secrets and its applications. In Applied Cryptography and Network Security, 5th International Conference, ACNS 2007, Zhuhai, China, June 5-8, 2007, volume 4521 of Lecture Notes in Computer Science, pages 207-225. Springer, 2007. [PDF] [DOI]
- Ahto Buldas and Sven Laur. Do broken hash functions affect the security of time-stamping schemes? In Applied Cryptography and Network Security, 4th International Conference, ACNS 2006, Singapore, June 6-9, 2006, Proceedings, volume 3989 of Lecture Notes in Computer Science, pages 50-65. Springer, 2006. [PDF] [DOI]
- Sven Laur, Helger Lipmaa, and Taneli Mielikäinen. Cryptographically private support vector machines. In KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 618-624, New York, NY, USA, 2006. ACM Press. [PDF] [DOI]
- Sven Laur and Kaisa Nyberg. Efficient mutual data authentication using manually authenticated strings. In The 5th International Conference on Cryptology and Network Security, CANS 2006, Suzhou, Dec. 8 - 10, 2006, volume 4301 of Lecture Notes in Computer Science, pages 90-107. Springer, 2006. A shortened version of ePrint Report 2005/424. [PDF] [DOI]
- Sven Laur, Helger Lipmaa, and Taneli Mielikäinen. Private itemset support counting. In Information and Communications Security, 7th International Conference, ICICS 2005, Beijing, China, December 10-13, 2005, Proceedings, volume 3783 of Lecture Notes in Computer Science, pages 97-111. Springer, 2005. [PDF] [DOI]
- Bart Goethals, Sven Laur, Helger Lipmaa, and Taneli Mielikäinen. On private scalar product computation for privacy-preserving data mining. In Information Security and Cryptology - ICISC 2004, 7th International Conference, Seoul, Korea, December 2-3, 2004, Revised Selected Papers, volume 3506 of Lecture Notes in Computer Science, pages 104120. Springer, 2004. [PDF] [DOI]
Supervision
A proper way to choose your supervisor and thesis topics
The following graph depicts the essence of academic studies. In particular, I am very reluctant do take student, which do not follow this graph, as all other configurations are known to be risky and potentially harmful to all parties involved in this process. Of course, I sometimes make exceptions but only for extraordinary persons.
Students under my supervision
- Kristjan Krips
- Konstantin Tretjakov
Former students who have surpassed me and I trully admire
- Dan Bogdanov: Sharemind
- Kristo Käärmann: TransferWise
My former bachelor students
- Aleksei Gornõi. Analysis of Chip-card Based Authentication. University of Tartu. 2009.
- Oskar Gross. Neurovõrkude kasutamine dünaamiliste süsteemide juhtimisel. University of Tartu. 2009. Lisad MATLAB-is.
- Jürgen Jänes. Detection of emission line stars from the Gaia space telescope. University of Tartu. 2009.
My former master students
- Oskar Gross. Finding Non-Trivially Similar Documents from a Large Document Corpus. University of Tartu. 2011.
- Oleg Šelajev, The Use of Circuit Evaluation Techniques for Secure Computation. University of Tartu. 2011.
- Katharina Kahrs. Share Computing Protocols over Fields and Rings. University of Tartu. 2009.
- Konstantin Tretjakov. G=MAT: Linking Transcription Factor Expression with DNA Binding. University of Tartu. 2008.
- Raivo Kolde. Co-expression queries across multiple experiments University of Tartu. 2008.
- Dan Bogdanov. How to securely perform computations on secret-shared data. University of Tartu. 2007.
- Liina Kamm. Homological Classification of Commitment Schemes. University of Tartu. 2007.
- Kristo Käärmann. Haplotype inference using overlapping segments University of Tartu. 2006.
Suggestions for students
- Phillip Rogaway. How to give a good talk. Sixth Estonian Winter School in Computer Science, Palmse, 2001.
- Omapoolsed lisandused eelnevale
- Read and write when you are young. Do not work if you can. Later on you do not have the luxury!
- Töötav magistrant on surnud magistrant, töötav doktorant on lapsepõlvepikendaja.
Random Stuff and Childhood Memories
-
Me being a mad writer in my undergraduate years
- Motod
- Bakalaureusetöö
- Lõplike korpuste teooria elemendid (1999, TeX, aimekonspekt)
- Integraaliteooria kontspekt(1999, TeX, pisivigadega)
- Matemaatika ajalugu (1999, TeX)
- Võred kui diskreetsed aditiivsed R^n alamrühmad (2000, Maple ja PDF)
- Põhimõisted ja Hermite normaalkuju (HNF) [Maple tööleht, PDF]
- Lühima vektori probleem võres (Gaussi ja LLL-algoritm ning nende rakendused) [Maple tööleht]
- Galois' teooria konspekt (2001, TeX, korpuste ehitus, pisivigadega, vajab täiendusi)
- RSA ja arvuteeoria (2002, TeX)
- Ülevaade polünomiaalses ajas toimivast AKS algarvulisuse testist (2002, Teooriapäevad, astonishment)
- C-kompliaator ja prügikoristusega virtuaalmasin (2003, C++ and template programming, mostly done by Oleg Mürk, Mark Kofman and Vesal Voidani)
- Sissejuhatus Bayesi võrkudesse (2003, TeX)
- Ülevaade erinevatest haplotüüpimismeetoditest (2003, TeX, bioinformaaatika)
-
Me failing in presentations in my undergraduate years
- Pseudojuhuslikus (1999, TeX, krüptoseminar, hardcore crypto)
- Kovulutsioonkoodid ehk lihtsustatult jadakoodid [I, II] (2000, TeX, küptoseminar, kombinatoorika ja tõenäosus)
- Algebraline graafiteooria (2001, TeX, krüptoseminar, hardcore graph theory)
- Lõplike korpuste seminar (2002, TeX, seminar, hardcore algebra)
- Convolution Rings and Related Cryptographic Schemes (2002, TeX, 7th EWSCS, krüpto ja diskreetne matemaatika)
- Krüptograafia loengud TTÜ-s (2002 kevad)
- Ülevaade polünomiaalses ajas toimivast AKS algarvulisuse testist (2002, Teooriapäevad, astonishment)
- Bayesi võrgud (2003, TeX, andmekaevandusseminar)
- Ettekanne teooriapäevadel Pedasel (2003, TeX, nitpicking)
-
Glorious time in Helsinki
- Secure Frequent Itemset Mining (2004, slides, survey cryptography and datamining)
- Private Set Intersection Protocols (2004, cryptography and datamining)
- Introduction to Privacy-Preserving Datamining (2004, cryptography and datamining)
- Additive Conditional Disclousure of Secrets (2004, TCS Forum Talk at HUT , cryptography)
- Secure Indices and Other Oblivious Search Structures (2004, Theory Days, Veskisilla, cryptography and datamining)
- Deterministic Dynamic Systems. Takens Theorem (2004, slides, survey, statistics)
- Least Angule Regression (2005, TeX, statistics)
- Extractors for Reed-Muller Codes (2005, TeX, cryptography)
- Information Diffusion Kernels (2005, slides, survey, hardcore statistics)
- Overvief of recent claims about provavility of P!=NP. (2005, slides, survey, analysis of a big mess which it caused)
- Least Angule Regression (2005, statistics)
- Masinõppemeetodite veahinnangutest (2005, Külalisettekanne Tartus)
- Model Structure Selection. Bias Variance Dilemma (2005, statistics)
- Secure Key Agreements and Authentication (2006, Lecture at HUT, crypto)
-
Back in Tartu
- Is Cryptography Going to Be an Engineering Discipline!? (2008, EXEC Kick-off, nostalgia)
-
Seiklusjutte maalt ja merelt