Scribd
Upload
17 views5 pages

2025 CS6858 Distributed Trust Assignment 2

This document outlines the instructions and requirements for Assignment 2 in the CS 6858 course, due on April 20, 2025. It consists of two main problems: analyzing attack strategies for the Ben-Or Protocol and designing an algorithm for the Whole Number Agreement problem, with specific parts addressing different aspects of each problem. Students are required to use LATEX for their submissions and acknowledge any discussion partners.

Uploaded by

ziushaurya9
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views5 pages

2025 CS6858 Distributed Trust Assignment 2

This document outlines the instructions and requirements for Assignment 2 in the CS 6858 course, due on April 20, 2025. It consists of two main problems: analyzing attack strategies for the Ben-Or Protocol and designing an algorithm for the Whole Number Agreement problem, with specific parts addressing different aspects of each problem. Students are required to use LATEX for their submissions and acknowledge any discussion partners.

Uploaded by

ziushaurya9
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Your Name

Your Roll Number

Assignment 2
CS 6858 : Jan – April/May, 2025 : John Augustine
Due : April 20, 2025 (11 PM)

1
Your Name

Instructions

1. You are allowed to discuss with others unless stated otherwise. The dis-
cussion should be for the purpose of jointly figuring out the approach to
solving the problem. You are NOT allowed to discuss detailed solution,
pseudocode, or analysis. You are NOT allowed to share your solution
either in LATEX form or handwritten notes, etc. Please acknowledge your
discussion partners in the Acknowledgments section at the end.

2. You must LATEX your answers. Include figures and plot graphs when-
ever you think it will help in expressing your idea. The figures can be
drawn using software (I use powerpoint for example) or hand-drawn and
scanned. IMPORTANT: all text and mathematics must be in LATEX. I
will ignore all text and mathematics that is handwritten and scanned.

3. Recall that the assignment is worth 5 marks (out of a total of 100). There
are two problems for this assignment and each problem part is worth 1
mark. Word your answers precisely and check them carefully. Typically,
no partial marks will be given for incorrect answers.

Contents
Problem 1. Attacking Ben-Or Protocol 3
Part 1. N = 2t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
Part 2. N = 5t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3

Problem 2. Whole Number Agreement 4


Part 1. Design . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
Part 2. Agreement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
Part 3. Validity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4

CS 6858: Assignment 2 Page 2 of 5


Your Name

Problem 1. Attacking Ben-Or Protocol


In this problem, you are required to analyze the Ben-Or Protocol discussed in class
by developing attack strategies for it. You must provide the specific attack strategies
illustrating the protocol’s limitations. Your assumptions in each case must be minimal
and the attack strategy must be as simple as possible.

Part 1. N = 2t

Design an attack strategy that violates the Ben-Or Consensus Protocol described
in class when N = 2t.

Write your answer here.

Part 2. N = 5t

Design an attack strategy that violates the Ben-Or Byzantine Protocol described
in class when N = 5t.

Write your answer here.

CS 6858: Assignment 2 Page 3 of 5


Your Name

Problem 2. Whole Number Agreement


Consider the following asynchronous agreement problem on n nodes with at-most t po-
tential crash failures. Each node i starts with an input number Bi , encoded in binary
and of length at-most k i.e., 0 ≤ Bi ≤ 2k − 1.
The Whole Number Agreement Problem is one where each of the live nodes decide on an
output D such that

(termination) each live node outputs a number D after some finite amount of time,

(agreement) all live nodes output the same number D,

(validity) D is the input number of at least one node.

Part 1. Design

Describe an algorithm to solve Whole Number Agreement. Explicitly show that it


satisfies termination requirement

Write your pseudocode and required remarks here.

Part 2. Agreement

Show that your algorithm satisfies the agreement condition.

Write your answer here.

Part 3. Validity

Show that your algorithm satisfies the validity condition.

Write your answer here.

CS 6858: Assignment 2 Page 4 of 5


Your Name

Acknowledgments
I would like to thank the following people with whom I discussed ideas.

• ???

CS 6858: Assignment 2 Page 5 of 5

You might also like