Aleksandr Yampolskiy, Ph.D.


Which way to go? (London, December 2005).

Hi! I defended my doctorate in February 2006. 
In my thesis, I developed a set of cryptographic tools,
which can be used to enhance security of various distributed systems: PS  PDF.

After finishing my Ph.D., I worked at Oracle, Inc.  
 as a Senior Member of Technical Staff, focusing on 
federated single-on protocols for about 1.5 years.
I have now joined Goldman Sachs as an Associate / Sr. Security Engineer.


NEW! We are starting an NYC chapter of YES (Yale Entrepreneurial Society) for all interested alumni. The first meeting will be in January 2007. Please visit http://www.theyaleentrepreneur.org
Professional interests: Elliptic-curve cryptography, identity federation, authentication / Authorization, XML Security, SAML/Liberty.
Contact info: E-mail: yampolskiy AT gmail DOT com Phone: 347-689-3372


News: Read a Yale Scientific article about cryptography research done at Yale
My curriculum vitae (dated 10/1/2007): WORD
Conference Papers (for most authoritative versions, check the publisher's website):

ps abstract Paper
PS
411KB
(n/a)

James Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, and Sheng Zhong. Towards a theory of data entanglement. In proceedings of Ninth European Symposium on Research in Computer Security (acceptance rate: 17.0%).

PS
245KB
(n/a)

James Aspnes, Kevin Chang, and Aleksandr Yampolskiy. Inoculation strategies for victims of viruses and sum-of-squares partition problem. In proceedings of Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (acceptance rate: 27.7%). Full version will apear in Journal of Computer and System Sciences.

PS
260KB
(n/a)

Yevgeniy Dodis and Aleksandr Yampolskiy. A verifiable random function with short proofs and keys. In proceedings of Eighth International Workshop on Theory and Practice in Public Key Cryptography (acceptance rate: 22.2%) (winner of Best Paper Award)

PS
652KB
(n/a)

James Aspnes, Zoë Diamadi, Kristian Gjøsteen, René Peralta, and Aleksandr Yampolskiy. Spreading alerts quietly and the subgroup escape problem. In proceedings of Advances in Cryptology - ASIACRYPT 2005 (acceptance rate: 15.8%).

PS
645KB
(n/a)

Yevgeniy Dodis, Aleksandr Yampolskiy, and Moti Yung. Threshold and proactive pseudo-random permutations. In proceedings of Third Theory of Cryptography Conference (acceptance rate: 34.0%).


Other: