Timeline for Shamir Secret sharing - Can share generator keep x values secret?
Current License: CC BY-SA 3.0
23 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 9, 2017 at 13:41 | history | edited | mikeazo | CC BY-SA 3.0 |
deleted 35 characters in body
|
| Jul 9, 2017 at 2:56 | history | edited | e-sushi | CC BY-SA 3.0 |
link dead. title unknown so I can't check for alternative sources
|
| Jun 3, 2014 at 13:14 | history | edited | mikeazo | CC BY-SA 3.0 |
added 37 characters in body
|
| Jun 3, 2014 at 13:05 | history | edited | mikeazo | CC BY-SA 3.0 |
added 334 characters in body
|
| May 27, 2014 at 12:31 | history | edited | mikeazo | CC BY-SA 3.0 |
deleted 3 characters in body
|
| S May 21, 2014 at 23:47 | history | notice removed | CommunityBot | ||
| S May 21, 2014 at 23:47 | history | unlocked | CommunityBot | ||
| S May 21, 2014 at 22:01 | history | notice added | mikeazo | Content dispute | |
| S May 21, 2014 at 22:01 | history | locked | mikeazo | ||
| May 21, 2014 at 21:23 | review | Suggested edits | |||
| May 21, 2014 at 21:25 | |||||
| May 21, 2014 at 21:19 | review | Suggested edits | |||
| May 21, 2014 at 21:22 | |||||
| May 21, 2014 at 21:03 | review | Suggested edits | |||
| May 21, 2014 at 21:11 | |||||
| May 21, 2014 at 19:46 | vote | accept | user13676 | ||
| May 21, 2014 at 21:31 | |||||
| May 21, 2014 at 19:44 | comment | added | mikeazo | @user13676, not sure. I'd have to think about it. If the underlying field is large enough, it is likely not a problem. | |
| May 21, 2014 at 19:37 | comment | added | user13676 | Do you think if it Would be OK if these X values are not uniformly random, as the must be distinct random values. | |
| May 21, 2014 at 19:28 | comment | added | mikeazo | @user13676 Given the shares, each possible secret value (reconstructed using some vector of x values) must be equally likely. Show that this holds, and you will formally prove that it is secure. | |
| May 21, 2014 at 19:25 | comment | added | user13676 | How can I formally prove that its secure? | |
| May 21, 2014 at 19:24 | comment | added | mikeazo | @user13676 if you do ask another question on the site, I'd suggest keeping it as generic as possible. Basically it seems like you want outsourced computation where privacy is preserved even if all the computation servers are malicious. | |
| May 21, 2014 at 19:22 | comment | added | mikeazo | @user13676, if I get this straight, you want to allow all the share holders to compute on the shares without the dealer needing to participate, then allow the dealer to reconstruct the output. At the same time, it is possible that all share holders are corrupt. Is that correct? My solution is an answer to the question as posed. If you have additional requirements, they should be in the question (though at this point you may be best off asking a new question on the site). | |
| May 21, 2014 at 19:11 | comment | added | user13676 |
Hi, Many thanks for your reply. You assumed right, its threshold t and assuming that all recipient can collude to construct the secret. In terms of your solution, I think it wont work in my system as all shares are going to be multiplied or added by some values.
|
|
| May 21, 2014 at 18:41 | history | edited | mikeazo | CC BY-SA 3.0 |
added 166 characters in body
|
| May 21, 2014 at 18:33 | history | edited | mikeazo | CC BY-SA 3.0 |
added 41 characters in body
|
| May 21, 2014 at 18:22 | history | answered | mikeazo | CC BY-SA 3.0 |