Rida A. Bazzi

Rida A. Bazzi

Auto-generated profile, based on publicly available information

Rida A. Bazzi

Arizona State University, Tempe, Arizona, USA

Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 1993
Verified
Conference Paper
Open access
PDF file
MAMustaque Ahamad
Mustaque Ahamad
RBRida A. Bazzi
Rida A. Bazzi
RJRanjit John
Ranjit John
PKPrince Kohli
Prince Kohli
GNGil Neiger
Gil Neiger

1 January 2000 in Distributed Computing
Verified
Journal Article
Closed access
PDF file
RBRida A. Bazzi
Rida A. Bazzi

8 September 2006 in Distributed Computing
Verified
Journal Article
Closed access
PDF file
RBRida A. Bazzi
Rida A. Bazzi
GKGoran Konjevod
Goran Konjevod


1 January 2006
Verified
Book Chapter
Closed access
PDF file
AAAmitanand S. Aiyer
Amitanand S. Aiyer
LALorenzo Alvisi
Lorenzo Alvisi
RBRida A. Bazzi
Rida A. Bazzi

12 August 2007
Verified
Conference Paper
Open access
AAAmitanand Aiyer
Amitanand Aiyer
LALorenzo Alvisi
Lorenzo Alvisi
RBRida A. Bazzi
Rida A. Bazzi
We present the first optimally resilient, bounded, wait-free implementation of a distributed atomic register, tolerating Byzantine readers and (up to one-third of) Byzantine servers, without the use of unproven cryptographic primitives or requiring communication among servers. Unlike previous (non-optimal) solutions, the sizes of messages sent to writers depend only on the actual number of active readers and not on the total number of readers in the system. With a novel use of secret sharing techniques combined with write back throttling we present the first solution to tolerate Byzantine readers information theoretically, without the use of cryptographic techniques based on unproven number- theoretic assumptions.