Author:
Alvim Mário S.,Scedrov Andre,Schneider Fred B.
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Cachin, C.: Entropy Measures and Unconditional Security in Cryptography. PhD thesis, ETH Zürich (1997) Reprint as of ETH Series in Information Security and Cryptography, vol. 1. Hartung-Gorre Verlag, Konstanz (1997) ISBN 3-89649-185-7
2. Clark, D., Hunt, S., Malacaria, P.: Quantitative information flow, relations and polymorphic types. J. of Logic and Computation 18(2), 181–199 (2005)
3. Malacaria, P.: Assessing security threats of looping constructs. In: Hofmann, M., Felleisen, M. (eds.) Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2007, pp. 225–235. ACM (2007)
4. Malacaria, P., Chen, H.: Lagrange multipliers and maximum information leakage in different observational models. In: Proc. of the 2008 Workshop on Programming Languages and Analysis for Security (PLAS 2008), pp. 135–146. ACM (June 2008)
5. Moskowitz, I.S., Newman, R.E., Syverson, P.F.: Quasi-anonymous channels. In: Proc. of CNIS, pp. 126–131, IASTED (2003)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Proving that Programs Are Differentially Private;Programming Languages and Systems;2019
2. Inferring Secrets by Guided Experiments;Theoretical Aspects of Computing – ICTAC 2017;2017
3. Reasoning About Distributed Secrets;Formal Techniques for Distributed Objects, Components, and Systems;2017
4. Datacentric Semantics for Verification of Privacy Policy Compliance by Mobile Applications;Lecture Notes in Computer Science;2015