Rida A. Bazzi

Associate Professor

PhD, Georgia Institute of Technology, 1994

bazziµasuledu *

MW 10:45-11:45, Th 9:30-10:30 ‘

(480) 965-2796 (

(480) 965-2751 7

Courses (Spring 2008)

• Compiler Construction I (CSE440/598)
• Programming Languages (CSE 340)

Conferences

• PODC: 2008 General Chair; 2008, 2007 Steering Committee; 2007 Treasurer; 2005, 2000 Program Committee member; 2005, 2004 Poster Chair
• Ad-Hoc Now 2006, 2005 Committee member

• COMPSAC 2003 Committee member
• IPDPS 2002 Committee member
• DISC 2001 Committee member
• ICDCS 2008 Distributed Algorithms Program Commnittee; 2001 Poster Chair

Research

My general area of research is distributed computing with special interests in fault tolerance and security. A list of my publications follows. This is not a complete list of publications. For papers that appeared in both conferences and journals, I omit the conference version in most cases. The color coded symbol after each listing indicates the general area of the paper:

• Fault tolerance Ì
• Quorums Ì
• Security Ì
• Knowledge Ì

Journal Papers

• Rida A. Bazzi, Goran Konjevod: On the establishment of distinct identities in overlay networks. Distributed Computing. Distributed Computing 19(4): 267-287 (2007). Ì
• Rida A. Bazzi and Gil Neiger. Simplifying Fault Tolerance: Providing the Abstraction of Crash Failures, Journal of the ACM, Vol.48, No. 3, pp. 499-554, ACM, May 2001. Ì
• Rida A. Bazzi. Access cost for asynchronous Byzantine quorum systems. Distributed Computing,, Vol. 14, No. 1, pp 41-48, ACM-Springer, January 2001 (Conference version). Ì Ì
• Rida A. Bazzi. Planar Quorums. Theoretical Computer Science, Vol. 243, Nos. 1-2, pp. 243--268, Elsevier, July 2000. Ì Ì
• Rida A. Bazzi. Synchronous Byzantine Quorum Systems. Distributed Computing, Vol. 13, No. 1, pp. 45--52 ACM-Springer, January 2000. Ì Ì
• Rida A. Bazzi, Gil Neiger and Gary L. Peterson. On the use of registers in achieving wait-free Consensus. Distributed Computing, Vol. 10, No. 3, pp. 117-128, Springer, 1997. Ì
• Gil Neiger and Rida A. Bazzi. Using knowledge to optimally achieve coordination in distributed systems. Theoretical Computer Science, 220, pp. 31-65, Elsevier, 1999. Ì
• Rida A. Bazzi and Gil Neiger. The Complexity of almost optimal coordination. Algorithmica, Vol. 17, pp. 308-321, Springer, 1997. Ì

Book Chapter

• Rida A. Bazzi and Feras Karablieh. Development of reliable commercial applications in large and open distributed systems. In Handbook of E-business, Paul B. Lowry, J. Owen Cherrington, and Ronald R. Watson eds., CRC Press 2002. Ì Ì

Refereed Conference Papers

• Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi: Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions. International Symposium on Distributed Computing (DISC) 2007: 7-19
• Rida A. Bazzi, Yin Ding: Bounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients.. International Symposium on Distributed Computing (DISC) 2006: 299-313. Ì
• Rida A. Bazzi, Young-ri Choi, Mohamed G. Gouda: Hop Chains: Secure Routing and the Establishment of Distinct Identities. International Conference On Principles Of Distributed Systems (OPODIS) 2006: 365-379 Award Paper Ì
• Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi: Byzantine and Multi-writer K-Quorums. International Symposium on Distributed Computing (DISC) 2006: 443-458 Ì Ì
• Rida A. Bazzi, Goran Konjevod: On the establishment of distinct identities in overlay networks. ACM Symposium on Principles of Distributed Computing (PODC) 2005: 312-320 Award Paper Ì
• Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi: On the Availability of Non-strict Quorum Systems. International Symposium on Distributed Computing (DISC) 2005: 48-62. Ì Ì

• Rida A. Bazzi, Goran Konjevod : Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty. International Symposium on Distributed Computing (DISC) 2004: 420-434. Ì Ì
• Rida A. Bazzi, Yin Ding: Non-skipping Timestamps for Byzantine Data Storage Systems. International Symposium on Distributed Computing (DISC) 2004: 405-419. Ì
• Rida A. Bazzi, K. Selcuk Candan, Raphael Badin, and Aziz Fajri. Provably Secure Data Hiding and Tamper Resistance for a Simple Loop Program. In Proceedings of SPIE Aerosense Conference, Orlando, Florida, April 2003. Ì

• Feras Karablieh, Rida A. Bazzi. Heterogeneous Checkpointing for Multithreaded Applications. In Proceedings of the 21st Symposium on Reliable Distributed Systems (SRDS), Japan 2002: 140-149. Ì
• Feras Karablieh, Rida A. Bazzi, and Margaret Hicks. Compiler-Assisted Heterogeneous Checkpointing. In Proceedings of the 20th Symposium on Reliable Distributed Systems (SRDS), New Orleans, Louisiana, 2001. Ì

Non-refereed publications

• Rida A. Bazzi, Yin Ding: Brief announcement: wait-free implementation of multiple-writers/multiple-readers atomic byzantine data storage systems. PODC 2005: 353. Ì
• Ping Lin, K. Selçuk Candan, Rida A. Bazzi, Zhichao Liu: Hiding Data and Code Security for Application Hosting Infrastructure. ISI 2003: 388. Ì
• Rida A. Bazzi, Uday Deshraj, and Feras Karablieh. Compiler-Generated Primary/Backup Pairs in Heterogeneous System (2-page Abstract) International Conference on Dependable Systems and Networks, Goteborg, Sweden, 2001. Ì

Technical Report

• Rida A. Bazzi. Code Hiding for Mobile Agents Security. Technical Report ASU-CSE-TR-111298, Computer Science and Engineering Department, Arizona State University. Ì

Students

• Yin Ding (PhD)
• Kristis Makris (PhD)
• Martin Lehner (MS)
• Venkatesh Mandalapa (MS)
• Rajkumar Ponnusamy (MS)
• Joseph Stith (MS)

Past Students

• Feras Karablieh (PhD)
• Mrgaret Hicks (MS)
• Uday Deshraj (MS)
• Hema Krishnamurthy (MS)
• Amit Shanbhag (MS)
• Jimi Shah (MS)
• Scott Turley (MS)