CoChat

On the (im)possibility of perennial message recognition protocols without public-key cryptography

González Muñiz, Madeline, Laud, Peeter · 2011 · Proceedings of the 2011 ACM Symposium on Applied Computing

The DOI matches its Crossref record; 31 of the 33 references it cites were found in a registry or an index.

Abstract

A message recognition protocol (MRP) aims to exchange authenticated information in an insecure channel. During the initialization session of the protocol, the parties exchange some authenticated information which the adversary can passively observe. Then, one party wants to send authenticated messages to the other party over an insecure channel. Such security requirements are often found in wireless sensor networks.

Overview

Integrity signals

Registry

Crossref · 10.1145/1982185.1982508

Cites

31 of 31 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Research works printed but not linked: 2

  1. 10.5555/794201.795170 · doi:10.5555/794201.795170
  2. 10.5555/1150577.1150581 · doi:10.5555/1150577.1150581

Cited by

See all 5

Metadata

Authors
González Muñiz, M., & Laud, P.
Affiliations
  • Cybernetica AS, Tallinn, Estonia
  • Cybernetica (Estonia) (EE)
Venue
Proceedings of the 2011 ACM Symposium on Applied Computing
Publisher
ACM
Published
2011-03-21
Pages
1510-1515
OpenAlex
W2091060878
Cited by
5
References
33
Citations by year
2021: 1 · 2015: 2 · 2014: 1
FWCI
0.57
Type
conference paper
Language
en
Open access
closed
Locations
ACM Symposium on Applied Computing (publishedVersion)
Funders
Estonian Science Foundation (8124)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Authentication Protocols Security
  • Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
  • Physical Sciences › Computer Science › Computer Networks and Communications › Security in Wireless Sensor Networks
Keywords
public-key cryptography, authentication, passive eavesdropping, wireless sensor networks, impossibility results

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.