- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j3 |      | Liina Kamm, Dan Bogdanov, Sven Laur, Jaak Vilo: A new way to protect privacy in large-scale genome-wide association studies. Bioinformatics 29(7): 886-893 (2013) |
| i10 | | Sven Laur, Bingsheng Zhang: Lightweight Zero-Knowledge Proofs for Crypto-Computing Protocols. IACR Cryptology ePrint Archive 2013: 64 (2013) |
| i9 | | Sven Laur, Riivo Talviste, Jan Willemson: From oblivious AES to efficient and secure database join in the multiparty setting. IACR Cryptology ePrint Archive 2013: 203 (2013) |
| 2012 | ||
| j2 | | Raivo Kolde, Sven Laur, Priit Adler, Jaak Vilo: Robust rank aggregation for gene list integration and meta-analysis. Bioinformatics 28(4): 573-580 (2012) |
| c13 | | Dan Bogdanov, Roman Jagomägis, Sven Laur: 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, Bingsheng Zhang: Round-efficient Oblivious Database Manipulation. IACR Cryptology ePrint Archive 2011: 429 (2011) |
| 2010 | ||
| c11 | | Sven Laur, Helger Lipmaa: On the Feasibility of Consistent Computations. Public Key Cryptography 2010: 88-106 |
| 2009 | ||
| j1 | | |
| c10 | | Ahto Buldas, Sven Laur, Margus Niitsoo: Oracle Separation in the Non-uniform Model. ProvSec 2009: 230-244 |
| 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 Cryptology ePrint Archive 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 Cryptology ePrint Archive 2007: 71 (2007) |
| 2006 | ||
| c5 | | Ahto Buldas, Sven Laur: 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 Cryptology ePrint Archive 2006: 88 (2006) |
| i4 | | Sven Laur, Helger Lipmaa, Taneli Mielikäinen: Cryptographically Private Support Vector Machines. IACR Cryptology ePrint Archive 2006: 198 (2006) |
| i3 | | Emilia Käsper, Sven Laur, Helger Lipmaa: Black-Box Knowledge Extraction Revisited: Universal Approach with Precise Bounds. IACR Cryptology ePrint Archive 2006: 356 (2006) |
| 2005 | ||
| c2 | | |
| i2 | | Sven Laur, Helger Lipmaa: A New Protocol for Conditional Disclosure of Secrets And Its Applications. IACR Cryptology ePrint Archive 2005: 378 (2005) |
| i1 | | Sven Laur, N. Asokan, Kaisa Nyberg: Efficient Mutual Data Authentication Using Manually Authenticated Strings. IACR Cryptology ePrint Archive 2005: 424 (2005) |
| 2004 | ||
| c1 | | Bart Goethals, Sven Laur, Helger Lipmaa, Taneli Mielikäinen: On Private Scalar Product Computation for Privacy-Preserving Data Mining. ICISC 2004: 104-120 |
Data released under the ODC-BY 1.0 license — See also our legal information page