75 search results - page 5 / 15 » Hard Instances of the Constrained Discrete Logarithm Problem |
ASIACRYPT
2010
Springer
13 years 5 months ago
2010
Springer
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
ANTS
2006
Springer
13 years 11 months ago
2006
Springer
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
CVPR
2008
IEEE
13 years 9 months ago
2008
IEEE
This paper presents a multi-frame data association algorithm for tracking multiple targets in video sequences. Multi-frame data association involves finding the most probable corr...
PKC
2001
Springer
13 years 12 months ago
2001
Springer
At ISW’99, Nishioka, Hanaoka and Imai proposed a digital signature scheme on ID-based key-sharing infrastructures. That signature scheme is claimed to be secure if the discrete l...
COLT
2005
Springer
14 years 1 months ago
2005
Springer
We discuss a simple sparse linear problem that is hard to learn with any algorithm that uses a linear combination of the training instances as its weight vector. The hardness holds...