Formal Aspects in Security and Trust IFIP TC1 WG1.7 Workshop on Formal Aspects in Security and Trust (FAST), World Computer Congress, August 22–27, 2004, Toulouse, France /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Dimitrakos, Theo (Επιμελητής έκδοσης), Martinelli, Fabio (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Boston, MA : Springer US, 2005.
• Σειρά: IFIP International Federation for Information Processing, 173
• Θέματα: Computer science.; Computer software > Reusability.; Data structures (Computer science).; Data encryption (Computer science).; Computers.; Computer Science.; Theory of Computation.; Models and Principles.; Performance and Reliability.; Data Encryption.; Information Systems and Communication Service.; Data Structures, Cryptology and Information Theory.

 International Federation for Information Processing The IFIP series publishes state-of-the-art results in the sciences and technologies of information and communication. The scope of the series includes: foundations of computer science; software theory and practice; education; computer applications in technology; communication systems; systems modeling and optimization; information systems; computers and society; computer systems technology; security and protection in information processing systems; artificial intelligence; and human-computer interaction. Proceedings and post-proceedings of referred international conferences in computer science and interdisciplinary fields are featured. These results often precede journal publication and represent the most current research. The principal aim of the IFIP series is to encourage education and the dissemination and exchange of information about all aspects of computing. For more information about the 300 other books in the IFIP series, please visit www.springeronline.com. For more information about IFIP, please visit www.ifip.or.at. 

 Security Issues in the Tuple-Space Coordination Model -- Information Flow Analysis for Probabilistic Timed Automata -- Dynamic Security Labels and Noninterference (Extended Abstract) -- Formal Analysis of a Fair Payment Protocol -- Pattern-Matching Spi-Calculus -- Decidability of Opacity with Non-Atomic Keys -- Virtual Analysis and Reduction of Side-Channel Vulnerabilities of Smartcards -- Family Secrets -- An Interactive Trust Management and Negotiation Scheme -- Complementing Computational Protocol Analysis with Formal Specifications -- A Trust Model with Statistical Foundation -- Modelling Dynamic Opacity Using Petri Nets with Silent Actions -- Reasoning about Secure Interoperation Using Soft Constraints -- A Logic for Auditing Accountability in Decentralized Systems -- A Formal Approach to Specify and Deploy a Network Security Policy -- Discretionary Overriding of Access Control in the Privilege Calculus -- A Formal Model for Parameterized Role-Based Access Control.