Papers:

Ł. Chmielewski, J.-H. Hoepman and P. van Rossum.

Client-Server Password Recovery

In The 4th International Symposium on Information Security (IS'09), Vilamoura, Algarve-Portugal, November 2009.

Ł. Chmielewski, R. Brinkman, J.-H. Hoepman and B. Bos.

Using JASON to secure SOA

In 1st International Workshop on Middleware Security (MidSec 2008), Leuven, Belgium.

Ł. Chmielewski and J.-H. Hoepman.

Fuzzy Private Matching

In ARES 2008 The International Security and Dependability Conference, Polytechnic University of Catalonia, Barcelona, Spain.

B. Bos, Ł. Chmielewski, J.-H. Hoepman, and T. S. Nguyen.

Remote Management and Secure Application Development for Pervasive Home Systems Using JASON

In 3rd International Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing, Istanbul, Turkey, July 20 2007.

Ł. Chmielewski under supervision of Stefan Dziembowski.

"Wydajne protokoły obliczeń wielopodmiotowych", in English: "Efficient protocols of multi-party computation".

Computer Science Master Dissertation

My short CV

September 1981

Born in Warsaw, Poland

September 1996 - June 2000

Jose Marti High School in Warsaw finished with honors, leading subjects: Mathematics and Physics

October 2000 - October 2005

Finished M.Sc. in Computer Science at the MIMUW, Warsaw University, Poland.

July 2003 - May 2004

Junior Consultant at SAS Institute Poland, main responsibilities: writing computer programs (data bases)

August 2004 - June 2005

Socrates-Erasmus scholarship at Department of Computer Science - DAIMI , University of Aarhus, Denmark

November 2005 -

Ph.D. student in the Security of Systems group at the Nijmegen Institute for Computing and Information Science, Radboud University Nijmegen.

My full cv is here.

Theses:

Computer Science Master Dissertation:

"Wydajne protokoły obliczeń wielopodmiotowych", in English: "Efficient protocols of multi-party computation";

My master thesis is about efficient secure multi-party protocols. I am showing in this paper recently presented protocols for solving private matching (set intersection) problem. Then I am writing about fuzzy private matching problem (I am writing a little bit about existing solution) and I am showing protocols for solving this problem introduced by me.

It was written under supervision of Stefan Dziembowski.

I already have found few (minor) mistakes in it (especailly connected with complexities and their relation to security parameter).

Computer Science B.Sc.:

"Uniwersytecki System Obsugi Zadań - XPWeb", in English: "University System for Managing Assignments - XPWeb"; for thesis we implemented system managing students assignments; this system was designed to be added to Warsaw University main computer system (USOSWEB); using this system it should be possible to send assignments by students, receive them by assitents, teachers and lecturers; it also was designed to look for plagiarism;

these project was made in group: Łukasz Chmielewski, Michał Malinowski, Maciej Osiński, Dariusz Działak.

here is link to code (almost final :-) ).

Others:

Solution for task from IPA fall days 2006

Link (in PDF)

Implemented by me in SML enviroment to play a little bit boardened version of CoreWars.

Link