Computational Issues in Secure Interoperation
IEEE Transactions on Software Engineering
Conduit cascades and secure synchronization
Proceedings of the 2000 workshop on New security paradigms
A MAC Policy Framework for Multilevel Relational Databases
IEEE Transactions on Knowledge and Data Engineering
Modeling and detecting the cascade vulnerability problem using soft constraints
Proceedings of the 2004 ACM symposium on Applied computing
Secure collaboration in mediator-free environments
Proceedings of the 12th ACM conference on Computer and communications security
Privacy-preserving semantic interoperation and access control of heterogeneous databases
ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
Semantic access control for information interoperation
Proceedings of the eleventh ACM symposium on Access control models and technologies
A soft constraint-based approach to the cascade vulnerability problem
Journal of Computer Security - Special issue on security track at ACM symposium on applied computing 2004
Methods and limitations of security policy reconciliation
ACM Transactions on Information and System Security (TISSEC)
Web services discovery in secure collaboration environments
ACM Transactions on Internet Technology (TOIT)
Workflow authorisation in mediator-free environments
International Journal of Security and Networks
IAAI'04 Proceedings of the 16th conference on Innovative applications of artifical intelligence
Optimum routing protection against cumulative eavesdropping in multihop wireless networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Detection of access control flaws in a distributed database system with local site autonomy
IDEAS'97 Proceedings of the 1997 international conference on International database engineering and applications symposium
Hi-index | 0.00 |
We give a formal model of protocol security. Our model allows us to reason about the security of protocols, and considers issues of beliefs of agents, time, and secrecy. We prove a composition theorem which allows us to state sufficient conditions on ...