搜索结果: 1-15 共查到“军事学 Round Complexity”相关记录15条 . 查询时间(0.093 秒)
Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation
Fairness and Guaranteed Output Delivery MPC Round Complexity
2019/9/5
Two of the most sought-after properties of Multi-party Computation (MPC) protocols are fairness and guaranteed output delivery (GOD), the latter also referred to as robustness. Achieving both, however...
Non-malleable Zero-Knowledge Arguments with Lower Round Complexity
Zero-Knowledge Non-Malleable Multi-Collision Resistance
2019/8/30
Round complexity is one of the fundamental problems in zero-knowledge proof systems. Non-malleable zero-knowledge (NMZK) protocols are zero-knowledge protocols that provide security even when man-in-t...
Although Byzantine Agreement (BA) has been studied for three decades, perhaps somewhat surprisingly, there still exist significant gaps in our understanding regarding its round complexity. First, alth...
On the Round Complexity of Randomized Byzantine Agreement
Byzantine agreement lower bound round complexity
2019/7/31
We prove lower bounds on the round complexity of randomized Byzantine agreement (BA) protocols, bounding the halting probability of such protocols after one and two rounds.
Degree 2 is Complete for the Round-Complexity of Malicious MPC
foundations Multi-Party Computation
2019/3/1
We show, via a non-interactive reduction, that the existence of a secure multi-party computation (MPC) protocol for degree-22 functions implies the existence of a protocol with the same round complexi...
We settle the exact round complexity of three-party computation (3PC) in honest-majority setting, for a range of security notions such as selective abort, unanimous abort, fairness and guaranteed outp...
On the Round Complexity of OT Extension
Oblivious Transfer Extension Symmetric Key Primitives Random Oracle Model
2017/12/13
We show that any OT extension protocol based on one-way functions (or more generally any symmetric-key primitive) either requires an additional round compared to the base OTs or must make a non-black-...
On the Exact Round Complexity of Self-Composable Two-Party Computation
secure two-party computation concurrent security exact round complexity
2017/2/20
In contrast, round complexity of secure computation in the concurrent setting, where several protocols may run simultaneously, is poorly understood. Since standard polynomial time simulation is imposs...
The Exact Round Complexity of Secure Computation
Exact Round Complexity Multi-Party Computation Two-Party Computation
2016/3/9
We revisit the exact round complexity of secure computation in the multi-party and twoparty
settings. For the special case of two-parties without a simultaneous message exchange channel, this
questi...
The Round Complexity of General VSS
Round Complexity VSS Non-threshold Byzantine Unbounded Computing Power
2010/11/30
The round complexity of verifiable secret sharing (VSS) schemes has been studied extensively for threshold adversaries. In particular, Fitzi et al. showed an efficient 3-round VSS for $n \geq 3t+1$ \c...
On the Round Complexity of Covert Computation
Covert Computation a secure computation protocol
2010/7/13
In STOC'05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or steganographic) channel withou...
On Round Complexity of Unconditionally Secure VSS
Verifiable Secret Sharing Error Probability Information Theoretic Security
2009/6/3
In this work, we initiate the study of round complexity of unconditionally secure weak secret
sharing (UWSS) and unconditionally secure veri¯able secret sharing (UVSS) 1 in the presence of an
a...
Concurrent Zero Knowledge Proofs with Logarithmic Round-Complexity
Concurrent Zero Knowledge Proofs Logarithmic Round-Complexity
2009/4/14
We consider the problem of constructing Concurrent Zero Knowledge Proofs [6], in which the fascinating
and useful “zero knowledge” property is guaranteed even in situations where multiple concurrent
...
Finding Collisions in Interactive Protocols-A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments
Collisions Protocols-A Tight Complexity of Statistically-Hiding Commitments
2008/9/3
We study the round complexity of various cryptographic protocols. Our main result is a tight
lower bound on the round complexity of any fully-black-box construction of a statistically-hiding commitme...
Improving the Round Complexity of VSS in Point-to-Point Networks
VSS Point-to-Point Networks Round Complexity
2008/5/28
We revisit the following question: what is the optimal round complexity of verifiable secret
sharing (VSS)?We focus here on the case of perfectly-secure VSS where the number of corrupted
parties t s...