Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
round complexity
Description:
A measure of the number of communication exchanges required by a distributed or cryptographic protocol.
Primary topic:
Cryptography and Data Security (49%)
Related topics:
Cryptography and Data Security (49%),
Complexity and Algorithms in Graphs (28%),
Distributed systems and fault tolerance (10%)
OpenAlex ID:
keywords/round-complexity
Efficient Multiparty Protocols Using Circuit Randomization
2007
·
Donald Beaver
·
Springer eBooks
·
962
The round complexity of secure protocols
1990
·
D. Beaver
, S. Micali
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
824
PDF
Separating succinct non-interactive arguments from all falsifiable assumptions
2011
·
Craig Gentry
, Daniel Wichs
·
ACM Symposium on Theory of Computing (STOC)
·
484
PDF
On the Composition of Zero-Knowledge Proof Systems
1996
·
Oded Goldreich
, Hugo Krawczyk
·
SIAM Journal on Computing
·
415
More Efficient Constant-Round Multi-party Computation from BMR and SHE
2016
·
Yehuda Lindell
, Nigel P. Smart
, et al.
·
Lecture notes in computer science
·
364
CrypTFlow2: Practical 2-Party Secure Inference
2020
·
Deevashwer Rathee
, Mayank Rathee
, et al.
·
ACM SIGSAC Conference on Computer and Communications Security (CCS)
·
363
PDF
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
2016
·
Jonathan Bootle
, Andrea Cerulli
, et al.
·
Lecture notes in computer science
·
346
PDF
Advances in Cryptology - ASIACRYPT 2008: 14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, December 7-11, 2008. Proceedings
2008
·
Hutchison, David
, Naor, Moni
, et al.
·
Lecture notes in computer science
·
307
Efficient Concurrent Zero-Knowledge in the Auxiliary String Model
2000
·
Ivan Damgård
·
Lecture notes in computer science
·
295
Interactive Oracle Proofs
2016
·
Eli Ben-Sasson
, Alessandro Chiesa
, et al.
·
Lecture notes in computer science
·
291
Communication complexity of group key distribution
1998
·
Klaus Becker
, Uta Wille
·
ACM SIGSAC Conference on Computer and Communications Security (CCS)
·
277
PDF
Distributed Verification and Hardness of Distributed Approximation
2012
·
Atish Das Sarma
, Stephan Holzer
, et al.
·
SIAM Journal on Computing
·
233
PDF
Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
2007
·
Takashi Nishide
, Kazuo Ohta
·
Springer eBooks
·
230
Authenticated multi-party key agreement
1996
·
Mike Just
, Serge Vaudenay
·
Lecture notes in computer science
·
195
Parallel and Concurrent Security of the HB and HB + Protocols
2006
·
Jonathan Katz
, Ji Sun Shin
·
Lecture notes in computer science
·
188
PDF
Two-Round Secure MPC from Indistinguishability Obfuscation
2014
·
Sanjam Garg
, Craig Gentry
, et al.
·
Lecture notes in computer science
·
184
Round-Optimal Secure Two-Party Computation
2004
·
Jonathan Katz
, Rafail Ostrovsky
·
Lecture notes in computer science
·
184
Privacy and communication complexity
1989
·
E. Kushilevitz
·
Annual Symposium on Foundations of Computer Science
·
179
Mix-Networks on Permutation Networks
1999
·
Masayuki Abe
·
Lecture notes in computer science
·
175
Constant-time distributed dominating set approximation
2003
·
Fabian Kuhn
, Rogert Wattenhofer
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
174
UC Non-Interactive, Proactive, Threshold ECDSA with Identifiable Aborts
2020
·
Ran Canetti
, Rosario Gennaro
, et al.
·
ACM SIGSAC Conference on Computer and Communications Security (CCS)
·
172
Round-Optimal Composable Blind Signatures in the Common Reference String Model
2006
·
Marc Fischlin
·
Lecture notes in computer science
·
163
Secure Computation of the k th -Ranked Element
2004
·
Gagan Aggarwal
, Nina Mishra
, et al.
·
Lecture notes in computer science
·
158
An efficient algorithm for byzantine agreement without authentication
1982
·
Danny Dolev
, Michael J. Fischer
, et al.
·
Information and Control
·
152
Highly-Efficient and Composable Password-Protected Secret Sharing (Or: How to Protect Your Bitcoin Wallet Online)
2016
·
Stanislaw Jarecki
, Aggelos Kiayias
, et al.
·
IEEE European Symposium on Security and Privacy
·
140
Show more works
View as search
Works count:
1,372
Citation count:
23,710
Year
Topic
Type