1. ON GENERIC COMPLEXITY OF THE SUBSET SUM PROBLEM FOR SEMIGROUPS OF INTEGER MATRICES;PRIKL DISKRETN MAT;2020
2. Notes on Levin’s Theory of Average-Case Complexity;Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation;2011
3. Secret sharing based on a hard-on-average problem;Linear Algebra and its Applications;2006-04
4. Strong Identification Based on a Hard-on-Average Problem;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2005-05-01
5. A Zero-Knowledge Identification Scheme Based on an Average-Case NP-Complete Problem;Lecture Notes in Computer Science;2003