ampersand
Reputation
200
Top tag
Next privilege 250 Rep.
 Mar25 awarded Popular Question Mar20 comment Necessity for finite field arithmetic and the prime number p in Shamir's Secret Sharing Scheme @mikeazo it kept opening only the first page on my tablet. Just tried on my laptop and the whole thing is downloaded. Reading now. Thanks! Mar20 comment Necessity for finite field arithmetic and the prime number p in Shamir's Secret Sharing Scheme @mikeazo thanks. Seems interesting, but I cannot get the full article. Do you have a direct link? Sep24 awarded Autobiographer Dec21 accepted Does zero-padding the secret in Shamir's sharing scheme increase security? Dec20 asked Does zero-padding the secret in Shamir's sharing scheme increase security? Dec16 accepted How to generate a random integer in interval $[1, 2^n-1]$ from random integer in interval $[0, 2^n-1]$? Dec15 comment How to generate a random integer in interval $[1, 2^n-1]$ from random integer in interval $[0, 2^n-1]$? @PaĆ­loEbermann you are correct, I entered the interval incorrectly. Fixed now, thank you. Dec15 revised How to generate a random integer in interval $[1, 2^n-1]$ from random integer in interval $[0, 2^n-1]$? deleted 6 characters in body; edited title Dec15 revised Necessity for finite field arithmetic and the prime number p in Shamir's Secret Sharing Scheme added 13 characters in body Dec15 asked How to generate a random integer in interval $[1, 2^n-1]$ from random integer in interval $[0, 2^n-1]$? Dec11 comment Contruct a protocol to determine if three secret keys are different, without revealing any of them? Are they to communicate sequentially? Therefore the last party will be the one to report whether the secrets are equal? Or must everyone communicate with everyone else and each determine individually the (non)equivalence of their secrets? Dec9 comment Is there a secret sharing scheme which allows delegation/re-sharing without reconstructing the original secret? In the typical programming scenario, it wouldn't be created then evaluated. It would just be evaluated at xi by summing the values of the basis polynomials evaluated at xi. The same programming construct the parties use to evaluate L(0) can be used to evaluate L(xi). Not sure if you need me to recreate the steps or the polynomial here, or if you are getting at something else? Dec8 revised Is there a secret sharing scheme which allows delegation/re-sharing without reconstructing the original secret? added 303 characters in body Dec8 revised Is there a secret sharing scheme which allows delegation/re-sharing without reconstructing the original secret? added 303 characters in body Dec4 awarded Teacher Dec3 answered Is there a secret sharing scheme which allows delegation/re-sharing without reconstructing the original secret? Nov28 comment Necessity for finite field arithmetic and the prime number p in Shamir's Secret Sharing Scheme @fgrieu thanks for that quote. I overlooked it. Had I read that statement I would not have asked this unnecessary Q. Nov28 awarded Scholar Nov28 accepted Necessity for finite field arithmetic and the prime number p in Shamir's Secret Sharing Scheme