- 1.B Blakley and D.M. Kienzle. Some weaknesses of the TCB model. In IEEE Symposium on Security and Privacy. IEEE CS Press, May 1997. Google ScholarDigital Library
- 2.R.E. Bryant. Symbolic boolean manipulation with ordered binary decision diagrams. A CM Computing Surveys, 1992. Google ScholarDigital Library
- 3.J.R. Burch et al. Symbolic model checking: 1023 states and beyond. Information and Computation, 98:142-170, 1992. Google ScholarDigital Library
- 4.J.A. Fitch and L.J Hoffman. A shortest path network security model. Computers and Security, 12:169-189, 1993. Google ScholarDigital Library
- 5.S.N. Foley. The specification and implementation of commercial security requirements including dynamic segregation of duties. In 4th A CM Conference on Computer and Communications Security. ACM Press, 1997. Google ScholarDigital Library
- 6.S.N. Foley and G. Hayes. PalmTE: Limited type enforcemented on the Palm handheld. In preparation, 2000.Google Scholar
- 7.L. Gong and X. Qian. The complexity and composability of secure interoperation. In Proceedings of the Symposium on Security and Privacy, pages 190-200, Oakland, CA, May 1994. IEEE Computer Society Press. Google ScholarDigital Library
- 8.S. Gritalis and D. Spinellis. The cascade vulnerability problem: The detection problem and a simulated annealing approach to its correction. Microprocessors and Microsystems, 21(10):621- 628, 1998.Google ScholarCross Ref
- 9.R.J. Horton et al. The cascade vulnerability problem. Journal of Computer Security, 2(4):279-290, 1993.Google ScholarCross Ref
- 10.J.K Millen and M.W. Schwartz. The cascading problem for interconnected networks. In 4th Aerospace Computer Security Applications Conference, pages 269-273. IEEE CS Press, December 1988.Google ScholarCross Ref
- 11.I.S. Moskowitz and M.H. Kang. An insecurity flow model. In New Security Paradigms Workshop. ACM Press, 1997. Google ScholarDigital Library
- 12.National Computer Security Center, USA. Trusted Network Interpretation, 1987.Google Scholar
- 13.M.K. Reiter and S.G. Stubblebine. Toward acceptable metrics of authentication. In IEEE Symposium on Security and Privacy, pages 10- 20, May 1997. Google ScholarDigital Library
- 14.J. M. Spivey. The Z Notation: A Reference Manual. Series in Computer Science. Prentice Hall International, second edition, 1992. Google ScholarDigital Library
Index Terms
- Conduit cascades and secure synchronization
Recommendations
Strongly secure certificateless short signatures
Highlights We introduce a new efficient and secure short certificateless signature scheme. It is strongly unforgeable. The security is based on the CDH assumption. The proposed scheme is provably secure against a relatively stronger adversary. Short ...
Secure universal designated verifier signature without random oracles
In Asiacrypt 2003, the concept of universal designated verifier signature (UDVS) was introduced by Steinfeld, Bull, Wang and Pieprzyk. In the new paradigm, any signature holder (not necessarily the signer) can designate the publicly verifiable signature ...
Unconditionally secure ring authentication
ASIACCS '07: Proceedings of the 2nd ACM symposium on Information, computer and communications securityWe propose ring authentication in unconditionally secure setting. In a ring authentication system a sender can choose a set of users and construct an authenticated message for a receiver such that the receiver can verify authenticity of the message with ...
Comments