搜索结果: 1-13 共查到“cut-and-choose”相关记录13条 . 查询时间(0.171 秒)
Cut-and-choose (C&C) is the standard approach to making Yao’s garbled circuit two-party computation (2PC) protocol secure against malicious adversaries. Traditional cut-and-choose operates at the leve...
Cost-Aware Cut-and-Choose Games with Applications in Cryptography and Prefix-Free Codes
Cut-and-choose games Algorithmic game theory Unequal-cost Huffman codes
2017/2/28
Cost-aware cut-and-choose game is a fundamental technique that has many cryptographic applications. Best existing solutions of this game assumed for simplicity that the number of challenges is publicl...
Garbled RAM, introduced by Lu and Ostrovsky (Eurocrypt 2013), provides a novel method to garble RAM (Random Access Machine) programs directly. It can be seen as a RAM analogue of Yao's garbled circuit...
Fast Optimistically Fair Cut-and-Choose 2PC
secure two-party computation covert adversaries cut-and-choose
2016/1/27
Secure two party computation (2PC) is a well-studied problem with many real world applications.
Due to Cleve’s result on general impossibility of fairness, however, the state-of-the-art
solutions on...
Efficient Three-Party Computation from Cut-and-Choose
cryptographic protocols secure computation
2016/1/25
With relatively few exceptions, the literature on efficient (practical) secure computation has
focused on secure two-party computation (2PC). It is, in general, unclear whether the techniques
used t...
Cut-and-Choose Based Two-Party Computation in the Online/Offline and Batch Settings
secure computation garbled circuits malicious adversaries
2016/1/7
Protocols for secure two-party computation enable a pair of mistrusting parties to compute a joint function of their private inputs without revealing anything but the output. One of the fundamental te...
Cut-and-Choose Bilateral Oblivious Transfer and Its Application in Secure Two-party Computation
Secure Two-party Computation Round Complexity Cut-and-choose Inverse OT
2016/1/7
In secure two-party computation protocols, the cut-and-choose paradigm is used to prevent
the malicious party who constructs the garbled circuits from cheating. In previous realization of the cutand-...
Non-Interactive Secure Computation Based on Cut-and-Choose
cryptographic protocols public-key encryption
2015/12/31
In recent years, secure two-party computation (2PC) has been demonstrated to be feasible
in practice. However, all efficient general-computation 2PC protocols require multiple rounds of interaction
...
Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique
secure two-party computation cut-and-choose
2014/3/10
A Secure Two Party Computation (S2PC) protocol allows two parties to compute over their combined private inputs, as if intermediated by a trusted third party. In the active model, security is maintain...
Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
cryptographic protocols
2013/4/18
In the setting of secure two-party computation, two parties wish to securely compute a joint function of their private inputs, while revealing only the output. One of the primary techniques for achiev...
Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose
cryptographic protocols
2013/4/18
Beginning with the work of Lindell and Pinkas, researchers have proposed several protocols for secure two-party computation based on the cut-and-choose paradigm. In existing instantiations of this par...
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
cryptographic protocols secure two-party computation efficiency DDH
2010/7/13
Protocols for secure two-party computation enable a pair of parties to compute a function of their inputs while preserving security properties such as privacy, correctness and independence of inputs. ...
Improving Cut-and-Choose in Verifiable Encryption and Fair Exchange Protocols using Trusted Computing Technology
Cut-and-Choose Verifiable Encryption Fair Exchange Protocols Trusted Computing Technology
2009/9/11
Cut-and-choose is used in interactive zero-knowledge protocols in which a prover answers a series
of random challenges that establish with high probability that the prover is honestly following the d...