On the Exact Round Complexity of Self-composable Two-Party Computation

2017 ◽  
pp. 194-224 ◽  
Author(s):  
Sanjam Garg ◽  
Susumu Kiyoshima ◽  
Omkant Pandey
Keyword(s):  
Round Complexity

scholarly journals On the Round Complexity of the Shuffle Model

2020 ◽  
pp. 683-712
Author(s):  
Amos Beimel ◽  
Iftach Haitner ◽  
Kobbi Nissim ◽  
Uri Stemmer
Keyword(s):  
Round Complexity

scholarly journals Hashing Functions can Simplify Zero-Knowledge Protocol Design (too)

1994 ◽  
Vol 1 (39) ◽  
Author(s):  
Ivan B. Damgård ◽  
Oded Goldreich ◽  
Avi Wigderson
Keyword(s):  
Protocol Design ◽  
Zero Knowledge ◽  
Round Complexity ◽  
Large Round ◽  
Interactive Hashing

In <em>Crypto93</em>, Damgård showed that any constant-round protocol in which the verifier sends only independent, random bits and which is zero-knowledge against the <em>honest</em> verifier can be transformed into a protocol (for the same problem) that is zero-knowledge <em>in general</em>. His transformation was based on the interactive hashing technique of Naor, Ostrovsky, Venkatesan and Yung, and thus the resulting protocol had very large round-complexity.

On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations

2010 ◽  
pp. 189-204 ◽  
Author(s):  
S. Dov Gordon ◽  
Hoeteck Wee ◽  
David Xiao ◽  
Arkady Yerukhimovich
Keyword(s):  
Zero Knowledge ◽  
Round Complexity

Research on the Round Complexity of VSS in the Information Theory Model

2012 ◽  
Vol 6 (8) ◽  
pp. 45-53
Author(s):  
Bin Zhang ◽  
Qiuliang Xu ◽  
Han Jiang ◽  
Xiufeng Zhao
Keyword(s):  
Information Theory ◽  
Theory Model ◽  
Round Complexity

scholarly journals Polynomial Silent Self-Stabilizing p-Star Decomposition†

2019 ◽  
Vol 63 (2) ◽  
pp. 253-266
Author(s):  
Mohammed Haddad ◽  
Colette Johnen ◽  
Sven Köhler
Keyword(s):  
Communication Network ◽  
Distributed Algorithm ◽  
Time Complexity ◽  
Node Degree ◽  
Round Complexity ◽  
Previous Algorithm

Abstract We present a silent self-stabilizing distributed algorithm computing a maximal $\ p$-star decomposition of the underlying communication network. Under the unfair distributed scheduler, the most general scheduler model, the algorithm converges in at most $12\Delta m + \mathcal{O}(m+n)$ moves, where $m$ is the number of edges, $n$ is the number of nodes and $\Delta $ is the maximum node degree. Regarding the time complexity, we obtain the following results: our algorithm outperforms the previously known best algorithm by a factor of $\Delta $ with respect to the move complexity. While the round complexity for the previous algorithm was unknown, we show a $5\big \lfloor \frac{n}{p+1} \big \rfloor +5$ bound for our algorithm.

On the Exact Round Complexity of Secure Three-Party Computation

2021 ◽  
Vol 34 (4) ◽  
Author(s):  
Arpita Patra ◽  
Divya Ravi
Keyword(s):  
Round Complexity

On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission

2012 ◽  
Vol 59 (5) ◽  
pp. 1-35 ◽  
Author(s):  
Ashwinkumar Badanidiyuru ◽  
Arpita Patra ◽  
Ashish Choudhury ◽  
Kannan Srinathan ◽  
C. Pandu Rangan
Keyword(s):  
Communication Complexity ◽  
Network Connectivity ◽  
Trade Off ◽  
Message Transmission ◽  
Round Complexity

scholarly journals Tight bounds on the round complexity of distributed 1-solvable tasks

1995 ◽  
Vol 145 (1-2) ◽  
pp. 271-290 ◽  
Author(s):  
Ofer Biran ◽  
Shlomo Moran ◽  
Shmuel Zaks
Keyword(s):  
Round Complexity
Sign in / Sign up

Export Citation Format

Share Document