Sciweavers

326 search results - page 27 / 66
» Digital Signature Scheme Based on a New Hard Problem
Sort
View
DCC
2001
IEEE
14 years 7 months ago
Cryptography in Quadratic Function Fields
We describe several cryptographic schemes in quadratic function fields of odd characteristic. In both the real and the imaginary representation of such a field, we present a Diffi...
Renate Scheidler
CCS
2008
ACM
13 years 9 months ago
Efficient security primitives derived from a secure aggregation algorithm
By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. [3] and Frikken et al. [7]), we uncover a useful general functionali...
Haowen Chan, Adrian Perrig
ASIACRYPT
2005
Springer
14 years 1 months ago
Spreading Alerts Quietly and the Subgroup Escape Problem
We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has n...
James Aspnes, Zoë Diamadi, Kristian Gjø...
ICDAR
2009
IEEE
14 years 2 months ago
A Self-Adaptive Method for Extraction of Document-Specific Alphabets
Recognition and encoding of digitized historical documents is still a challenging and difficult task. A major problem is the occurrence of unknown glyphs and symbols which might n...
Stefan Pletschacher
PR
2007
165views more  PR 2007»
13 years 7 months ago
A trainable feature extractor for handwritten digit recognition
This article focusses on the problems of feature extraction and the recognition of handwritten digits. A trainable feature extractor based on the LeNet5 convolutional neural netwo...
Fabien Lauer, Ching Y. Suen, Gérard Bloch