{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T14:51:14Z","timestamp":1773154274162,"version":"3.50.1"},"publisher-location":"New York","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"value":"0387240500","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-24098-5_6","type":"book-chapter","created":{"date-parts":[[2005,10,3]],"date-time":"2005-10-03T17:34:04Z","timestamp":1128360844000},"page":"71-84","source":"Crossref","is-referenced-by-count":15,"title":["Decidability of Opacity with Non-Atomic Keys"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Mazar\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","volume-title":"Reconciling two views of cryptography","author":"M. Abadi","year":"2000","unstructured":"Abadi, M. and Rogaway, P. (2000). Reconciling two views of cryptography (the computational soundness of formal encryption). In IFIP International Conference on Theoretical Computer Science (IFIP TCS2000), Sendai, Japan. Springer-Verlag, Berlin Germany."},{"key":"6_CR2","unstructured":"Avispa (1999). The Avispa Project. http:\/\/www.avispa-project.org\/."},{"key":"6_CR3","unstructured":"Boisseau, A. (2003). Abstractions pour la v\u00e9rification de propri\u00e9t\u00e9s de s\u00e9curit\u00e9 de protocoles cryptographiques. PhD thesis, Laboratoire Specification et V\u00e9rification (LSV), ENS de Cachan."},{"key":"6_CR4","unstructured":"Bozga, L., Lakhnech, Y., and P\u00e9rin, M. (2002). Abstract interpretation for secrecy using patterns. Technical report, EVA: http:\/\/www-eva.imag.fr\/."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Clarke, E., Jha, S., and Marrero, W. (1998). Using state space exploration and a natural deduction style message derivation engine to verify security protocols. In IFIP Working Conference on Programming Concepts and Methods.","DOI":"10.1007\/978-0-387-35358-6_10"},{"key":"6_CR6","unstructured":"Comon-Lundh., H. and Cortier, V. (2002). Security properties: Two agents are sufficient. Technical report, LSV."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Comon-Lundh, H. and Cortier, V. (2003). New decidability results for fragments of first-order logic and application to cryptographic protocols. In 14th Int. Conf. Rewriting Techniques and Applications (RTA '2003), volume 2706 of LNCS.","DOI":"10.1007\/3-540-44881-0_12"},{"key":"6_CR8","unstructured":"Delaune, S. (2003). Intruder deduction problem in presence of guessing attacks. Workshop on Security Protocols Verification (SPV'03), co-located with the 14th International Conference on Concurrency Theory (CONCUR'03)."},{"issue":"2","key":"6_CR9","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D. Dolev","year":"1983","unstructured":"Dolev, D. and Yao, A. C. (1983). On the security of public key protocols. IEEE Transactions on Information Theory, 29(2): 198\u2013208.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"6_CR10","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1109\/49.223865","volume":"11","author":"L. Gong","year":"1993","unstructured":"Gong, L., Lomas, M. A., Needham, R. M., and Saltzer, J. H. (1993). Protecting poorly chosen secrets from guessing attacks. IEEE Journal on Selected Areas in Communications, 11(5):648\u2013656.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Goubault-Larrecq, J. (2000). A method for automatic cryptographic protocol verification. In International Workshop on Formal Methods for Parallel Programming: Theory and Applications, volume 1800 of LNCS.","DOI":"10.1007\/3-540-45591-4_134"},{"issue":"l","key":"6_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/JCS-2004-12102","volume":"12","author":"D. Hughes","year":"2004","unstructured":"Hughes, D. and Shmatikov, V. (2004). Information hiding, anonymity and privacy: A modular approach. Journal of Computer Security, 12(l):3\u201336.","journal-title":"Journal of Computer Security"},{"key":"6_CR13","unstructured":"Lowe, G. (2002). Analysing protocols subject to guessing attacks. In Proc. of the Workshop on Issues in the Theory of Security (WITS '02)."},{"key":"6_CR14","unstructured":"Mazar\u00e9, L. (2004). Using unification for opacity properties. In Proc. of the Workshop on Issues in the Theory of Security (WITS '04). To appear."},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Schneider, S. and Sidiropoulos, A. (1996). CSP and anonymity. In ESORICS, pages 198\u2013218.","DOI":"10.1007\/3-540-61770-1_38"}],"container-title":["IFIP International Federation for Information Processing","Formal Aspects in Security and Trust"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-24098-5_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T04:50:32Z","timestamp":1619499032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-24098-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387240500"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/0-387-24098-5_6","relation":{},"subject":[]}}