Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Projects
Activities
Datasets
Research Labs / Equipment
Search by expertise, name or affiliation
Sublinear message bounds of authenticated implicit Byzantine agreement
Manish Kumar
, Anisur Rahaman Molla
Research output
:
Contribution to journal
›
Article
›
peer-review
1
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Sublinear message bounds of authenticated implicit Byzantine agreement'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Message Complexity
100%
Byzantine Agreement
100%
Dishonest Majority
42%
Byzantine Agreement Protocols
42%
Input Values
28%
Hash Function
28%
Distributed Network
28%
Global Coin
28%
High Probability
14%
Cryptographic
14%
Need to Know
14%
Time Complexity
14%
Byzantine Empire
14%
Node number
14%
CONGEST Model
14%
Fully Connected
14%
Complexity Results
14%
N-factor
14%
Byzantine Adversary
14%
Relevant Results
14%
Shared Inputs
14%
Byzantine Nodes
14%
Agreement Algorithm
14%
Byzantine Agreement Problem
14%
Computer Science
Distributed Network
100%
Hash Function
100%
Nonempty Subset
100%
Time Complexity
50%
Complexity Result
50%