Noam Livne’s Homepage נעם ליבנה

I'm a postdoc at Tel-Aviv University and IDC. I’m interested in computational complexity, cryptography, game theory and especially in the interrelations between the three.

Contact

Office at TAU: Shenkar 305

Email: livnenoam[at]gmail[dot]com

Phone: +972-3-6407466

Skype: livnenoam

Papers

On Matroids and Non-ideal Secret Sharing A. Beimel, N. Livne

In Proc. of the third Theory of Cryptography Conference (TCC 2006) (ps) (pdf)

Journal version: IEEE Trans. on Info. Theory, 2008 (ps) (pdf)

All Natural NPC Problems Have Average-Case Complete Versions N. Livne

In Journal of Computational Complexity (ps) (pdf)

Matroids Can Be Far From Ideal Secret Sharing A. Beimel, N. Livne, C. Padró

In Proc. of the fifth Theory of Cryptography Conference (TCC 2008) (ps) (pdf)

A Note on the #P-Completeness of NP-Witnessing Relations N. Livne

In Information Processing Letters 109(5), 2009 (pdf)

On the Construction of One-Way Functions from Average Case Hardness N. Livne

In Proc. of the first Innovations in Computer Science (ICS 2010) (ps) (pdf)

Sequential Rationality in Cryptographic Protocols R. Gradwohl, N. Livne, A. Rosen

In Foundations of Computer Science (FOCS 2010). (pdf)