Homomorphic Hashing for Sparse Coefficient Extraction
نویسندگان
چکیده
1 Helsinki Institute for Information Technology, Department of Computer Science, Aalto University, Finland. [email protected]. Supported by the Academy of Finland, Grants 252083 and 256287. 2 Helsinki Institute for Information Technology, Department of Computer Science University of Helsinki, Finland. [email protected] Supported by the Academy of Finland, Grant 125637. 3 Utrecht University, Utrecht, The Netherlands. [email protected]. Supported by the Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO), project: ’Space and Time Efficient Structural Improvements of Dynamic Programming Algorithms’.
منابع مشابه
Image authentication using LBP-based perceptual image hashing
Feature extraction is a main step in all perceptual image hashing schemes in which robust features will led to better results in perceptual robustness. Simplicity, discriminative power, computational efficiency and robustness to illumination changes are counted as distinguished properties of Local Binary Pattern features. In this paper, we investigate the use of local binary patterns for percep...
متن کاملSecure Network Coding over the Integers
Network coding offers the potential to increase throughput and improve robustness without any centralized control. Unfortunately, network coding is highly susceptible to “pollution attacks” in which malicious nodes modify packets improperly so as to prevent message recovery at the recipient(s); such attacks cannot be prevented using standard endto-end cryptographic authentication because networ...
متن کاملSufficient Conditions for Collision-Resistant Hashing
We present several new constructions of collision-resistant hash-functions (CRHFs) from general assumptions. We start with a simple construction of CRHF from any homomorphic encryption. Then, we strengthen this result by presenting constructions of CRHF from two other primitives that are implied by homomorphic-encryption: one-round private information retrieval (PIR) protocols and homomorphic o...
متن کاملPerfect hashing using sparse matrix packing
This article presents a simple algorithm for packing sparse 2-D arrays into minimal I-D arrays in O(r?) time. Retrieving an element from the packed I-D array is O(l). This packing algorithm is then applied to create minimal perfect hashing functions for large word lists. Many existing perfect hashing algorithms process large word lists by segmenting them into several smaller lists. The perfect ...
متن کاملOn b-bit min-wise hashing for large-scale regression and classification with sparse data
Large-scale regression problems where both the number of variables, p, and the number of observations, n, may be large and in the order of millions or more, are becoming increasingly more common. Typically the data are sparse: only a fraction of a percent of the entries in the design matrix are non-zero. Nevertheless, often the only computationally feasible approach is to perform dimension redu...
متن کامل