Skip to main content
New
Stack Overflow Jobs powered by Indeed: A job site that puts thousands of tech jobs at your fingertips (U.S. only). Search jobs

New answers tagged

0 votes

Efficient commutative one-way encryption or hashing

I guess what you are trying to looking for is Private Set Intersection (PSI)? Based on your description, you are probably looking for elliptic-curve Diffie-Hellman (ECDH) based PSI
9f241e21's user avatar
  • 414
0 votes

Shamir secret sharing beats XOR in theory or in practice too?

If it's important in your application that secret recovery can be accomplished by xoring shares, you can use a transposed/bit-parallel version of Shamir's scheme, where instead of dividing the secret ...
benrg's user avatar
  • 776
2 votes

Any reason to use Shamir given faster XOR threshold secret sharing algos?

Kurihara, Kiyomoto, Fukushima, and Tanaka (KKFT) claim a 900-fold speed increase over Shamir's scheme for $(k,n)=(3,11)$, which makes no sense since Shamir's scheme over $GF(16)$ is not that slow; 900 ...
benrg's user avatar
  • 776
0 votes
Accepted

Beaver Multiplication Triples in Dynamic Indexing

What exactly do you mean by "the matrix sizes are not clear?" Are the matrix sizes related to the secret input ? If that's the case, then perhaps you have to iterate all the possible inputs ...
vince.h's user avatar
  • 147
2 votes
Accepted

Efficient commutative one-way encryption or hashing

Here is an idea. All quantities are integers, sometime assimilated to bytestrings of stated fixed size. Let $p$ be a public safe prime in interval $[2^{2047},2^{2048}-2^{64})$, that is a prime $p$ in ...
fgrieu's user avatar
  • 142k

Top 50 recent answers are included