Noam Livne

According to our database, Noam Livne authored at least 8 papers between 2006 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2013

Sequential rationality in cryptographic protocols.

Ronen Gradwohl, Noam Livne, Alon Rosen

ACM Trans. Economics and Comput., 2013

2010

All Natural NP-Complete Problems Have Average-Case Complete Versions.

Noam Livne

Comput. Complex., 2010

2009

A note on <i>I</i>-completeness of NP-witnessing relations.

Noam Livne

Inf. Process. Lett., 2009

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

Noam Livne

Electron. Colloquium Comput. Complex., 2009

2008

On Matroids and Nonideal Secret Sharing.

Amos Beimel, Noam Livne

IEEE Trans. Inf. Theory, 2008

Matroids Can Be Far from Ideal Secret Sharing.

Amos Beimel, Noam Livne, Carles Padró

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

2006

All Natural NPC Problems Have Average-Case Complete Versions.

Noam Livne

Electron. Colloquium Comput. Complex., 2006

On Matroids and Non-ideal Secret Sharing.

Amos Beimel, Noam Livne

Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006