{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,23]],"date-time":"2022-04-23T05:12:00Z","timestamp":1650690720928},"reference-count":42,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2014,11,24]],"date-time":"2014-11-24T00:00:00Z","timestamp":1416787200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2016,9]]},"abstract":"<jats:p>Systems concerned with information hiding often use randomization to obfuscate the link between the observables and the information to be protected. The degree of protection provided by a system can be expressed in terms of the probability of error associated with the inference of the secret information. We consider a probabilistic process calculus to specify such systems, and we study how the operators affect the probability of error. In particular, we characterize constructs that have the property of not decreasing the degree of protection, and that can therefore be considered safe in the modular construction of these systems. As a case study, we apply these techniques to the dining cryptographers, and we derive a generalization of Chaum's strong anonymity result.<\/jats:p>","DOI":"10.1017\/s0960129514000292","type":"journal-article","created":{"date-parts":[[2014,11,24]],"date-time":"2014-11-24T07:48:15Z","timestamp":1416815295000},"page":"908-932","source":"Crossref","is-referenced-by-count":1,"title":["Compositional methods for information-hiding"],"prefix":"10.1017","volume":"26","author":[{"given":"KONSTANTINOS","family":"CHATZIKOKOLAKIS","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CATUSCIA","family":"PALAMIDESSI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CHRISTELLE","family":"BRAUN","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,11,24]]},"reference":[{"key":"S0960129514000292_ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14162-1_19"},{"key":"S0960129514000292_ref19","first-page":"244","volume-title":"Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques","author":"Fujioka","year":"1993"},{"key":"S0960129514000292_ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12459-4_8"},{"key":"S0960129514000292_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2007.07.003"},{"key":"S0960129514000292_ref22","doi-asserted-by":"crossref","unstructured":"Hamadou S. , Palamidessi C. and Sassone V. (2010) Reconciling belief and vulnerability in information flow. In: Proceedings of the 31st IEEE Symposium on Security and Privacy, IEEE Computer Society 79\u201392.","DOI":"10.1109\/SP.2010.13"},{"key":"S0960129514000292_ref23","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46432-8_10"},{"key":"S0960129514000292_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2004.01.018"},{"key":"S0960129514000292_ref10","volume-title":"A Course in Probability Theory","author":"Chung","year":"2000"},{"key":"S0960129514000292_ref37","doi-asserted-by":"publisher","DOI":"10.1145\/290163.290168"},{"key":"S0960129514000292_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF00206326"},{"key":"S0960129514000292_ref40","first-page":"250","article-title":"Probabilistic simulations for probabilistic processes","volume":"2","author":"Segala","year":"1995","journal-title":"Nordic Journal of Computing"},{"key":"S0960129514000292_ref31","doi-asserted-by":"crossref","unstructured":"McLean J. (1990) Security models and information flow. In: Proceedings of the 1990 IEEE Symposium on Security and Privacy (SSP'90), IEEE 180\u2013189.","DOI":"10.21236\/ADA462529"},{"key":"S0960129514000292_ref41","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36467-6_4"},{"key":"S0960129514000292_ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36467-6_5"},{"key":"S0960129514000292_ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75227-1_5"},{"key":"S0960129514000292_ref8","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-2008-0333"},{"key":"S0960129514000292_ref20","unstructured":"Garcia F. D. , van Rossum P. and Sokolova A. (2007) Probabilistic anonymity and admissible schedulers arXiv:0706.1019v1."},{"key":"S0960129514000292_ref33","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1145\/1005140.1005153","volume-title":"Workshop on Privacy in the Electronic Society 2003","author":"Moskowitz","year":"2003"},{"key":"S0960129514000292_ref32","volume-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"S0960129514000292_ref3","doi-asserted-by":"crossref","unstructured":"Andr\u00e9s M. E. , Palamidessi C. , van Rossum P. and Sokolova A. (2010 b) Information hiding in probabilistic concurrent systems. In: Proceedings of the 7th IEEE International Conference on Quantitative Evaluation of SysTems (QEST 2010), IEEE Computer Society 17\u201326.","DOI":"10.1109\/QEST.2010.11"},{"key":"S0960129514000292_ref21","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-2005-13305"},{"key":"S0960129514000292_ref17","doi-asserted-by":"crossref","unstructured":"Desharnais J. , Jagadeesan R. , Gupta V. and Panangaden P. (2002) The metric analogue of weak bisimulation for probabilistic processes. In: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society 413\u2013422.","DOI":"10.1109\/LICS.2002.1029849"},{"key":"S0960129514000292_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15375-4_8"},{"key":"S0960129514000292_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/11539452_16"},{"key":"S0960129514000292_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19805-2_27"},{"key":"S0960129514000292_ref28","first-page":"225","volume-title":"Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2007)","author":"Malacaria","year":"2007"},{"key":"S0960129514000292_ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)00290-7"},{"key":"S0960129514000292_ref14","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"S0960129514000292_ref26","doi-asserted-by":"crossref","unstructured":"K\u00f6pf B. and Basin D. A. (2007) An information-theoretic model for adaptive side-channel attacks. In: Ning P. , di Vimercati S. D. C. and Syverson P. F. (eds.) Proceedings of the 2007 ACM Conference on Computer and Communications Security (CCS 2007), ACM 286\u2013296.","DOI":"10.1145\/1315245.1315282"},{"key":"S0960129514000292_ref29","first-page":"135","volume-title":"Proceedings of the 2008 Workshop on Programming Languages and Analysis for Security (PLAS 2008)","author":"Malacaria","year":"2008"},{"key":"S0960129514000292_ref25","doi-asserted-by":"publisher","DOI":"10.1109\/RISP.1991.130769"},{"key":"S0960129514000292_ref34","doi-asserted-by":"crossref","unstructured":"Moskowitz I. S. , Newman R. E. and Syverson P. F. (2003a) Quasi-anonymous channels. In: Proceedings of the IASTED International Conference on Communication, Network, and Information Security (CNIS 2003). IASTED 126\u2013131.","DOI":"10.21236\/ADA465128"},{"key":"S0960129514000292_ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2009.06.006"},{"key":"S0960129514000292_ref39","unstructured":"Segala R. (1995) Modeling and verification of randomized distributed real-time systems, Ph.D. thesis. Technical Report MIT\/LCS\/TR-676."},{"key":"S0960129514000292_ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.11.020"},{"key":"S0960129514000292_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12002-2_32"},{"key":"S0960129514000292_ref35","volume-title":"Topology: A First Course","author":"Munkres","year":"2000"},{"key":"S0960129514000292_ref13","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-2009-0353"},{"key":"S0960129514000292_ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2002.1021804"},{"key":"S0960129514000292_ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00596-1_21"},{"key":"S0960129514000292_ref38","unstructured":"R\u00e9nyi A. (1961) On measures of entropy and information. In: Proceedings of the 4th Berkeley Symposium on Mathematics, Statistics, and Probability 547\u2013561."},{"key":"S0960129514000292_ref15","doi-asserted-by":"publisher","DOI":"10.1007\/11601548_17"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129514000292","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,23]],"date-time":"2022-04-23T04:32:46Z","timestamp":1650688366000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129514000292\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,24]]},"references-count":42,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["S0960129514000292"],"URL":"https:\/\/doi.org\/10.1017\/s0960129514000292","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,24]]}}}