Sciweavers

Share
17 search results - page 1 / 4
» An Identification Scheme Based on Sparse Polynomials
Sort
View
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
9 years 2 months ago
An Identification Scheme Based on Sparse Polynomials
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
William D. Banks, Daniel Lieman, Igor Shparlinski
ICISC
2000
126views Cryptology» more  ICISC 2000»
9 years 20 days ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...
ICIP
2009
IEEE
8 years 9 months ago
A compressive-sensing based watermarking scheme for sparse image tampering identification
In this paper we describe a robust watermarking scheme for image tampering identification and localization. A compact representation of the image is first produced by assembling a...
Giuseppe Valenzise, Marco Tagliasacchi, Stefano Tu...
ICASSP
2011
IEEE
8 years 3 months ago
A clustering based framework for dictionary block structure identification
Sparse representations over redundant dictionaries offer an ef´Čücient paradigm for signal representation. Recently block-sparsity has been put forward as a prior condition for so...
Ender M. Eksioglu
CORR
2012
Springer
193views Education» more  CORR 2012»
7 years 7 months ago
Approximate Counting of Matchings in Sparse Hypergraphs
Abstract. In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hy...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
books