Secure enterprise programming is a difficult and tedious task. Programmers need tools that support t levels of abstraction and that track all the components that participate in di...
Myong H. Kang, Brian J. Eppinger, Judith N. Frosch...
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
An example of a problem in the physical sciences is discussed where application of various symbolic computation facilities available in many algebraic computing systems leads to a...
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
In this paper, we introduce EXACT, the EXperimental Algorithmics Computational Toolkit. EXACT is a software framework for describing, controlling, and analyzing computer experimen...
William E. Hart, Jonathan W. Berry, Robert T. Heap...