We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diļ¬...
Abstract. It is almost a folklore-knowledge that hash-based time-stamping schemes are secure if the underlying hash function is collisionresistant but still no rigorous proofs have...
Abstract. Several generalizations of linear cryptanalysis have been proposed in the past, as well as very similar attacks in a statistical point of view. In this paper, we deļ¬ne ...
We consider the problem of securely computing the Greater Than (GT) predicate and its generalization ā securely determining membership in a union of intervals. We approach these ...
Universal One-Way Hash Functions (UOWHFs) are families of cryptographic hash functions for which ļ¬rst a target input is chosen and subsequently a key which selects a member from ...