author = {Andreas Haeberlen and Mingchen Zhao and Wenchao Zhou and Alexander Gurney and Micah Sherr and Boon Thau Loo},
  booktitle = {Workshop on Large-Scale Distributed Systems and Middleware (LADIS)},
  month = {July},
  title = {{Privacy-Preserving Collaborative Verification Protocols (Invited paper)}},
  year = {2012},
  documenturl = {papers/cvp-ladis2012.pdf},
  abstract = {We outline our vision of large-scale distributed systems that efficiently combine privacy and verifiability. In the systems we envision, a group of nodes would be able to verify that a given node $N_i$ has been executing a given algorithm $A(N_i)$. If successful, the verification would not reveal any additional information.}
  author = {Boon Thau Loo and Harjot Gill and Changbin Liu and Yun Mao and William R. Marczak and Micah Sherr and Anduo Wang and Wenchao Zhou},
  booktitle = {International Symposium on Practical Aspects of Declarative Languages (PADL)},
  title = {{Recent Advances in Declarative Networking (Invited paper)}},
  year = {2012},
  documenturl = {papers/dn_padl12.pdf},
  abstract = {Declarative networking is a programming
                  methodology that enables developers to concisely
                  specify network protocols and services, and directly
                  compile these specifications into a dataflow
                  framework for execution.  This paper describes
                  recent advances in declarative networking, tracing
                  its evolution from a rapid prototyping framework
                  towards a platform that serves as an important
                  bridge connecting formal theories for reasoning
                  about protocol correctness and actual
                  implementations. In particular, the paper focuses on
                  the use of declarative networking for addressing
                  four main challenges in the distributed systems
                  development cycle: the generation of safe routing
                  implementations, debugging, security and privacy,
                  and optimizing distributed systems.}
  title = {{Testimony to the West Virginia Joint Judiciary Subcommittee}},
  year = {2009},
  month = {August},
  day = {12},
  documenturl = {papers/wv-voting-testimony.pdf},
  note = {Charleston, WV},
  author = {Micah Sherr}
  title = {{Coordinate-Based Routing for High Performance Anonymity}},
  author = {Micah Sherr},
  year = {2009},
  school = {University of Pennsylvania},
  documenturl = {papers/dissertation.pdf},
  abstract = {Today's Internet routing protocols, while arguably robust and
efficient, are not designed to support anonymous communication.
Internet packets must include accurate destination addresses to be
routable and truthful source information to achieve reliability.
While there have been several attempts at providing anonymity with the
use of application-level overlay networks, these solutions focus
almost exclusively on maximizing anonymity, typically at the expense
of performance.

This dissertation shows that it is both possible and practical to
design, secure, and scale decentralized overlay networks for high
performance anonymous routing.  Our techniques utilize virtual
coordinate systems that embed link information (for example, latency,
jitter, and loss) in n-dimensional coordinate planes.  Such coordinate
systems enable nodes to estimate pairwise network metrics between
remote peers without requiring direct measurements.  We introduce
methods for scalably disseminating coordinate information as well as
security mechanisms for enforcing truthful coordinate advertisements.
By allowing nodes to estimate the end-to-end performance of possible
routes, our overlay routing infrastructure empowers applications to
intelligently select high performing anonymous paths.

Unlike existing anonymity systems that depend on central authorities
or directories, our {\em coordinate routing system} does not rely on
{\it a priori} trusted nodes or third-party authorities.  This lack of
centralization enables our system to scale to potentially millions of
nodes and offer anonymity that does not depend on the trustworthiness
of select nodes or services.  Moreover, the ability to estimate the
end-to-end performance of potential anonymous paths and prune likely
underperforming routes permits the anonymization of high bandwidth and
low latency network services (for example, voice-over-IP, streaming
video multicast, etc.) whose communication requirements have
previously been considered too restrictive for anonymity networks.}
  title = {{EVEREST: Evaluation and Validation of Election-Related Equipment, Standards and Testing}},
  author = {Patrick McDaniel {\it et al.}},
  month = {December},
  year = {2007},
  documenturl = {papers/everest-ohio.pdf}
  title = {{Source Code Review of the Sequoia Voting System}},
  note = {Part of the California Secretary of State Top-to-Bottom Review of electronic voting machines},
  month = {July},
  year = {2007},
  author = {Matt Blaze and Arel Cordero and Sophie Engle and Chris Karlof and Naveen Sastry and Micah Sherr and Till Stegers and Ka-Ping Yee},
  documenturl = {papers/sequoia.pdf}
  title = {Security Protocols with Isotropic Channels},
  author = {Madhukar Anand and Eric Cronin and Micah Sherr and Matt Blaze and Sampath Kannan},
  institution = {Department of Computer and Information Science, University of Pennsylvania},
  number = {TR-CIS-06-18},
  month = {November},
  year = {2006},
  documenturl = {papers/isotropism-tr-cis-06-18.pdf}