搜索结果: 1-15 共查到“密码学 Fairness”相关记录22条 . 查询时间(0.222 秒)
On the optionality and fairness of Atomic Swaps
Blockchain Atomic Swap Cross-Chain Transactions
2019/8/6
Atomic Swap enables two parties to atomically exchange their own cryptocurrencies without trusted third parties. However, it was pointed out that an Atomic Swap is equivalent to an American Call Optio...
Coin toss has been extensively studied in the cryptography literature, and the well-accepted notion of fairness (henceforth called strong fairness) requires that a corrupt coalition cannot cause non-n...
Tendermint-core blockchains offer strong consistency (no forks) in an open system relying on two ingredients (i) a set of validators that generate blocks via a variant of Practical Byzantine Fault Tol...
Fairness in an Unfair World: Fair Multiparty Computation from public Bulletin Boards
Fair Multiparty Computation public Bulletin Boards
2017/11/13
Secure multiparty computation allows mutually distrusting parties to compute a function on their private inputs such that nothing but the function output is revealed. Achieving fairness --- that all p...
Secure Two-Party Computation with Fairness -- A Necessary Design Principle
secure computation fairness definitions of security
2017/9/28
Protocols for secure two-party computation enable a pair of mutually distrustful parties to carry out a joint computation of their private inputs without revealing anything but the output. One importa...
Managing Secrets with Consensus Networks: Fairness, Ransomware and Access Control
Ransomware Access Control
2017/3/6
In this work we investigate the problem of using public consensus networks -- exemplified by systems like Ethereum and Bitcoin -- to perform cryptographic functionalities that involve the manipulation...
Towards Characterizing Complete Fairness in Secure Two-Party Computation
Complete fairness secure two-party computation foundations
2016/1/26
The well known impossibility result of Cleve (STOC 1986) implies that in general it is
impossible to securely compute a function with complete fairness without an honest majority.
Since then, the ac...
On the Classification of Finite Boolean Functions up to Fairness
Complete Fairness Secure Two-Party Computation
2016/1/8
Two parties, P1 and P2, wish to jointly compute some function
f(x, y) where P1 only knows x, whereas P2 only knows y. Furthermore,
and most importantly, the parties wish to reveal only what the
out...
Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation
secure multiparty computation theoretical foundations complete fairness
2016/1/7
In the setting of secure multiparty computation, a set of parties wish to compute a joint
function of their private inputs. The computation should preserve security properties such as
privacy, corre...
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
Fairness secure two-party computation foundations
2016/1/5
Fairness is a desirable property in secure computation; informally it means that if one party gets the output of the function, then all parties get the output. Alas, an implication of Cleve's result (...
Constant-Round MPC with Fairness and Guarantee of Output Delivery
MPC Threshold FHE Learning with error
2015/12/31
We study the round complexity of multiparty computation with fairness and guaranteed output
delivery, assuming existence of an honest majority. We demonstrate a new lower bound and a matching
upper ...
Fairness in Secure Two-Party Computation with Rational Players
Cryptography embedded XOR Fairness
2015/12/21
A seminal result of Cleve (STOC 1986) showed that fairness, in general, is impossible to
achieve in case of two-party computation if one of them is malicious. Later, Gordon et al.
(STOC 2008) observ...
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...
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a trusted party which returns...
Complete Fairness in Multi-Party Computation Without an Honest Majority
Complete Fairness Multi-Party Computation Honest Majority
2009/6/9
Gordon et al. recently showed that certain (non-trivial) functions can be computed with
complete fairness in the two-party setting. Motivated by their results, we initiate a study of
complete fairne...