On Matroids and Non-ideal Secret Sharing. - Amos Beimel; Noam Livne (TCC, 2006)

All Natural NPC Problems Have Average-Case Complete Versions. - Noam Livne (Electron. Colloquium Comput. Complex., 2006)

Matroids Can Be Far from Ideal Secret Sharing. - Amos Beimel; Noam Livne; Carles Padró (TCC, 2008)

On Matroids and Nonideal Secret Sharing. - Amos Beimel; Noam Livne (IEEE Trans. Inf. Theory, 2008)

On the Construction of One-Way Functions from Average Case Hardness. - Noam Livne (Electron. Colloquium Comput. Complex., 2009)

A note on I-completeness of NP-witnessing relations. - Noam Livne (Inf. Process. Lett., 2009)

All Natural NP-Complete Problems Have Average-Case Complete Versions. - Noam Livne (Comput. Complex., 2010)

Sequential rationality in cryptographic protocols. - Ronen Gradwohl; Noam Livne; Alon Rosen (ACM Trans. Economics and Comput., 2013)

A Note on the Hint in the Dilithium Digital Signature Scheme. - Amit Berman; Ariel Doubchak; Noam Livne (IACR Cryptol. ePrint Arch., 2024)