Yuriy Arbitman's Website (Yuriy Arbitman)

Yuriy Arbitman's Website

Hi and welcome to my site!
My name is Yuriy Arbitman (in Hebrew יורי ארביטמן, in Russian Юрий Арбитман).
For now I plan to maintain this page mainly as an academic one.
If you want to send me an e-mail, my address is here.

I'm interested in theoretical computer science and in all aspects of cryptography and computer security (theoretical and practical).

Publications

Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation
Yuriy Arbitman, Moni Naor and Gil Segev
Manuscript.
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
Yuriy Arbitman, Moni Naor and Gil Segev
ICALP 2009.
Storage Modeling for Power Estimation
Miriam Allalouf, Yuriy Arbitman, Michael Factor, Ronen Kat, Kalman Meth and Dalit Naor
SYSTOR 2009.

SWIFFTX

SWIFFTX is a new family of cryptographic hash functions that was submitted as a candidate for NIST's SHA-3 competition. It was one of the 51 first round candidates, but didn't make it to the second round.
It's a joint work with Gil Dogon, Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert and Alon Rosen.
You can find more about cryptographic hash functions on Wikipedia here.

On Metering Schemes

Miscellaneous

Here is a bunch of links you might find useful.

A friend of mine, Eran Kimchi, released an album. Check it out!
Update Scanner is one of my favorite add-ons for Firefox. It enables you to keep track with sites that don't have RSS feeds (as well as with sites that do have), which is particularly useful for conferences sites and academic publications pages.
Here you can find the accepted papers at computer science theory conferences.