25 citations · 27 across the 6 of their papers we have counts for
6 papers
Secure Synthesis of Distributed Cryptographic Applications (Technical Report)
Coşku Acay, Joshua Gancher, Rolph Recto +1
Developing secure distributed systems is difficult, and even harder when advanced cryptography must be used to achieve security goals. Following prior work, we advocate using secur…
A Compiler from Array Programs to Vectorized Homomorphic Encryption
Rolph Recto, Andrew C. Myers
Homomorphic encryption (HE) is a practical approach to secure computation over encrypted data. However, writing programs with efficient HE implementations remains the purview of ex…
A Calculus for Flow-Limited Authorization
Owen Arden, Anitha Gollamudi, Ethan Cecchetti +2
Real-world applications routinely make authorization decisions based on dynamic computation. Reasoning about dynamically computed authority is challenging. Integrity of the system…
Safe Serializable Secure Scheduling: Transactions and the Trade-off Between Security and Consistency
Isaac Sheff, Tom Magrino, Jed Liu +2
Modern applications often operate on data in multiple administrative domains. In this federated setting, participants may not fully trust each other. These distributed applications…
Report on the NSF Workshop on Formal Methods for Security
Stephen Chong, Joshua Guttman, Anupam Datta +5
Report on the NSF Workshop on Formal Methods for Security, held 19-20 November 2015.
Distributed Protocols and Heterogeneous Trust: Technical Report
Isaac C. Sheff, Robbert van Renesse, Andrew C. Myers
The robustness of distributed systems is usually phrased in terms of the number of failures of certain types that they can withstand. However, these failure models are too crude to…