搜索结果: 1-1 共查到“密码学 rushing adversary”相关记录1条 . 查询时间(0.187 秒)
Towards optimal robust secret sharing with security against a rushing adversary
security against rushing adversary
2019/3/2
Robust secret sharing enables the reconstruction of a secret-shared message in the presence of up to tt (out of nn) {\em incorrect} shares. The most challenging case is when n=2t+1n=2t+1, which is the...