147 search results - page 15 / 30 » Logarithmic keying |
MYCRYPT
2005
Springer
14 years 3 months ago
2005
Springer
This article presents optimization results on the recent MOVA undeniable signature scheme presented by Monnerat and Vaudenay at PKC ’04 as well as its generalization proposed at ...
FUN
2010
Springer
14 years 2 months ago
2010
Springer
The way memory hierarchy has evolved in recent decades has opened new challenges in the development of indexing structures in general and spatial access methods in particular. In t...
FC
2010
Springer
14 years 1 months ago
2010
Springer
We present a new construction of divisible e-cash that makes use of 1) a new generation method of the binary tree of keys; 2) a new way of using bounded accumulators. The transacti...
STOC
1995
ACM
14 years 1 months ago
1995
ACM
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
JUCS
2006
13 years 9 months ago
2006
: Shor's algorithms for the integer factorization and the discrete logarithm problems can be regarded as a negative effect of the quantum mechanism on publickey cryptography. ...