Shamir's Secret Sharing: What am I doing wrong? It seems, like you used simple division. However, as you are working in $\mathbb{Z}_p^*$, division is multiplication with the modular inverse.
verify contents, but not order I think he is basically asking for a zero knowledge proof that some ciphertext contains a permutation of some known set.
Aug 30
comment
How can the Diffie-Hellman key exchange be extended to three parties? I suppose you want to work in group $\mathbb{Z}_p^*$. The problem is that your numbers don't make sense. First of all the order of $\mathbb{Z}_p^*$ is 4, therefore valid exponents are $\{0,1,2,3\}$. Additionally you would usually want a group of prime order. But other than that, yes, if you work in $\mathbb{Z}_p^*$, the exponentiations are done $\mod p$
meta user
network profile
