Paper 2026/694

Proximity Signatures

Guillermo Angeris, Bain Capital Crypto
Kobi Gurkan, Bain Capital Crypto
Abstract

In this note we introduce the concept of proximity signatures, where verifiers who can only access a small part of some data would like a guarantee that (a) this data is “close” to a uniquely decodable message (so the message can be decoded from the data via error decoding) and (b) the uniquely decodable message is signed by an associated secret key. This is useful in situations where the message is very large but the verifiers are small devices who only need the guarantee that the message was signed by some specific secret key or set of keys. As a motivating example, we consider the data availability problem. There, users submit large signed pieces of data that together form a larger data matrix. The signatures and integrity of this data must then be checked by nodes who can only download a small proportion of this matrix. We present a construction inspired by linear subspace signatures.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
data availabilitysignaturesaggregation
Contact author(s)
gangeris @ baincapital com
kgurkan @ baincapital com
History
2026-04-11: approved
2026-04-08: received
See all versions
Short URL
https://ia.cr/2026/694
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2026/694,
      author = {Guillermo Angeris and Kobi Gurkan},
      title = {Proximity Signatures},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/694},
      year = {2026},
      url = {https://eprint.iacr.org/2026/694}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.