Distributed Discrete Logarithm
Two parties holding group elements that differ by a known small amount must non-interactively output shares differing by that amount – the share-conversion step group-based homomorphic secret sharing rests on.
| Status | Statement | Tags |
|---|---|---|
|
Optimal 2D LPHS Open, and asserted rather than asked: the source prints the algorithm, conjectures the error rate, reports experiments consistent with it, states it could not analyse it, and leaves settling it to future work. The matching lower bound is the source’s own theorem, so a proof would close the two-dimensional case exactly. 7 open |
Distributed Discrete LogarithmGeneric Group ModelLocality Preserving Hashingtight-boundadaptation (ai) |
No matching items