Security-typed languages (STLs) are powerful tools for provably implementing policy in applications. The programmer maps policy onto programs by annotating types with information ...
In this paper, we propose an efficient multi-receiver identity based signcryption scheme which only needs one pairing computation to signcrypt a message for n receivers and can pro...
Noninterference requires that there is no information flow from sensitive to public data in a given system. However, many systems perform intentional release of sensitive informat...
Andrew C. Myers, Andrei Sabelfeld, Steve Zdancewic
We present a provably secure tree based authenticated group key agreement protocol in dynamic scenario. Bilinear pairing and multi-signature are at the heart of our protocol. We p...
This paper provides a retrospective view of the design of SRI’s Provably Secure Operating System (PSOS), a formally specified tagged-capability hierarchical system architecture...