A Cryptographic Look at Multi-Party Channels. / Eugster, Patrick; Marson, Giorgia Azzurra; Poettering, Bertram.

2018. 1-15 Paper presented at 31st IEEE Computer Security Foundations Symposium, Oxford, United Kingdom.

Research output: Contribution to conferencePaper

Published

Standard

A Cryptographic Look at Multi-Party Channels. / Eugster, Patrick; Marson, Giorgia Azzurra; Poettering, Bertram.

2018. 1-15 Paper presented at 31st IEEE Computer Security Foundations Symposium, Oxford, United Kingdom.

Research output: Contribution to conferencePaper

Harvard

Eugster, P, Marson, GA & Poettering, B 2018, 'A Cryptographic Look at Multi-Party Channels', Paper presented at 31st IEEE Computer Security Foundations Symposium, Oxford, United Kingdom, 9/07/18 - 12/07/18 pp. 1-15. https://doi.org/10.1109/CSF.2018.00010

APA

Eugster, P., Marson, G. A., & Poettering, B. (2018). A Cryptographic Look at Multi-Party Channels. 1-15. Paper presented at 31st IEEE Computer Security Foundations Symposium, Oxford, United Kingdom. https://doi.org/10.1109/CSF.2018.00010

Vancouver

Eugster P, Marson GA, Poettering B. A Cryptographic Look at Multi-Party Channels. 2018. Paper presented at 31st IEEE Computer Security Foundations Symposium, Oxford, United Kingdom. https://doi.org/10.1109/CSF.2018.00010

Author

Eugster, Patrick ; Marson, Giorgia Azzurra ; Poettering, Bertram. / A Cryptographic Look at Multi-Party Channels. Paper presented at 31st IEEE Computer Security Foundations Symposium, Oxford, United Kingdom.15 p.

BibTeX

@conference{d1be215d444143c5bbc0bfaa29f111da,
title = "A Cryptographic Look at Multi-Party Channels",
abstract = "Cryptographic channels aim to enable authenticated and confidential communication over the Internet. The general understanding seems to be that providing security in the sense of authenticated encryption for every (unidirectional) point-to-point link suffices to achieve this goal. As recently shown (in FSE17/ToSC17), however, even in the bidirectional case just requiring the two unidirectional links to provide security independently of each other does not lead to a secure solution in general. Informally, the reason for this is that the increased interaction in bidirectional communication may be exploited by an adversary. The same argument applies, a fortiori, in a multi-party setting where several users operate concurrently and the communication develops in more directions. In the cryptographic literature, however, the targeted goals for group communication in terms of channel security are still unexplored. Applying the methodology of provable security, we fill this gap by (i) defining exact (game-based) authenticity and confidentiality goals for broadcast communication and (ii) showing how to achieve them. Importantly, our security notions also account for the causal dependencies between exchanged messages, thus naturally extending the bidirectional case where causal relationships are automatically captured by preserving the sending order. On the constructive side we propose a modular and yet efficient protocol that, assuming only reliable point-to-point links between users, leverages (non-cryptographic) broadcast and standard cryptographic primitives to a full-fledged broadcast channel that provably meets the security notions we put forth.",
author = "Patrick Eugster and Marson, {Giorgia Azzurra} and Bertram Poettering",
year = "2018",
doi = "10.1109/CSF.2018.00010",
language = "English",
pages = "1--15",
note = "31st IEEE Computer Security Foundations Symposium ; Conference date: 09-07-2018 Through 12-07-2018",
url = "https://www.cs.ox.ac.uk/conferences/csf2018/index.html",

}

RIS

TY - CONF

T1 - A Cryptographic Look at Multi-Party Channels

AU - Eugster, Patrick

AU - Marson, Giorgia Azzurra

AU - Poettering, Bertram

PY - 2018

Y1 - 2018

N2 - Cryptographic channels aim to enable authenticated and confidential communication over the Internet. The general understanding seems to be that providing security in the sense of authenticated encryption for every (unidirectional) point-to-point link suffices to achieve this goal. As recently shown (in FSE17/ToSC17), however, even in the bidirectional case just requiring the two unidirectional links to provide security independently of each other does not lead to a secure solution in general. Informally, the reason for this is that the increased interaction in bidirectional communication may be exploited by an adversary. The same argument applies, a fortiori, in a multi-party setting where several users operate concurrently and the communication develops in more directions. In the cryptographic literature, however, the targeted goals for group communication in terms of channel security are still unexplored. Applying the methodology of provable security, we fill this gap by (i) defining exact (game-based) authenticity and confidentiality goals for broadcast communication and (ii) showing how to achieve them. Importantly, our security notions also account for the causal dependencies between exchanged messages, thus naturally extending the bidirectional case where causal relationships are automatically captured by preserving the sending order. On the constructive side we propose a modular and yet efficient protocol that, assuming only reliable point-to-point links between users, leverages (non-cryptographic) broadcast and standard cryptographic primitives to a full-fledged broadcast channel that provably meets the security notions we put forth.

AB - Cryptographic channels aim to enable authenticated and confidential communication over the Internet. The general understanding seems to be that providing security in the sense of authenticated encryption for every (unidirectional) point-to-point link suffices to achieve this goal. As recently shown (in FSE17/ToSC17), however, even in the bidirectional case just requiring the two unidirectional links to provide security independently of each other does not lead to a secure solution in general. Informally, the reason for this is that the increased interaction in bidirectional communication may be exploited by an adversary. The same argument applies, a fortiori, in a multi-party setting where several users operate concurrently and the communication develops in more directions. In the cryptographic literature, however, the targeted goals for group communication in terms of channel security are still unexplored. Applying the methodology of provable security, we fill this gap by (i) defining exact (game-based) authenticity and confidentiality goals for broadcast communication and (ii) showing how to achieve them. Importantly, our security notions also account for the causal dependencies between exchanged messages, thus naturally extending the bidirectional case where causal relationships are automatically captured by preserving the sending order. On the constructive side we propose a modular and yet efficient protocol that, assuming only reliable point-to-point links between users, leverages (non-cryptographic) broadcast and standard cryptographic primitives to a full-fledged broadcast channel that provably meets the security notions we put forth.

U2 - 10.1109/CSF.2018.00010

DO - 10.1109/CSF.2018.00010

M3 - Paper

SP - 1

EP - 15

T2 - 31st IEEE Computer Security Foundations Symposium

Y2 - 9 July 2018 through 12 July 2018

ER -