Skip to main content
Cryptography

Return to Question

Bumped by Community user
better syntax
Source Link
PentaKon
PentaKon
  • 195
  • 6

Does it exist? Specifically using Shamir secret sharing based MPC and looking for a (non-)interactive way to prove that the secret value is valid. A value is valid if it is part of a set for example $[0,1] \in \mathbb Z $ or non-negative, or at least that it is the secret key of some other value, for. For example if $s$ is the secret and $a^s \bmod p$$h=a^s \bmod p$ is the encrypted message and I distribute $s$ using secret sharing, can I prove that to the receivers that the shared value is indeed the $s$ value used in $h$?

Does it exist? Specifically using Shamir secret sharing based MPC and looking for a (non-)interactive way to prove that the secret value is valid. A value is valid if it is part of a set for example $[0,1] \in \mathbb Z $ or non-negative or at least that it is the secret key of some other value, for example if $s$ is the secret and $a^s \bmod p$ is the encrypted message and I distribute $s$ using secret sharing, can I prove that to the receivers that the shared value is indeed $s$?

Does it exist? Specifically using Shamir secret sharing based MPC and looking for a (non-)interactive way to prove that the secret value is valid. A value is valid if it is part of a set for example $[0,1] \in \mathbb Z $ or non-negative, or at least that it is the secret key of some other value. For example if $s$ is the secret and $h=a^s \bmod p$ is the encrypted message and I distribute $s$ using secret sharing, can I prove to the receivers that the shared value is indeed the $s$ value used in $h$?

Source Link
PentaKon
PentaKon
  • 195
  • 6

Non-interactive proof of value in MPC

Does it exist? Specifically using Shamir secret sharing based MPC and looking for a (non-)interactive way to prove that the secret value is valid. A value is valid if it is part of a set for example $[0,1] \in \mathbb Z $ or non-negative or at least that it is the secret key of some other value, for example if $s$ is the secret and $a^s \bmod p$ is the encrypted message and I distribute $s$ using secret sharing, can I prove that to the receivers that the shared value is indeed $s$?