Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
1 answer
1k views

Asmuth-Bloom's threshold secret sharing scheme

I was learning Asmuth-Bloom's threshold secret sharing scheme. I was working out an example as given in this Wikipedia article. As per the example, the secret, d is 2, the number of shares, n is 4 and ...
vishnuvp's user avatar
  • 418
1 vote
0 answers
75 views

Reducing key shares in Damgård-Dupont threshold RSA

I'm working on understanding and implementing Damgård, I., & Dupont, K. (2005). Efficient Threshold RSA Signatures with General Moduli and No Extra Assumptions. Public Key Cryptography-PKC 2005,...
Henryk Plötz's user avatar