File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1145/1653662.1653705
- Scopus: eid_2-s2.0-74049116515
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Multi-party off-the-record messaging
Title | Multi-party off-the-record messaging |
---|---|
Authors | |
Keywords | Deniability Instant messaging Multi-party Privacy |
Issue Date | 2009 |
Citation | Proceedings of the ACM Conference on Computer and Communications Security, 2009, p. 358-368 How to Cite? |
Abstract | Most cryptographic algorithms provide a means for secret and authentic communication. However, under many circumstances, the ability to repudiate messages or deny a conversation is no less important than secrecy and authenticity. For whistleblowers, informants, political dissidents and journalists - to name a few - it is most important to have means for deniable conversation, where electronic communication must mimic face-to-face private meetings. Off-the-Record Messaging, proposed in 2004 by Borisov, Goldberg and Brewer, and its subsequent improvements, simulate private two-party meetings. Despite some attempts, the multi-party scenario remains unresolved. In this paper, we first identify the properties of multi-party private meetings. We illustrate the differences not only between the physical and electronic medium but also between two- and multi-party scenarios, which have important implications for the design of private chatrooms. We then propose a solution to multi-party off-the-record instant messaging that satisfies the above properties. Our solution is also composable with extensions that provide other properties, such as anonymity. Copyright 2009 ACM. |
Persistent Identifier | http://hdl.handle.net/10722/346549 |
ISSN | 2023 SCImago Journal Rankings: 1.430 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Goldberg, Ian | - |
dc.contributor.author | Ustaoǧlu, Berkant | - |
dc.contributor.author | Van Gundy, Matthew D. | - |
dc.contributor.author | Chen, Hao | - |
dc.date.accessioned | 2024-09-17T04:11:40Z | - |
dc.date.available | 2024-09-17T04:11:40Z | - |
dc.date.issued | 2009 | - |
dc.identifier.citation | Proceedings of the ACM Conference on Computer and Communications Security, 2009, p. 358-368 | - |
dc.identifier.issn | 1543-7221 | - |
dc.identifier.uri | http://hdl.handle.net/10722/346549 | - |
dc.description.abstract | Most cryptographic algorithms provide a means for secret and authentic communication. However, under many circumstances, the ability to repudiate messages or deny a conversation is no less important than secrecy and authenticity. For whistleblowers, informants, political dissidents and journalists - to name a few - it is most important to have means for deniable conversation, where electronic communication must mimic face-to-face private meetings. Off-the-Record Messaging, proposed in 2004 by Borisov, Goldberg and Brewer, and its subsequent improvements, simulate private two-party meetings. Despite some attempts, the multi-party scenario remains unresolved. In this paper, we first identify the properties of multi-party private meetings. We illustrate the differences not only between the physical and electronic medium but also between two- and multi-party scenarios, which have important implications for the design of private chatrooms. We then propose a solution to multi-party off-the-record instant messaging that satisfies the above properties. Our solution is also composable with extensions that provide other properties, such as anonymity. Copyright 2009 ACM. | - |
dc.language | eng | - |
dc.relation.ispartof | Proceedings of the ACM Conference on Computer and Communications Security | - |
dc.subject | Deniability | - |
dc.subject | Instant messaging | - |
dc.subject | Multi-party | - |
dc.subject | Privacy | - |
dc.title | Multi-party off-the-record messaging | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1145/1653662.1653705 | - |
dc.identifier.scopus | eid_2-s2.0-74049116515 | - |
dc.identifier.spage | 358 | - |
dc.identifier.epage | 368 | - |