Publications

@inproceedings{zhang2020byzantine,
title={Byzantine Ordered Consensus without Byzantine Oligarchy},
author={Zhang, Yunhao and Setty, Srinath and Chen, Qi and Zhou, Lidong and Alvisi, Lorenzo},
booktitle={14th ${$USENIX$}$ Symposium on Operating Systems Design and Implementation (${$OSDI$}$ 20)},
pages={633–649},
year={2020}
}

@inproceedings{ding2020scalog,
title={Scalog: Seamless Reconfiguration and Total Order in a Scalable Shared Log},
author={Ding, Cong and Chu, David and Zhao, Evan and Li, Xiang and Alvisi, Lorenzo and van Renesse, Robbert},
booktitle={17th ${$USENIX$}$ Symposium on Networked Systems Design and Implementation (${$NSDI$}$ 20)},
pages={325–338},
year={2020}
}

@inproceedings {222619,
author = {Natacha Crooks and Matthew Burke and Ethan Cecchetti and Sitar Harel and Rachit Agarwal and Lorenzo Alvisi},
title = {Obladi: Oblivious Serializable Transactions in the Cloud},
booktitle = {13th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 18)},
year = {2018},
isbn = {978-1-931971-47-8},
address = {Carlsbad, CA},
pages = {727–743},
url = {https://www.usenix.org/conference/osdi18/presentation/crooks},
publisher = {{USENIX} Association},
}

@inproceedings{Gupta:2017:PEE:3098822.3098835,
author = {Gupta, Trinabh and Fingler, Henrique and Alvisi, Lorenzo and Walfish, Michael},
title = {Pretzel: Email Encryption and Provider-supplied Functions Are Compatible},
booktitle = {Proceedings of the Conference of the ACM Special Interest Group on Data Communication},
series = {SIGCOMM ‘17},
year = {2017},
isbn = {978-1-4503-4653-5},
location = {Los Angeles, CA, USA},
pages = {169–182},
numpages = {14},
url = {http://doi.acm.org/10.1145/3098822.3098835},
doi = {10.1145/3098822.3098835},
acmid = {3098835},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {encrypted email, linear classifiers, secure two-party computation},
}

@inproceedings{Su:2017:BMC:3035918.3064031,
author = {Su, Chunzhi and Crooks, Natacha and Ding, Cong and Alvisi, Lorenzo and Xie, Chao},
title = {Bringing Modular Concurrency Control to the Next Level},
booktitle = {Proceedings of the 2017 ACM International Conference on Management of Data},
series = {SIGMOD ‘17},
year = {2017},
isbn = {978-1-4503-4197-4},
location = {Chicago, Illinois, USA},
pages = {283–297},
numpages = {15},
url = {http://doi.acm.org/10.1145/3035918.3064031},
doi = {10.1145/3035918.3064031},
acmid = {3064031},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {distributed database, modular concurrency control, transaction},
}

@inproceedings{Crooks:2017:SBC:3087801.3087802,
author = {Crooks, Natacha and Pu, Youer and Alvisi, Lorenzo and Clement, Allen},
title = {Seeing is Believing: A Client-Centric Specification of Database Isolation},
booktitle = {Proceedings of the ACM Symposium on Principles of Distributed Computing},
series = {PODC ‘17},
year = {2017},
isbn = {978-1-4503-4992-5},
location = {Washington, DC, USA},
pages = {73–82},
numpages = {10},
url = {http://doi.acm.org/10.1145/3087801.3087802},
doi = {10.1145/3087801.3087802},
acmid = {3087802},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {acid, cloud storage, concurrency control, consistency, database, distributed storage, distributed systems, eventual consistency, isolation, serializability, transactions, weak consistency},
}

@inproceedings {201457,
author = {Syed Akbar Mehdi and Cody Littley and Natacha Crooks and Lorenzo Alvisi and Nathan Bronson and Wyatt Lloyd},
title = {I Can{\textquoteright}t Believe It{\textquoteright}s Not Causal! Scalable Causal Consistency with No Slowdown Cascades},
booktitle = {14th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 17)},
year = {2017},
isbn = {978-1-931971-37-9},
address = {Boston, MA},
pages = {453–468},
url = {https://www.usenix.org/conference/nsdi17/technical-sessions/presentation/mehdi},
publisher = {{USENIX} Association},
}

@inproceedings{Crooks:2016:TBA:2882903.2882951,
author = {Crooks, Natacha and Pu, Youer and Estrada, Nancy and Gupta, Trinabh and Alvisi, Lorenzo and Clement, Allen},
title = {TARDiS: A Branch-and-Merge Approach To Weak Consistency},
booktitle = {Proceedings of the 2016 International Conference on Management of Data},
series = {SIGMOD ‘16},
year = {2016},
isbn = {978-1-4503-3531-7},
location = {San Francisco, California, USA},
pages = {1615–1628},
numpages = {14},
url = {http://doi.acm.org/10.1145/2882903.2882951},
doi = {10.1145/2882903.2882951},
acmid = {2882951},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {causal consistency, databases, distributed systems, eventual consistency, geo-distribution, merging, replication, transactions, weak consistency},
}

@inproceedings {194912,
author = {Trinabh Gupta and Natacha Crooks and Whitney Mulhern and Srinath Setty and Lorenzo Alvisi and Michael Walfish},
title = {Scalable and Private Media Consumption with Popcorn},
booktitle = {13th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 16)},
year = {2016},
isbn = {978-1-931971-29-4},
address = {Santa Clara, CA},
pages = {91–107},
url = {https://www.usenix.org/conference/nsdi16/technical-sessions/presentation/gupta-trinabh},
publisher = {{USENIX} Association},
}

@inproceedings{Xie:2015:HAV:2815400.2815430,
author = {Xie, Chao and Su, Chunzhi and Littley, Cody and Alvisi, Lorenzo and Kapritsos, Manos and Wang, Yang},
title = {High-performance ACID via Modular Concurrency Control},
booktitle = {Proceedings of the 25th Symposium on Operating Systems Principles},
series = {SOSP ‘15},
year = {2015},
isbn = {978-1-4503-3834-9},
location = {Monterey, California},
pages = {279–294},
numpages = {16},
url = {http://doi.acm.org/10.1145/2815400.2815430},
doi = {10.1145/2815400.2815430},
acmid = {2815430},
publisher = {ACM},
address = {New York, NY, USA},
}

@inproceedings {186202,
author = {Chao Xie and Chunzhi Su and Manos Kapritsos and Yang Wang and Navid Yaghmazadeh and Lorenzo Alvisi and Prince Mahajan},
title = {Salt: Combining {ACID} and {BASE} in a Distributed Database},
booktitle = {11th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 14)},
year = {2014},
isbn = { 978-1-931971-16-4},
address = {Broomfield, CO},
pages = {495–509},
url = {https://www.usenix.org/conference/osdi14/technical-sessions/presentation/xie},
publisher = {{USENIX} Association},
}

@inproceedings{Silberstein:2014:LMS:2611354.2611370,
author = {Silberstein, Mark and Ganesh, Lakshmi and Wang, Yang and Alvisi, Lorenzo and Dahlin, Mike},
title = {Lazy Means Smart: Reducing Repair Bandwidth Costs in Erasure-coded Distributed Storage},
booktitle = {Proceedings of International Conference on Systems and Storage},
series = {SYSTOR 2014},
year = {2014},
isbn = {978-1-4503-2920-0},
location = {Haifa, Israel},
pages = {15:1–15:7},
articleno = {15},
numpages = {7},
url = {http://doi.acm.org/10.1145/2611354.2611370},
doi = {10.1145/2611354.2611370},
acmid = {2611370},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {Distributed storage systems, Erasure codes, Repair bandwidth},
}

@inproceedings {179795,
author = {Yang Wang and Manos Kapritsos and Lara Schmidt and Lorenzo Alvisi and Mike Dahlin},
title = {Exalt: Empowering Researchers to Evaluate Large-Scale Storage Systems},
booktitle = {11th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 14)},
year = {2014},
isbn = {978-1-931971-09-6},
address = {Seattle, WA},
pages = {129–141},
url = {https://www.usenix.org/conference/nsdi14/technical-sessions/presentation/wang_yang},
publisher = {{USENIX} Association},
}

@inproceedings{Wong:2013:WLC:2484239.2484242,
author = {Wong, Edmund L. and Alvisi, Lorenzo},
title = {What’s a Little Collusion Between Friends?},
booktitle = {Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing},
series = {PODC ‘13},
year = {2013},
isbn = {978-1-4503-2065-8},
location = {Montr\éal, Qu\ébec, Canada},
pages = {240–249},
numpages = {10},
url = {http://doi.acm.org/10.1145/2484239.2484242},
doi = {10.1145/2484239.2484242},
acmid = {2484242},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {collusion, cooperative services, game theory, p2p},
}

@inproceedings{6547122,
author={L. Alvisi and A. Clement and A. Epasto and S. Lattanzi and A. Panconesi},
booktitle={2013 IEEE Symposium on Security and Privacy},
title={SoK: The Evolution of Sybil Defense via Social Networks},
year={2013},
volume={},
number={},
pages={382-396},
keywords={security of data;social networking (online);SoK framework;social network;sybil defense protocol;sybil identity;random walks theory;community detection algorithm;graph white-listing;Protocols;Communities;Image edge detection;Facebook;Robustness;Detection algorithms},
doi={10.1109/SP.2013.33},
ISSN={1081-6011},
month={May},}

@inproceedings {180322,
author = {Yang Wang and Manos Kapritsos and Zuocheng Ren and Prince Mahajan and Jeevitha Kirubanandam and Lorenzo Alvisi and Mike Dahlin},
title = {Robustness in the Salus Scalable Block Store},
booktitle = {Presented as part of the 10th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 13)},
year = {2013},
isbn = {978-1-931971-00-3},
address = {Lombard, IL},
pages = {357–370},
url = {https://www.usenix.org/conference/nsdi13/technical-sessions/presentation/wang_yang},
publisher = {{USENIX}},
}

@inproceedings {180267,
author = {Manos Kapritsos and Yang Wang and Vivien Quema and Allen Clement and Lorenzo Alvisi and Mike Dahlin},
title = {All about Eve: Execute-Verify Replication for Multi-Core Servers},
booktitle = {Presented as part of the 10th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 12)},
year = {2012},
isbn = {978-1-931971-96-6},
address = {Hollywood, CA},
pages = {237–250},
url = {https://www.usenix.org/conference/osdi12/technical-sessions/presentation/kapritsos},
publisher = {{USENIX}},
}

@inproceedings {181008,
author = {Yang Wang and Lorenzo Alvisi and Mike Dahlin},
title = {Gnothi: Separating Data and Metadata for Efficient and Available Storage Replication},
booktitle = {Presented as part of the 2012 {USENIX} Annual Technical Conference ({USENIX} {ATC} 12)},
year = {2012},
isbn = {978-931971-93-5},
address = {Boston, MA},
pages = {413–424},
url = {https://www.usenix.org/conference/atc12/technical-sessions/presentation/wang},
publisher = {{USENIX}},
}

@InProceedings{10.1007/978-3-642-25873-2_7,
author=”Wong, Edmund L.
and Levy, Isaac
and Alvisi, Lorenzo
and Clement, Allen
and Dahlin, Mike”,
editor=”Fern{`a}ndez Anta, Antonio
and Lipari, Giuseppe
and Roy, Matthieu”,
title=”Regret Freedom Isn’t Free”,
booktitle=”Principles of Distributed Systems”,
year=”2011”,
publisher=”Springer Berlin Heidelberg”,
address=”Berlin, Heidelberg”,
pages=”80–95”,
abstract=”Cooperative, peer-to-peer (P2P) services—distributed systems consisting of participants from multiple administrative domains (MAD)—must deal with the threat of arbitrary (Byzantine) failures while incentivizing the cooperation of potentially selfish (rational) nodes that such services rely on to function. This paper investigates how to specify conditions (i.e., a solution concept) for rational cooperation in an environment that also contains Byzantine and obedient peers. We find that regret-free approaches—which, inspired by traditional Byzantine fault tolerance, condition rational cooperation on identifying a strategy that proves a best response regardless of how Byzantine failures occur—are unattainable in many fault-tolerant distributed systems. We suggest an alternative regret-braving approach, in which rational nodes aim to best respond to their expectations regarding Byzantine failures: the chosen strategy guarantees no regret only to the extent that such expectations prove correct. While work on regret-braving solution concepts is just beginning, our preliminary results show that these solution concepts are not subject to the fundamental limitations inherent to regret freedom.”,
isbn=”978-3-642-25873-2”
}

@article{Mahajan:2011:DCS:2063509.2063512,
author = {Mahajan, Prince and Setty, Srinath and Lee, Sangmin and Clement, Allen and Alvisi, Lorenzo and Dahlin, Mike and Walfish, Michael},
title = {Depot: Cloud Storage with Minimal Trust},
journal = {ACM Trans. Comput. Syst.},
issue_date = {December 2011},
volume = {29},
number = {4},
month = dec,
year = {2011},
issn = {0734-2071},
pages = {12:1–12:38},
articleno = {12},
numpages = {38},
url = {http://doi.acm.org/10.1145/2063509.2063512},
doi = {10.1145/2063509.2063512},
acmid = {2063512},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {Byzantine fault tolerance, Cloud storage, Fork-Join-Causal (FJC) consistency, fork consistency},
}

@InProceedings{10.1007/978-3-642-15763-9_41,
author=”Wong, Edmund L.
and Leners, Joshua B.
and Alvisi, Lorenzo”,
editor=”Lynch, Nancy A.
and Shvartsman, Alexander A.”,
title=”It’s on Me! The Benefit of Altruism in BAR Environments”,
booktitle=”Distributed Computing”,
year=”2010”,
publisher=”Springer Berlin Heidelberg”,
address=”Berlin, Heidelberg”,
pages=”406–420”,
abstract=”Cooperation, a necessity for any peer-to-peer (P2P) cooperative service, is often achieved by rewarding good behavior now with the promise of future benefits. However, in most cases, interactions with a particular peer or the service itself eventually end, resulting in some last exchange in which departing participants have no incentive to contribute. Without cooperation in the last round, cooperation in any prior round may be unachievable. In this paper, we propose leveraging altruistic participants that simply follow the protocol as given. We show that altruism is a simple, necessary, and sufficient way to incentivize cooperation in a realistic model of a cooperative service’s last exchange, in which participants may be Byzantine, altruistic, or rational and network loss is explicitly considered. By focusing on network-level incentives in the last exchange, we believe our approach can be used as the cornerstone for incentivizing cooperation in any cooperative service.”,
isbn=”978-3-642-15763-9”
}

@inproceedings{Clement:2009:UCS:1629575.1629602,
author = {Clement, Allen and Kapritsos, Manos and Lee, Sangmin and Wang, Yang and Alvisi, Lorenzo and Dahlin, Mike and Riche, Taylor},
title = {Upright Cluster Services},
booktitle = {Proceedings of the ACM SIGOPS 22Nd Symposium on Operating Systems Principles},
series = {SOSP ‘09},
year = {2009},
isbn = {978-1-60558-752-3},
location = {Big Sky, Montana, USA},
pages = {277–290},
numpages = {14},
url = {http://doi.acm.org/10.1145/1629575.1629602},
doi = {10.1145/1629575.1629602},
acmid = {1629602},
publisher = {ACM},
address = {New York, NY, USA},
abstract=”The UpRight library seeks to make Byzantine fault tolerance (BFT) a simple and viable alternative to crash fault tolerance for a range of cluster services. We demonstrate UpRight by producing BFT versions of the Zookeeper lock service and the Hadoop Distributed File System (HDFS). Our design choices in UpRight favor simplifying adoption by existing applications; performance is a secondary con- cern. Despite these priorities, our BFT Zookeeper and BFT HDFS implementations have performance comparable with the originals while providing additional robustness.”,
keywords = {byzantine fault tolerance, cluster services, reliability}
}

@inproceedings{Clement:2009:MBF:1558977.1558988,
author = {Clement, Allen and Wong, Edmund and Alvisi, Lorenzo and Dahlin, Mike and Marchetti, Mirco},
title = {Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults},
booktitle = {Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation},
series = {NSDI’09},
year = {2009},
location = {Boston, Massachusetts},
pages = {153–168},
numpages = {16},
url = {http://dl.acm.org/citation.cfm?id=1558977.1558988},
acmid = {1558988},
publisher = {USENIX Association},
address = {Berkeley, CA, USA},
}

@inproceedings{Li:2008:FOV:1855741.1855766,
author = {Li, Harry C. and Clement, Allen and Marchetti, Mirco and Kapritsos, Manos and Robison, Luke and Alvisi, Lorenzo and Dahlin, Mike},
title = {FlightPath: Obedience vs. Choice in Cooperative Services},
booktitle = {Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation},
series = {OSDI’08},
year = {2008},
location = {San Diego, California},
pages = {355–368},
numpages = {14},
url = {http://dl.acm.org/citation.cfm?id=1855741.1855766},
acmid = {1855766},
publisher = {USENIX Association},
address = {Berkeley, CA, USA},
}

@inproceedings{Aiyer08Matrix,
author = {Amitanand S. Aiyer and
Lorenzo Alvisi and
Rida A. Bazzi and
Allen Clement},
title = {Matrix Signatures: From MACs to Digital Signatures in Distributed
Systems},
booktitle = {Distributed Computing, 22nd International Symposium, {DISC} 2008,
Arcachon, France, September 22-24, 2008. Proceedings},
pages = {16–31},
year = {2008},
crossref = {DBLP:conf/wdag/2008},
url = {https://doi.org/10.1007/978-3-540-87779-0_2},
doi = {10.1007/978-3-540-87779-0_2},
timestamp = {Tue, 13 Jun 2017 10:37:55 +0200},
biburl = {https://dblp.org/rec/bib/conf/wdag/AiyerABC08},
bibsource = {dblp computer science bibliography, https://dblp.org}
}

@INPROCEEDINGS{Clement08Primer,
author = {A. Clement and H. Li and J. Napper and J. Martin and L. Alvisi and M. Dahlin},
booktitle = {2008 IEEE International Conference on Dependable Systems and Networks With FTCS and DCC (DSN)},
title = {BAR primer},
year = {2008},
volume = {00},
number = {},
pages = {287-296},
keywords={Protocols;Lead;Games;Nash equilibrium;Peer to peer computing;Safety;Conferences},
doi = {10.1109/DSN.2008.4630097},
url = {doi.ieeecomputersociety.org/10.1109/DSN.2008.4630097},
ISSN = {1530-0889},
month={June}
}

@inproceedings{Kotla07Zyzzyva,
author = {Kotla, Ramakrishna and Alvisi, Lorenzo and Dahlin, Mike and Clement, Allen and Wong, Edmund},
title = {Zyzzyva: Speculative Byzantine Fault Tolerance},
booktitle = {Proceedings of Twenty-first ACM SIGOPS Symposium on Operating Systems Principles},
series = {SOSP ‘07},
year = {2007},
isbn = {978-1-59593-591-5},
location = {Stevenson, Washington, USA},
pages = {45–58},
numpages = {14},
url = {http://doi.acm.org/10.1145/1294261.1294267},
doi = {10.1145/1294261.1294267},
acmid = {1294267},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {byzantine fault tolerance, output commit, replication, speculative execution},
}

@inproceedings{Aiyer07Bounded,
author = {Amitanand S. Aiyer and
Lorenzo Alvisi and
Rida A. Bazzi},
title = {Bounded wait-free implementation of optimally resilient byzantine
storage without (unproven) cryptographic assumptions},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2007, Portland, Oregon, USA, August
12-15, 2007},
pages = {310–311},
year = {2007},
crossref = {DBLP:conf/podc/2007},
url = {https://doi.org/10.1145/1281100.1281147},
doi = {10.1145/1281100.1281147},
timestamp = {Tue, 06 Nov 2018 11:07:18 +0100},
biburl = {https://dblp.org/rec/bib/conf/podc/AiyerAB07},
bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{Li07Paxos,
author = {Li, Harry C. and Clement, Allen and Aiyer, Amitanand S. and Alvisi, Lorenzo},
title = {The Paxos Register},
booktitle = {Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems},
series = {SRDS ‘07},
year = {2007},
isbn = {0-7695-2995-X},
pages = {114–126},
numpages = {13},
url = {http://dl.acm.org/citation.cfm?id=1308172.1308227},
acmid = {1308227},
publisher = {IEEE Computer Society},
address = {Washington, DC, USA},
}

@inproceedings{Wong07Truth,
author = {Wong, Edmund L. and Balasubramanian, Praveen and Alvisi, Lorenzo and Gouda, Mohamed G. and Shmatikov, Vitaly},
title = {Truth in Advertising: Lightweight Verification of Route Integrity},
booktitle = {Proceedings of the Twenty-sixth Annual ACM Symposium on Principles of Distributed Computing},
series = {PODC ‘07},
year = {2007},
isbn = {978-1-59593-616-5},
location = {Portland, Oregon, USA},
pages = {147–156},
numpages = {10},
url = {http://doi.acm.org/10.1145/1281100.1281123},
doi = {10.1145/1281100.1281123},
acmid = {1281123},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {BGP, interdomain routing, security},
}

@inproceedings{Kotla07Safestore,
author = {Ramakrishna Kotla and
Lorenzo Alvisi and
Michael Dahlin},
title = {SafeStore: {A} Durable and Practical Storage System},
booktitle = {Proceedings of the 2007 {USENIX} Annual Technical Conference, Santa
Clara, CA, USA, June 17-22, 2007},
pages = {129–142},
year = {2007},
crossref = {DBLP:conf/usenix/2007},
url = {http://www.usenix.org/events/usenix07/tech/kotla.html},
timestamp = {Wed, 04 Jul 2018 13:06:34 +0200},
biburl = {https://dblp.org/rec/bib/conf/usenix/KotlaAD07},
bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{Li07Gossip,
author = {Li, Harry C. and Clement, Allen and Wong, Edmund L. and Napper, Jeff and Roy, Indrajit and Alvisi, Lorenzo and Dahlin, Michael},
title = {BAR Gossip},
booktitle = {Proceedings of the 7th Symposium on Operating Systems Design and Implementation},
series = {OSDI ‘06},
year = {2006},
isbn = {1-931971-47-1},
location = {Seattle, Washington},
pages = {191–204},
numpages = {14},
url = {http://dl.acm.org/citation.cfm?id=1298455.1298474},
acmid = {1298474},
publisher = {USENIX Association},
address = {Berkeley, CA, USA},
}

@inproceedings{10.1109/ICNP.2006.320211,
author = {Aiyer, Amitanand and Alvisi, Lorenzo and Gouda, Mohamed},
title = {Key Grids: A Protocol Family for Assigning Symmetric Keys},
year = {2006},
isbn = {1424405939},
publisher = {IEEE Computer Society},
address = {USA}, url = {https://doi.org/10.1109/ICNP.2006.320211},
doi = {10.1109/ICNP.2006.320211},
booktitle = {Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols},
pages = {178–186},
numpages = {9},
series = {ICNP ‘06}
}