Vlad Kolesnikov at utoronto

[Photo of Vlad Kolesnikov]
Vladimir Kolesnikov
I am migrating this page to the new place at Bell Labs
Ph.D. ~~student~~, Dept. Comp. Sci., University of Toronto.
My advisors are Ian F. Blake and Charles Rackoff.
I have graduated. I am now a member of technical staff at Bell Labs.
Research: Formal cryptography and systems security.
Thesis: Secure Two-Party Computation and Communication.
CV Aug 2009 (ps, pdf)
Contact me: ####@research.bell-labs.com, replacing "####" with "kolesnikov"

Selected (Refereed) Publications:

Ian F. Blake and Vladimir Kolesnikov, Strong Conditional Oblivious Transfer and Computing on Intervals. In proceedings of Advances in Cryptology - ASIACRYPT 2004. (Acceptance rate 17.3%.) Copyright IACR 2004. Presentation slides.

Vladimir Kolesnikov, Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation. In proceedings of Advances in Cryptology - ASIACRYPT 2005. (Acceptance rate 15.8%.) Copyright IACR 2005. Presentation slides, (with embedded fonts).

Vladimir Kolesnikov and Charles Rackoff, Key Exchange Using Passwords and Long Keys (preliminary full version). Shorter version appears in Theory of Cryptography Conference (TCC) 2006. Copyright IACR 2006. Presentation slides.

Ian F. Blake and Vladimir Kolesnikov, Conditional Encrypted Mapping and Comparing Encrypted Numbers. In Financial Cryptography 2006. (Acceptance rate 19.8% for technical papers.) Copyright International Financial Cryptography Association 2006. Presentation slides.

Vladimir Kolesnikov and Thomas Schneider, A Practical Universal Circuit Construction and Secure Evaluation of Private Functions (preliminary version). In Financial Cryptography 2008. (Acceptance rate 19.1% for technical papers.) Presentation slides. More information, including our implementation in the Fairplay framework is here.

Vladimir Kolesnikov and Thomas Schneider, Improved Garbled Circuit: Free XOR Gates and Applications. In International Colloquium on Automata, Languages and Programming (ICALP) 2008.

Vladimir Kolesnikov and Charles Rackoff, Password Mistyping in Two-Factor-Authenticated Key Exchange (Preliminary full version). In International Colloquium on Automata, Languages and Programming (ICALP) 2008. Presentation slides.

... I stopped updating the list here. Please visit the new place at Bell Labs for more up to date version

Note: above slides use TexPoint.

Ph.D. Thesis (official version, June 30, 2006):

The thesis contains results reported in the above top four papers.
Official double spaced version: ps pdf. Convenient single spaced version: ps, pdf.

M.Sc. Thesis:

My M.Sc. thesis deals with heuristic reductions from knapsack problem to the problem of finding short vectors in integer lattices. The latter is efficiently solved by the Lenstra, Lenstra and Lovasz algorithm. A good reduction results in better ways of solving knapsack. Look at the short summary (ps, pdf) (better written), or full thesis (ps) (a bit messier).

The following publications are not available online due to Non-Disclosure Agreements.

Non-refereed publications (Technical Reports, etc.) :

Biometric Key Binding. Technical report sponsored by Bioscrypt, Inc. and Canadian National Research Council's Industrial Research Assistance Program (NRC-IRAP). With Omid Jahromi, Rene McIver, Colin Soutar and Alex Stoianov, 2005
Binding Strong Keys to Fingerprints Securely and Privately. Technical Report, Bioscrypt, Inc., 2005
Distributed Security Architecture For Storage Area Networks (SAN). International patent application, with Dr. Kumar Murty and Daniel Thanos, Kasten Chase, Inc., 2003
Efficient Storage Security. Technical Report, Kasten Chase, Inc., 2001
Efficient Broadcast Encryption. Technical Report, Kasten Chase, Inc., 2001

Personal: judo (4.5 yrs), soccer(football) (since age 4), chess (10 yrs).

Vladimir Kolesnikov

Page Last Updated: Apr, 2008