[PDF][PDF] Cheating detection and cheater identification in crt-based secret sharing schemes
D Pasailă, V Alexa, S Iftene - 2010 - dspace.wunu.edu.ua
D Pasailă, V Alexa, S Iftene
2010•dspace.wunu.edu.uaIn this paper we analyze the cheating detection and cheater identification problems for the
secret sharing schemes based on the Chinese remainder theorem (CRT), more exactly for
Mignotte [1] and Asmuth-Bloom [2] schemes. We prove that the majority of the solutions for
Shamir's scheme [3] can be translated to these schemes and, moreover, there are some
interesting specific solutions.
secret sharing schemes based on the Chinese remainder theorem (CRT), more exactly for
Mignotte [1] and Asmuth-Bloom [2] schemes. We prove that the majority of the solutions for
Shamir's scheme [3] can be translated to these schemes and, moreover, there are some
interesting specific solutions.
In this paper we analyze the cheating detection and cheater identification problems for the secret sharing schemes based on the Chinese remainder theorem (CRT), more exactly for Mignotte [1] and Asmuth-Bloom [2] schemes. We prove that the majority of the solutions for Shamir’s scheme [3] can be translated to these schemes and, moreover, there are some interesting specific solutions.
dspace.wunu.edu.ua
Showing the best result for this search. See all results