Publications 2011

Main content

  • Mahdi Asadpour and Mohammad Torabi Dashti.
    A Privacy-friendly RFID protocol using reusable anonymous tickets.
    In IEEE TrustCom '11.IEEE, 2011.
    [BibTeX (TXT, 465 Bytes) | DOI]
  • David Basin and Samuel J. Burri and Guenter Karjoth.
    Obstruction-free Authorization Enforcement: Aligning Security and Business Objectives.
    In 24th Computer Security Foundations Symposium (CSF 2011).
    IEEE, 2011.
    [BibTeX (TXT, 2 KB) | PDF (PDF, 600 KB) | DOI]
  • David Basin and Samuel J. Burri and Guenter Karjoth.
    Separation of Duties as a Service.
    In ACM Symposium on Information, Computer and Communications Security (ASIACCS '11'). ACM, 2011.
    [BibTeX (TXT, 1 KB) | PDF (PDF, 582 KB)]
  • David Basin and Carlos Caleiro and Jaime Ramos and Luca Viganò.
    Distributed temporal logic for the analysis of security protocol models
    In Theoretical Computer Science, 412 (31), pages 4007-4043, 2011.
    [BibTeX (TXT, 2 KB) | PDF (PDF, 1.4 MB) | DOI]
  • David Basin and Srdjan Capkun and Patrick Schaller and Benedikt Schmidt.
    Formal Reasoning about Physical Properties of Security Protocols.
    In ACM Transactions on Information and System Security, 14 (2), pages 16:1-16:29, 2011.
    [BibTeX (TXT, 2 KB) | PDF (PDF, 530 KB) | DOI]
  • David A. Basin and Manuel Clavel and Marina Egea.
    A decade of model-driven security.
    In Proceedings of the 16th ACM symposium on Access control models and technologies (SACMAT 2011)., 1998443. New York, NY, USA, 2011.
    [BibTeX (TXT, 584 Bytes) | PDF (PDF, 375 KB) | DOI]
  • David Basin and Manuel Clavel and Marina Egea and Miguel Garcia de Dios and Carolina Dania and Gonzalo Ortiz and Javier Valdazo.
    Model-Driven Development of Security-Aware GUIs for Data-Centric Applications.
    Springer Berlin / Heidelberg, 2011.
    [BibTeX (TXT, 2 KB) | PDF (PDF, 536 KB) | DOI]
  • David Basin and Cas Cremers.
    Evaluation of ISO/IEC 9798 Protocols.
    CRYPTREC, 2011.
    Version 2.0
    [BibTeX (TXT, 317 Bytes) | PDF (PDF, 212 KB)]
  • David Basin and Cas Cremers and Catherine Meadows.
    Model Checking Security Protocols.
    Springer, 2011.
    [BibTeX (TXT, 2 KB) | DOI]
  • David Basin and Matúvs Harvan and Felix Klaedtke and Eugen Zualinescu.
    Monitoring Usage-control Policies in Distributed Systems.
    In 18th International Symposium on Temporal Representation and Reasoning (TIME 2011).
    IEEE Computer Society, 2011.
    [BibTeX (TXT, 1 KB) | DOI]
  • David Basin and Matúvs Harvan and Felix Klaedtke and Eugen Zalinescu.
    MONPOLY: Monitoring Usage-control Policies.
    In 2nd International Conference on Runtime Verification (RV 2011).
    LNCS Volume 7186/2012, 2011.
    [BibTeX (TXT, 372 Bytes) | DOI]
  • Achim D. Brucker and Lukas Brügger and Paul Kearney and Burkhart Wolff.
    An Approach to Modular and Testable Security Models of Real-world Health-Care Applications.
    In ACM symposium on access control models and technologies (SACMAT).
    ACM Press, 2011.
    [BibTeX (TXT, 2 KB) | PDF (TXT, 2 KB)]
  • Joachim M. Buhmann and Morteza Haghir Chehreghani and Mario Frank and Andreas P. Streich.
    Information Theoretic Model Selection for Pattern Analysis.
    In ICML 2011 Workshop on Unsupervised and Transfer Learning., 2011.
    [BibTeX (TXT, 2 KB) | PDF (PDF, 305 KB)]
  • Samuel J. Burri and Guenter Karjoth.
    Flexible Scoping of Authorization Constraints on Workflows with Loops and Parallelism.
    In 1st BPM Workshop on Workflow Security Audit and Certification (WfSAC '11).LNCSSpringer, 2011.
    [BibTeX (TXT, 2 KB) | PDF (PDF, 442 KB))
  • Jan Cederquist and Mohammad Torabi Dashti.
    Complexity of fairness constraints for the Dolev-Yao attacker model.
    In ACM Symposium On Applied Computing (SAC).SAC '11ACM, 2011.
    [BibTeX (TXT, 626 Bytes) | PDF (PDF, 626 KB) | DOI]
  • Jan Cederquist and Mohammad Torabi Dashti and Yanjing Wang.
    Risk balance in optimistic non-repudiation protocols.
    In Formal Aspects of Security & Trust (FAST 2011).
    Springer, 2011.
    [BibTeX (TXT, 350 Bytes)]
  • Bruno Conchinha and David Basin and Carlos Caleiro.
    FAST: An Efficient Decision Procedure for Deduction and Static Equivalence.
    In 22nd International Conference on Rewriting Techniques and Applications, RTA 2011.
    LIPIcs, 10. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011.
    [BibTeX (TXT, 1 KB) | PDF (PDF, 540 KB) | URL)
  • Bruno Conchinha and David Basin and Carlos Caleiro.
    Efficient Decision Procedures for Message Deducibility and Static Equivalence.
    In 7th International Workshop on Formal Aspects of Security and Trust - FAST 2010.
    Lecture Notes in Computer Science, 6561. Springer, 2011.
    [BibTeX (TXT, 2 KB) | PDF (PDF, 290 KB) | DOI]
  • Cas J.F. Cremers.
    Key Exchange in IPsec revisited: Formal Analysis of IKEv1 and IKEv2.
    In ESORICS 2011. LNCS Volume 6879/2011.
    Springer Verlag, 2011.
    [BibTeX (TXT, 584 Bytes) | PDF (PDF, 302 KB) | DOI]
  • Cas J.F. Cremers.
    Examining Indistinguishability-Based Security Models for Key Exchange Protocols: The case of CK, CK-HMQV, and eCK.
    In Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security (ASIACCS 2011).
    ACM, 2011.
    [BibTeX (TXT, 574 Bytes) | PDF (PDF, 164 KB) | DOI]
  • Cas Cremers and Michele Feltz.
    One-round Strongly Secure Key Exchange with Perfect Forward Secrecy and Deniability.
    Cryptology ePrint Archive, 2011.
    Report 2011/300
    [BibTeX (TXT, 380 Bytes) | URL]
  • Cas Cremers and Kasper Bonne Rasmussen and Srdjan Capkun.
    Distance Hijacking Attacks on Distance Bounding Protocols.
    Cryptology ePrint Archive, 2011.
    Report 2011/129
    [BibTeX (TXT, 380 Bytes) | URL]
  • Mohammad Torabi Dashti.
    Faulhaber's Triangle.
    In The College Mathematics Journal, 42 (2), 2011.
    [BibTeX (TXT, 258 Bytes) | DOI]
  • Christian Dax and Felix Klaedtke.
    Alternation Elimination for Automata over Nested Words.
    In 14th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'11).
    Lecture Notes in Computer Science, 6604. Springer, 2011.
    [BibTeX (TXT, 501 Bytes) | DOI]
  • Mario Frank and Joachim M. Buhmann.
    Selecting the rank of truncated SVD by Maximum Approximation Capacity.
    In ISIT 2011: IEEE International Symposium on Information Theory.
    IEEE, 2011.
    [BibTeX (TXT, 1 KB) | URL]
  • Mario Frank and Morteza and Haghir Chehreghani and Joachim M. Buhmann.
    The Minimum Transfer Cost Principle for Model-Order Selection.
    In ECML PKDD 2011: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases.Springer, 2011.
    [BibTeX (TXT, 2 KB) | PDF (PDF, 1.8 MB) | DOI]
  • Simone Frau and Mohammad Torabi Dashti.
    Integrated specification and verification of security protocols and policies.
    In IEEE 24th Computer Security Foundations Symposium (CSF 2011).
    IEEE Computer Society, 2011.
    [BibTeX (TXT, 678 Bytes) | DOI]
  • Thai Son Hoang and Jean-Raymond Abrial.
    Reasoning about Liveness Properties in Event-B.
    In Formal Methods and Software Engineering (ICFEM).
    LNCS, 6991. Springer, 2011.
    [BibTeX (TXT, 497 Bytes) | DOI]
  • Michael Schläpfer and Rolf Haenni and Reto Koenig and Oliver Spycher.
    Efficient Vote Authorization in Coercion-Resistant Internet Voting.
    In 3rd International Conference on E-Voting and Identity (VoteID 2011).
    Springer-Verlag, 2011.
    [BibTeX (TXT, 1 KB) | URL]
  • Michael Schläpfer and Oliver Spycher and Reto Koenig and Rolf Haenni.
    A New Approach Towards Coercion-Resistant Remote E-Voting in Linear Time.
    In 15th International Conference on Financial Cryptography and Data Security.
    Springer-Verlag, 2011.
    [BibTeX (TXT, 1 KB)]
  • Renato Silva and Carine Pascal and Thai Son Hoang and Michael Butler.
    Decomposition tool for Event-B.
    In Softw. Pract. Exper., 41 (2), 2011.
    [BibTeX (TXT, 411 Bytes) | Wiley]
  • Petar Tsankov and David Basin and Mohammad Torabi Dashti.
    Constructing mid-points for two-party asynchronous protocols.
    In OPODIS 2011.Springer, 2011.
    [BibTeX (TXT, 326 Bytes)]
  • Eugen Zalinescu.
    Shorter strings containing all k-element permutations.
    In Information Processing Letters, 111 (12), 2011.
    [BibTeX (TXT, 341 Bytes) | DOI]
  • Matthias Schmalz.
    Term Rewriting in Logics of Partial Functions.
    In ICFEM, 2011.
    [BibTeX (TXT, 792 Bytes) | DOI]
  • Simon Hudon and Thai Son Hoang.
    Development of Control Systems Guided by Models of their Environment.
    In Electronic Notes in Theoretical Computer Science, 280, pages 57-68, 2011.
    [BibTeX (TXT, 480 Bytes) | DOI]
  • Christoph Sprenger and David Basin.
    Refining Key Establishment

    Computer Science Department, ETH Zurich, Technical Report 736, 2011.
    [BibTeX (TXT, 371 Bytes) | URL]
  • David Basin and Patrick Schaller and Michael Schläpfer
    Applied Information Security: A Hands-on Approach.
    Springer, 2011.
    [BibTeX (TXT, 2 KB) | cover (JPEG, 6 KB) | URL]
Page URL:
Tue Jun 27 14:19:09 CEST 2017
© 2017 Eidgenössische Technische Hochschule Zürich