• No results found

Lecture Notes in Computer Science 11286

N/A
N/A
Protected

Academic year: 2021

Share "Lecture Notes in Computer Science 11286"

Copied!
10
0
0

Loading.... (view fulltext now)

Full text

(1)

Lecture Notes in Computer Science

11286

Commenced Publication in 1973

Founding and Former Series Editors:

Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen

Editorial Board

David Hutchison

Lancaster University, Lancaster, UK Takeo Kanade

Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler

University of Surrey, Guildford, UK Jon M. Kleinberg

Cornell University, Ithaca, NY, USA Friedemann Mattern

ETH Zurich, Zurich, Switzerland John C. Mitchell

Stanford University, Stanford, CA, USA Moni Naor

Weizmann Institute of Science, Rehovot, Israel C. Pandu Rangan

Indian Institute of Technology Madras, Chennai, India Bernhard Steffen

TU Dortmund University, Dortmund, Germany Demetri Terzopoulos

University of California, Los Angeles, CA, USA Doug Tygar

University of California, Berkeley, CA, USA Gerhard Weikum

(2)
(3)

Vashek Maty

áš

Petr

Švenda

Frank Stajano

Bruce Christianson

Jonathan Anderson (Eds.)

Security

Protocols XXVI

26th International Workshop

Cambridge, UK, March 19

–21, 2018

Revised Selected Papers

(4)

Editors Vashek Matyáš Masaryk University Brno, Czech Republic PetrŠvenda

Masaryk University Brno, Czech Republic Frank Stajano University of Cambridge Cambridge, UK Bruce Christianson University of Hertfordshire Hatfield, UK Jonathan Anderson

Memorial University of Newfoundland St. John’s, NL, Canada

ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notes in Computer Science

ISBN 978-3-030-03250-0 ISBN 978-3-030-03251-7 (eBook)

https://doi.org/10.1007/978-3-030-03251-7

Library of Congress Control Number: 2018959144 LNCS Sublibrary: SL4– Security and Cryptology © Springer Nature Switzerland AG 2018

This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed.

The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use.

The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

(5)

Preface

This volume collects the revised proceedings of the 26th International Security Pro-tocols Workshop, held at Trinity College, Cambridge, UK during March 19–21, 2018. The theme of this workshop was “Fail-safe and fail-deadly concepts in protocol design”. The dictionary definition1reveals:

fail-safe:

1: incorporating some feature for automatically counteracting the effect of an antic-ipated possible source of failure

2: being or relating to a safeguard that prevents continuing on a bombing mission according to a preconceived plan

3: having no chance of failure : infallibly problem-free

We all know that security protocols fail. Fortunately, they do not fail all the time, although sometimes their failure is less evident than we would like. In some situations, specific partial protocol failures that are properly observed and recorded can by design lead to responses that will still drive the protocol execution to a successful end. At other times, we deliberately aim for an all-or-nothing mindset: fail-deadly is a concept from nuclear military strategy, suggesting deterrence by an immediate and forceful response to an attack. It is interesting to investigate what differentiates these two design approaches to security protocols, and what they have in common when we consider a family of protocols where both fail-safe and fail-deadly versions are considered.

As usual, this theme was not prescriptive. It was not intended to restrict the topic of the papers, but to help provide a particular perspective for the authors and focus of the discussions, for any paper in some way related to security protocols. The authors were strongly encouraged to consider the theme as a springboard, not a fence. Our intention was to stimulate discussion likely to lead to conceptual advances, or to promising new lines of investigation, rather than to considerfinished work.

Thefirst three papers formed a starting block (Warmup – failures and attacks), the following two by Becerra et al. and Nemec et al. then presented novel protocols. The core block on Tuesday, titled“Threat models and incentives,” comprised eight papers. The last day of the workshop started with two papers on cryptomoney (McCorry et al. and Anderson et al.), and the workshop closed with twofinal papers on the interplay of cryptography and dissent.

As with previous workshops in this series, each paper was revised by the authors to incorporate ideas that emerged during the workshop. These revised papers are followed by a curated transcript of the presentation and ensuing discussion.

Our thanks go to all the authors for their kind and timely collaboration in revising these transcripts and their position paper. Particular thanks to Seb Aebischer, Kat Krol, and David Llewellyn-Jones for assisting Frank Stajano with the recordings of the

(6)

workshop discussions. Last but not least, we thank Trinity College, Cambridge, for hosting the workshop.

We hope that reading these proceedings will encourage you to join in the debate yourselves, and perhaps even to send us a position paper for the next workshop.

September 2018 Vashek Matyáš

PetrŠvenda Frank Stajano Bruce Christianson Jonathan Anderson

(7)

Previous Proceedings in This Series

The proceedings of previous International Security Protocols Workshops are also published by Springer Verlag as Lecture Notes in Computer Science, and are occasionally referred to in the text:

25th Workshop (2017) LNCS 10476 ISBN 978-3-319-71074-7 24th Workshop (2016) LNCS 10368 ISBN 978-3-319-62032-9 23rd Workshop (2015) LNCS 9379 ISBN 978-3-319-26095-2 22nd Workshop (2014) LNCS 8809 ISBN 978-3-319-12399-8 21st Workshop (2013) LNCS 8263 ISBN 978-3-642-41716-0 20th Workshop (2012) LNCS 7622 ISBN 978-3-642-35693-3 19th Workshop (2011) LNCS 7114 ISBN 978-3-642-25866-4 18th Workshop (2010) LNCS 7061 ISBN 978-3-662-45920-1 17th Workshop (2009) LNCS 7028 ISBN 978-3-642-36212-5 16th Workshop (2008) LNCS 6615 ISBN 978-3-642-22136-1 15th Workshop (2007) LNCS 5964 ISBN 978-3-642-17772-9 14th Workshop (2006) LNCS 5087 ISBN 978-3-642-04903-3 13th Workshop (2005) LNCS 4631 ISBN 3-540-77155-7 12th Workshop (2004) LNCS 3957 ISBN 3-540-40925-4 11th Workshop (2003) LNCS 3364 ISBN 3-540-28389-7 10th Workshop (2002) LNCS 2845 ISBN 3-540-20830-5 9th Workshop (2001) LNCS 2467 ISBN 3-540-44263-4 8th Workshop (2000) LNCS 2133 ISBN 3-540-42566-7 7th Workshop (1999) LNCS 1796 ISBN 3-540-67381-4 6th Workshop (1998) LNCS 1550 ISBN 3-540-65663-4 5th Workshop (1997) LNCS 1361 ISBN 3-540-64040-1 4th Workshop (1996) LNCS 1189 ISBN 3-540-63494-5

(8)

Contents

Raven Authentication Service: Attacks and Countermeasures . . . 1

Graham Rymer and David Llewellyn-Jones

Raven Authentication Service Attacks and Countermeasures

(Transcript of Discussion) . . . 15

Graham Rymer

Your Code Is My Code: Exploiting a Common Weakness

in OAuth 2.0 Implementations . . . 24

Wanpeng Li, Chris J. Mitchell, and Thomas Chen

Your Code Is My Code: Exploiting a Common Weakness

in OAuth 2.0 Implementations (Transcript of Discussion). . . 42

Wanpeng Li

Non-monotonic Security Protocols and Failures in Financial Intermediation . . . 45

Fabio Massacci, Chan Nam Ngo, Daniele Venturi, and Julian Williams

Non-monotonic Security Protocols and Failures in Financial Intermediation

(Transcript of Discussion) . . . 55

Fabio Massacci

HoneyPAKEs . . . 63

José Becerra, Peter B. Rønne, Peter Y. A. Ryan, and Petra Sala

HoneyPAKEs (Transcript of Discussion) . . . 78

Peter Y. A. Ryan

Entropy Crowdsourcing– Protocols for Link Key Updates in Wireless

Sensor Networks . . . 84

Lukas Nemec, Radim Ostadal, Vashek Matyas, and Petr Svenda

Entropy Crowdsourcing– Protocols for Link Key Updates in Wireless

Sensor Networks (Transcript of Discussion) . . . 93

Lukas Nemec

Daemones Non Operantur Nisi Per Artem: Daemons Do Not Operate Save Through Trickery: Human Tailored Threat Models for Formal

Verification of Fail-Safe Security Ceremonies . . . 96

(9)

Daemones Non Operantur Nisi Per Artem: Daemons Do Not Operate Save Through Trickery:Human Tailored Threat Models for Formal Verification

of Fail-Safe Security Ceremonies (Transcript of Discussion) . . . 106

Jean Everson Martina

Intentionality and Agency in Security . . . 114

Kat Krol, David Llewellyn-Jones, Seb Aebischer, Claudio Dettoni, and Frank Stajano

Intentionality and Agency in Security (Transcript of Discussion) . . . 126

Kat Krol

Incentives in Security Protocols . . . 132

Sarah Azouvi, Alexander Hicks, and Steven J. Murdoch

Incentives in Security Protocols (Transcript of Discussion) . . . 142

Steven J. Murdoch

Too Big to FAIL: What You Need to Know Before Attacking a Machine

Learning System . . . 150

Tudor Dumitraş, Yiğitcan Kaya, Radu Mărginean, and Octavian Suciu

Too Big to FAIL: What You Need to Know Before Attacking a Machine

Learning System (Transcript of Discussion) . . . 163

Tudor Dumitraş

How Does Match-Fixing Inform Computer Game Security? . . . 166

Jeff Yan

How Does Match-Fixing Inform Computer Game Security?

(Transcript of Discussion) . . . 171

Jeff Yan

From Secure Messaging to Secure Collaboration . . . 179

Martin Kleppmann, Stephan A. Kollmann, Diana A. Vasile, and Alastair R. Beresford

From Secure Messaging to Secure Collaboration (Transcript of Discussion) . . . 186

Martin Kleppmann

Requirements for Root of Trust Establishment . . . 192

Virgil Gligor and Maverick Woo

Requirements for Root of Trust Establishment (Transcript of Discussion) . . . . 203

Virgil Gligor

User Authentication for the Internet of Things . . . 209

Frank Stajano and Mark Lomas

(10)

User Authentication for the Internet of Things (Transcript of Discussion) . . . . 214

Mark Lomas

Why Preventing a Cryptocurrency Exchange Heist Isn’t Good Enough . . . 225

Patrick McCorry, Malte Möser, and Syed Taha Ali

Why Preventing a Cryptocurrency Heist Isn’t Good Enough

(Transcript of Discussion) . . . 234

Patrick McCorry

Making Bitcoin Legal . . . 243

Ross Anderson, Ilia Shumailov, and Mansoor Ahmed

Making Bitcoin Legal (Transcript of Discussion). . . 254

Ross Anderson

On the Incommensurability of Laws and Technical Mechanisms:

Or, What Cryptography Can’t Do . . . 266

Joan Feigenbaum and Daniel J. Weitzner

On the Incommensurability of Laws and Technical Mechanisms:

Or, What Cryptography Can’t Do (Transcript of Discussion) . . . 280

Daniel J. Weitzner

Shatter Secrets: Using Secret Sharing to Cross Borders

with Encrypted Devices . . . 289

Erinn Atwater and Ian Goldberg

Shatter Secrets: Using Secret Sharing to Cross Borders

with Encrypted Devices (Transcript of Discussion) . . . 295

Erinn Atwater and Ian Goldberg

Author Index . . . 305

References

Related documents