Tác giả: K. Srinathan, C. Pandu Rangan, V. Kamakoti
Nguồn trích: Progress in cryptology-INDOCRYPT 2001-LNCS 22418.7
Năm xuất bản: 1905
Số trang: 232
Tóm tắt: A secure threshold protocol for n players tolerating an adversary structure A is feasible iff max , where c =2orc =3 depending on the adversary being eavesdropping (passive) or Byzantine (active) respectively [1]. However, there are situations where the threshold protocol Π for n players tolerating an adversary structure A may not be feasible but by letting each player P a∈A i |a| < n c to act for a number of similar players, say w i , a new secure threshold protocol Π tolerating A may be devi
Từ khóa:
Tải về
