Abstract is missing.
- A model for secure protocols and their compositionsNevin Heintze, J. Doug Tygar. 2-13 [doi]
- On unifying some cryptographic protocol logicsPaul F. Syverson, Paul C. van Oorschot. 14-28 [doi]
- Eliminating formal flows in automated information flow analysisSteven T. Eckmann. 30-38 [doi]
- Mode security: an infrastructure for covert channel suppressionRandy Browne. 39-55 [doi]
- Simple timing channelsIra S. Moskowitz, Allen R. Miller. 56-64 [doi]
- Asynchronous composition and required security conditionsNora Boulahia-Cuppens, Frédéric Cuppens. 68-78 [doi]
- A general theory of composition for trace sets closed under selective interleaving functionsJohn McLean. 79-93 [doi]
- Ensuring data security in interrelated tabular dataRam Kumar. 96-105 [doi]
- Collecting garbage in multilevel secure object storesElisa Bertino, Luigi V. Mancini, Sushil Jajodia. 106-120 [doi]
- Prudent engineering practice for cryptographic protocolsMartín Abadi, Roger M. Needham. 122-136 [doi]
- Generating formal cryptographic protocol specificationsUlf Carlsen. 137-146 [doi]
- A low cost, high speed encryption system and methodGregory L. Mayhew. 147-154 [doi]
- Inference channel-free integrity constraints in multilevel relational databasesXiaolei Qian. 158-167 [doi]
- Elimination of inference channels by optimal upgradingMark E. Stickel. 168-174 [doi]
- A secure group membership protocolMichael K. Reiter. 176-189 [doi]
- The complexity and composability of secure interoperationLi Gong, Xiaolei Qian. 190-200 [doi]
- Self-nonself discrimination in a computerStephanie Forrest, Alan S. Perelson, Lawrence Allen, Rajesh Cherukuri. 202-212 [doi]
- Extending the schematic protection model. I. Conditional tickets and authenticationVijay Varadharajan, Claudio Calvelli. 213-229 [doi]
- On the minimality of testing for rights in transformation modelsRavi S. Sandhu, Srinivas Ganta. 230-241 [doi]