# Tag Info

0

Comparing data sets can also be done using "order preserving Encryption" techniques

2

Usually, the interleaving of wNAFs is faster than Shamir's trick for simultaneous point multiplication. Using interleaving with window sizes 5 (fixed) and 4 (random), the total number of operations is roughly (taken from Hankerson et al's Guide to ECC) $(0.37t + 3)A + (t + 1)D$ where t is the bitlength of the scalars (which should be the same as the ...

1

After looking through some papers, I feel qualified to answer my question, for the record. The scheme works and I've found no evidence that it has been broken. A good review is given in "A survey of ring signature" by L. Wang, which contains a section on linkable signatures. The technique used in Liu's 2004 paper from the question makes O(n)-long ...

1

While I think this is changing very recently with expiration of additional patents and SRP included with OpenSSL one of the central problems is compatibility with existing authentication databases. NT OWFs, unix crypts, directory server hashes..etc everything but plaintext passwords (e.g. plaintext reversibly encrypted on disk) are incompatible with SRP. ...

Top 50 recent answers are included