147 search results - page 3 / 30 » Logarithmic keying |
159
Voted
SCN
2004
Springer
15 years 9 months ago
2004
Springer
Chameleon signatures were introduced by Krawczyk and Rabin, being non-interactive signature schemes that provide non-transferability. However, that first construction employs a c...
116
Voted
SIAMCO
2000
15 years 3 months ago
2000
We study almost-sure limiting properties, taken as 0, of the finite horizon sequence of random estimates { 0, 1, 2, . . . , T/ } for the linear stochastic gradient algorithm n+1 ...
127
Voted
CCS
2008
ACM
15 years 5 months ago
2008
ACM
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
108
Voted
MST
2006
15 years 3 months ago
2006
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...
126
Voted
GRAPHICSINTERFACE
2004
15 years 5 months ago
2004
Manual opacity transfer function editing for volume rendering can be a difficult and counter-intuitive process. This paper proposes a logarithmically scaled editor, and argues tha...