Sciweavers

780 search results - page 2 / 156
» A New Identification Scheme Based on the Perceptrons Problem
Sort
View
ICPR
2010
IEEE
13 years 3 months ago
Local Binary Pattern-Based Features for Text Identification of Web Images
We present a method of robustly identifying a text block in complex web images. The method is a MLP (Multilayer perceptron) classifier trained on LBP (Local binary patterns), wavel...
Insook Jung, Il-Seok Oh
CSJM
2008
86views more  CSJM 2008»
13 years 5 months ago
Digital Signature Scheme Based on a New Hard Problem
Nikolay A. Moldovyan
PKC
2009
Springer
142views Cryptology» more  PKC 2009»
14 years 5 months ago
Identification of Multiple Invalid Signatures in Pairing-Based Batched Signatures
This paper describes new methods in pairing-based signature schemes for identifying the invalid digital signatures in a batch, after batch verification has failed. These methods ef...
Brian J. Matt
ASIACRYPT
2001
Springer
13 years 9 months ago
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
Nicolas Courtois
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
13 years 8 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