TCS / Personnel / Sven Laur / Thesis
Helsinki University of Technology, Laboratory for Theoretical Computer Science

Cryptographic Protocol Design

Electronic version of the thesis
  1. Summary together with the articles [ laur_thesis_binded.pdf ]
  2. Summary [ laur_summary.pdf ]
  3. The first article [ laur_article-1.pdf ]
  4. The second article [ laur_article-2.pdf ]
  5. The third article [ laur_article-3.pdf ]
  6. The fourth article [ laur_article-4.pdf ]





Published articles

2007

7. Sven Laur and Helger Lipmaa. A New Protocol for Conditional Disclosure of Secrets and Its Applications. In Jonathan Katz and Moti Yung, editors, Applied Cryptography and Network Security, 5th International Conference, ACNS 2007, Zhuhai, 5 - 8 June, 2007, volume 4521 of Lecture Notes in Computer Science, pages 207–225. Springer, 2007.

6. Ahto Buldas and Sven Laur. Knowledge-Binding Commitments with Applications in Time-Stamping. In Tatsuaki Okamoto and Xiaoyun Wang, editors, The International Conference on Theory and Practice of Public-Key Cryptography, PKC 2007, Beijing, 16 - 20 April, 2007, volume 4450 of Lecture Notes in Computer Science, pages 150–165, 2007. [Extended version]

2006

5. 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. [Extended version]
4. Ahto Buldas and Sven Laur. Do broken hash functions affect the security of time-stamping schemes?. In Jianying Zhou, Moti Yung, and Feng Bao, editors, 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.

3. 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. [Extended version]

2005

2. Sven Laur, Helger Lipmaa, and Taneli Mielikäinen. Private itemset support counting. In Sihan Qing, Wenbo Mao, Javier Lopez, and Guilin Wang, editors, 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.

2004

1. Bart Goethals, Sven Laur, Helger Lipmaa, and Taneli Mielikäinen. On private scalar product computation for privacy-preserving data mining.. In Choonsik Park and Seongtaek Chee, editors, 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 104–120. Springer, 2004.

0. Sven Laur and Helger Lipmaa. On private similarity search protocols. In Sanna Liimatainen and Teemupekka Virtanen, editors, Proceedings of the 9th Nordic Workshop on Secure IT Systems (NordSec 2004), pages 73–77, 2004.





Public manuscripts

2. Emilia Käsper and Sven Laur and Helger Lipmaa. Black-Box Knowledge Extraction Revisited: Universal Approach with Precise Bounds. Cryptology ePrint Archive, Report 2006/356. Techical report. [Eprint version]
1. Sven Laur and Helger Lipmaa. Consistent adaptive two-party computations. Cryptology ePrint Archive, Report 2006/088, 2006. Techical report. [Eprint version]
[TCS main] [Current] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [Links]
Latest update: 30 April 2007.