搜索结果: 1-7 共查到“k cheaters”相关记录7条 . 查询时间(0.093 秒)
Secure Trick-Taking Game Protocols: How to Play Online Spades with Cheaters
Trick-Taking Games Zero-Knowledge Spades, Bridge
2019/4/15
Trick-Taking Games (TTGs) are card games in which each player plays one of his cards in turn according to a given rule. The player with the highest card then wins the trick, i.e., he gets all the card...
Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters without Honest Majority
secret sharing universal construction rushing cheater
2017/5/26
For conventional secret sharing, if cheaters can submit possibly forged shares after observing shares of the honest users in the reconstruction phase, they can disturb the protocol and reconstruct the...
Catching MPC Cheaters: Identification and Openability
cryptographic protocols multi-party computation
2016/6/15
Secure multi-party computation (MPC) protocols do not completely prevent malicious parties from cheating and disrupting the computation. A coalition of malicious parties can repeatedly cause the compu...
Efficient Threshold Secret Sharing Schemes Secure against Rushing Cheaters
Secret Sharing Cheating Detection Cheater Identification
2015/12/21
In this paper, we consider three very important issues namely detection,
identification and robustness of k-out-of-n secret sharing schemes against rushing cheaters
who are allowed to submit (possib...
Detection of Cheaters in Non-interactive Polynomial Evaluation
foundations / Secret sharing non-interactive polynomial evaluation cheating detection
2013/2/21
In this paper, we consider both theoretical and practical aspects of robust NI-PE (non-interactive polynomial evaluation with detection of cheaters). First, we give a necessary condition of adversary ...
Exact, Efficient and Information-Theoretically Secure Voting with an Arbitrary Number of Cheaters
voting multiparty computation information-theoretic security secret sharing simultaneous broadcast everlasting security
2010/11/26
We present three voting protocols with unconditional privacy and correctness, without assuming any bound on the number of corrupt participants. All protocols have polynomial complexity and require pri...
A Secret Sharing Scheme for Preventing the Cheaters from Acquiring the Secret
Secret Sharing Scheme Cheaters Acquiring the Secret
2009/2/17
In this paper, we propose a secret sharing scheme which prevents the cheaters from recovering the secret when the honest participants cannot, with high probability. The scheme is a (k, n) threshold sc...