The existence of refinement mappings
Theoretical Computer Science
Elements of information theory
Elements of information theory
The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
Knowledge, probability, and adversaries
Journal of the ACM (JACM)
Confinement properties for programming languages
ACM SIGACT News
Verifying secrets and relative secrecy
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Coding Theory
A probabilistic approach to information hiding
Programming methodology
Limiting privacy breaches in privacy preserving data mining
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Secure Introduction of One-Way Functions
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
CSP and determinism in security modelling
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
Formalizing the analysis of algorithms.
Formalizing the analysis of algorithms.
Reasoning about Uncertainty
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
A logical approach to multilevel security of probabilistic systems
Distributed Computing
CSFW '05 Proceedings of the 18th IEEE workshop on Computer Security Foundations
Quantitative Information Flow, Relations and Polymorphic Types
Journal of Logic and Computation
Assessing security threats of looping constructs
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Measuring the confinement of probabilistic systems
Theoretical Computer Science - Theoretical foundations of security analysis and design II
Journal of Computer Security - Special issue on WITS'02
Quantified Interference for a While Language
Electronic Notes in Theoretical Computer Science (ENTCS)
An Interval-based Abstraction for Quantifying Information Flow
Electronic Notes in Theoretical Computer Science (ENTCS)
Predictive black-box mitigation of timing channels
Proceedings of the 17th ACM conference on Computer and communications security
Proceedings of the 17th ACM conference on Computer and communications security
Information theory and security: quantitative information flow
SFM'10 Proceedings of the Formal methods for quantitative aspects of programming languages, and 10th international conference on School on formal methods for the design of computer, communication and software systems
Process Algebra Contexts and Security Properties
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Measuring query privacy in location-based services
Proceedings of the second ACM conference on Data and Application Security and Privacy
Knowledge-oriented secure multiparty computation
Proceedings of the 7th Workshop on Programming Languages and Analysis for Security
Gained and Excluded Private Actions by Process Observations
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Differential privacy: on the trade-off between utility and information leakage
FAST'11 Proceedings of the 8th international conference on Formal Aspects of Security and Trust
Fault localization prioritization: Comparing information-theoretic and coverage-based approaches
ACM Transactions on Software Engineering and Methodology (TOSEM) - In memoriam, fault detection and localization, formal methods, modeling and design
On protection in federated social computing systems
Proceedings of the 4th ACM conference on Data and application security and privacy
Dynamic enforcement of knowledge-based security policies using probabilistic abstract interpretation
Journal of Computer Security
Quantitative information flow in interactive systems
Journal of Computer Security - ARSPA-WITS'10
Quantification of Positive and Negative Attacker's Information
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
Fundamenta Informaticae - Concurrency, Specification and Programming
| Hi-index | 0.00 |
Computing systems often deliberately release (or declassify) sensitive information. A principal security concern for systems permitting information release is whether this release is safe: is it possible that the attacker compromises the information ...