搜索结果: 1-7 共查到“军事学 coin tossing”相关记录7条 . 查询时间(0.085 秒)
Estimating Gaps in Martingales and Applications to Coin-Tossing: Constructions and Hardness
information theory foundations distributed cryptography
2019/7/8
Consider the representative task of designing a distributed coin-tossing protocol for nn processors such that the probability of heads is X0∈[0,1]X0∈[0,1], and an adversary can reset one processor to ...
Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds
delayed-input protocols non-malleable zero knowledge multi-party coin tossing
2017/9/26
4-round non-malleable zero knowledge (NMZK): Goyal et al. in FOCS 2014 showed the first 4-round one-one NMZK argument from one-way functions (OWFs). Their construction requires the prover to know the ...
Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
coin-tossing coin-flipping protocols
2016/12/10
Recently, in a breakthrough result, Haitner and Tsfadia [STOC 2014] constructed an O(log3(r)/r)O(log3(r)/r)-fair (almost optimal) three-party coin-tossing protocol. Their work brings forth a co...
Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness
Fairness coin tossing secure computation malicious and fail-stop adversaries
2013/4/18
It is well known that it is impossible for two parties to toss a coin fairly (Cleve, STOC 1986). This result implies that it is impossible to securely compute with fairness any function that can be us...
Leakage-Resilient Coin Tossing
cryptographic protocols / Leakage-resilient protocols coin tossing distributed computing
2012/3/28
The ability to collectively toss a common coin among $n$ parties in the presence of faults is an important primitive in the arsenal of randomized distributed protocols. In the case of dishonest majori...
Leakage-Resilient Coin Tossing
Leakage-resilient protocols coin tossing distributed computing
2011/6/9
The ability to collectively toss a common coin among $n$ parties in the presence of faults is an important primitive in the arsenal of randomized distributed protocols. In the case of dishonest majori...
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
Secure computation Constant-round protocols Coin-tossing
2009/4/16
In this paper we show that any two-party functionality can be securely computed in a constant
number of rounds, where security is obtained against (polynomial-time) malicious adversaries
that may ar...