Polymeric composite and lubricants for the wearresistant friction units of railway mechanics (2009)
Vladimir KOLESNIKOV, Nina MYASNIKOVA, Maria SAVENKOVA, Philipp MYASNIKOV, Philippe DANIEL
For long functioning of the friction unit it is necessary to create the steady layers between friction surfaces, which can lower considerably the friction force, and thereof also the wear reducing....
A Practical Universal Circuit Construction and Secure Evaluation of Private Functions (2008)
Vladimir Kolesnikov, Thomas Schneider
Abstract. We consider general secure function evaluation (SFE) of private functions (PF-SFE). Recall, privacy of functions is often most efficiently achieved by general SFE [17,18,9] of a Universal...
Activated Carbon Open Circuit Potential Shifts in Aqueous Solutions (2007)
Goldin, Mikhail M., Blanchard, Gary, Volkov, Alexander, Khubutiya, Mogely, Kolesnikov, Vladimir, Evseev, Anatoly, ...
Interaction of certain organic compounds with activated carbon and its effect on the carbon open circuit potentials were studied. It was shown that shifts in open circuit potentials depended on the...
Conditional Encrypted Mapping and Comparing Encrypted Numbers (2006)
Ian F. Blake, Vladimir Kolesnikov
We consider the problem of comparing two encrypted numbers and its extension -- transferring one of the two secrets, depending on the result of comparison. We show how to e#ciently apply our...
Key Exchange Using Passwords and Long Keys (2006)
Vladimir Kolesnikov And, Vladimir Kolesnikov, Charles Rackoff
We propose a new model for key exchange (KE) based on a combination of di#erent types of keys. In our setting, servers exchange keys with clients, who memorize short passwords and carry (stealable)...
Key Exchange Using Passwords and Long Keys (2006)
Vladimir Kolesnikov And, Vladimir Kolesnikov, Charles Rackoff
We propose a new model for key exchange (KE) based on a combination of di#erent types of keys. In our setting, servers exchange keys with clients, who memorize short passwords and carry (stealable)...
Abstract Secure Two-party Computation and Communication (2006)
Vladimir Kolesnikov, Vladimir Kolesnikov
In this dissertation, we address several issues that arise in protecting communication between parties, as well as in the area of secure function evaluation. Intuitively, the notion of secure...
Abstract Secure Two-party Computation and Communication (2006)
Vladimir Kolesnikov, Vladimir Kolesnikov
We address several issues that arise in protecting parties ’ communication, and in the area of secure function evaluation. Intuitively, the notion of secure function evaluation is natural: several...
Abstract Secure Two-party Computation and Communication (2006)
Vladimir Kolesnikov, Vladimir Kolesnikov
We address several issues that arise in protecting parties ’ communication, and in the area of secure function evaluation. Intuitively, the notion of secure function evaluation is natural: several...
Abstract Secure Two-party Computation and Communication (2006)
Vladimir Kolesnikov, Vladimir Kolesnikov
We address several issues that arise in protecting parties ’ communication, and in the area of secure function evaluation. Intuitively, the notion of secure function evaluation is natural: several...
Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation (2005)
We propose Gate Evaluation Secret Sharing (GESS) -- a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simple and powerful GESS...
ing (a generalization of) GT functionality built from a homomorphic encryption scheme. We exploit the structure of the GT predicate in a novel way to arrive at a solution that is more e#cient and...
Summary. In my research, I focus on practical and theoretical aspects of cryptography which fall under the general area of securing two-party and multiparty computation and communication. One...
Strong Conditional Oblivious Transfer and Computing on Intervals (2004)
Ian F. Blake, Vladimir Kolesnikov
We consider the problem of securely computing the Greater Than (GT) predicate and its generalization -- securely determining membership in a union of intervals. We approach these problems from the...
Multidimensional Subset Sum Problem (1997)
This document is an informal description of our main results presented in the thesis [2]. We propose heuristic modifications to the successful use of Lenstra, Lenstra and Lovasz's LLL algorithm...
Multidimensional Subset Sum Problem (1997)
This thesis explores new modifications to the successful LLL approach to solving the Subset Sum problem. This work is an optimization of the matrix representation of an instance. Traditionally, the...