Loading AI tools

From Wikipedia, the free encyclopedia

In cryptography, a **ring signature** is a type of digital signature that can be performed by any member of a set of users that each have keys. Therefore, a message signed with a ring signature is endorsed by someone in a particular set of people. One of the security properties of a ring signature is that it should be computationally infeasible to determine *which* of the set's members' keys was used to produce the signature. Ring signatures are similar to group signatures but differ in two key ways: first, there is no way to revoke the anonymity of an individual signature; and second, any set of users can be used as a signing set without additional setup.

Ring signatures were invented by Ron Rivest, Adi Shamir, and Yael Tauman Kalai, and introduced at ASIACRYPT in 2001.^{[1]} The name, *ring signature*, comes from the ring-like structure of the signature algorithm.

This Definition is missing information about the definition. This section currently describes some useful properties of a ring signature but not the mathematical definition. (April 2022) |

Suppose that a set of entities each have public/private key pairs, (*P*_{1}, *S*_{1}), (*P*_{2}, *S*_{2}), ..., (*P*_{n}, *S*_{n}). Party *i* can compute a ring signature σ on a message *m*, on input (*m*, *S*_{i}, *P*_{1}, ..., *P*_{n}). Anyone can check the validity of a ring signature given σ, *m*, and the public keys involved, *P*_{1}, ..., *P*_{n}. If a ring signature is properly computed, it should pass the check. On the other hand, it should be hard for anyone to create a valid ring signature on any message for any set without knowing any of the private keys for that set.^{[2]}

In the original paper, Rivest, Shamir, and Tauman described ring signatures as a way to leak a secret. For instance, a ring signature could be used to provide an anonymous signature from "a high-ranking White House official", without revealing which official signed the message. Ring signatures are right for this application because the anonymity of a ring signature cannot be revoked, and because the group for a ring signature can be improvised.

Another application, also described in the original paper, is for deniable signatures. Here the sender and the recipient of a message form a group for the ring signature, then the signature is valid to the recipient, but anyone else will be unsure whether the recipient or the sender was the actual signer. Thus, such a signature is convincing, but cannot be transferred beyond its intended recipient.

There were various works, introducing new features and based on different assumptions:

- Threshold ring signatures
^{[3]}Unlike standard "*t*-out-of-*n*" threshold signature, where*t*of*n*users should collaborate to sign a message, this variant of a ring signature requires*t*users to cooperate in the ring signing protocol. Namely,*t*parties*S*_{1}, ...,*S*_{t}∈ {*P*_{1}, ...,*P*_{n}} can compute a (*t*,*n*)-ring signature, σ, on a message,*m*, on input (*m*,*S*_{1}, ...,*S*_{t},*P*_{1}, ...,*P*_{n}).- Linkable ring signatures
^{[4]}The property of linkability allows one to determine whether any two signatures have been produced by the same member (under the same private key). The identity of the signer is nevertheless preserved. One of the possible applications can be an offline e-cash system.- Traceable ring signature
^{[5]}In addition to the previous scheme the public key of the signer is revealed (if they issue more than one signatures under the same private key). An e-voting system can be implemented using this protocol.

Most of the proposed algorithms have asymptotic output size ; i.e., the size of the resulting signature increases linearly with the size of input (number of public keys). That means that such schemes are impracticable for real use cases with sufficiently large (for example, an e-voting with millions of participants). But for some application with relatively small median input size such estimate may be acceptable. CryptoNote implements ring signature scheme by Fujisaki and Suzuki^{[5]} in p2p payments to achieve sender's untraceability.

More efficient algorithms have appeared recently. There are schemes with the sublinear size of the signature,^{[6]} as well as with constant size.^{[7]}

The original paper describes an RSA based ring signature scheme, as well as one based on Rabin signatures. They define a keyed "combining function" which takes a key , an initialization value , and a list of arbitrary values . is defined as , where is a trap-door function (i.e. an RSA public key in the case of RSA based ring signatures).

The function is called the ring equation, and is defined below. The equation is based on a symmetric encryption function :

It outputs a single value which is forced to be equal to . The equation can be solved as long as at least one , and by extension , can be freely chosen. Under the assumptions of RSA, this implies knowledge of at least one of the inverses of the trap door functions (i.e. a private key), since .

Generating a ring signature involves six steps. The plaintext is signified by , the ring's public keys by .

- Calculate the key , using a cryptographic hash function. This step assumes a random oracle for , since will be used as key for .
- Pick a random glue value .
- Pick random for all ring members but yourself ( will be calculated using the
**s**igner's private key), and calculate corresponding . - Solve the ring equation for
- Calculate using the signer's private key:
- The ring signature now is the -tuple

Signature verification involves three steps.

- Apply the public key trap door on all : .
- Calculate the symmetric key .
- Verify that the ring equation holds .

Here is a Python implementation of the original paper using RSA. Requires 3rd-party module PyCryptodome.

```
import os
import hashlib
import random
import Crypto.PublicKey.RSA
import functools
class Ring:
"""RSA implementation."""
def __init__(self, k, L: int = 1024) -> None:
self.k = k
self.l = L
self.n = len(k)
self.q = 1 << (L - 1)
def sign_message(self, m: str, z: int):
self._permut(m)
s = [None] * self.n
u = random.randint(0, self.q)
c = v = self._E(u)
first_range = list(range(z + 1, self.n))
second_range = list(range(z))
whole_range = first_range + second_range
for i in whole_range:
s[i] = random.randint(0, self.q)
e = self._g(s[i], self.k[i].e, self.k[i].n)
v = self._E(v ^ e)
if (i + 1) % self.n == 0:
c = v
s[z] = self._g(v ^ u, self.k[z].d, self.k[z].n)
return [c] + s
def verify_message(self, m: str, X) -> bool:
self._permut(m)
def _f(i):
return self._g(X[i + 1], self.k[i].e, self.k[i].n)
y = map(_f, range(len(X) - 1))
y = list(y)
def _g(x, i):
return self._E(x ^ y[i])
r = functools.reduce(_g, range(self.n), X[0])
return r == X[0]
def _permut(self, m):
msg = m.encode("utf-8")
self.p = int(hashlib.sha1(msg).hexdigest(), 16)
def _E(self, x):
msg = f"{x}{self.p}".encode("utf-8")
return int(hashlib.sha1(msg).hexdigest(), 16)
def _g(self, x, e, n):
q, r = divmod(x, n)
if ((q + 1) * n) <= ((1 << self.l) - 1):
result = q * n + pow(r, e, n)
else:
result = x
return result
```

To sign and verify 2 messages in a ring of 4 users:

```
size = 4
msg1, msg2 = "hello", "world!"
def _rn(_):
return Crypto.PublicKey.RSA.generate(1024, os.urandom)
key = map(_rn, range(size))
key = list(key)
r = Ring(key)
for i in range(size):
signature_1 = r.sign_message(msg1, i)
signature_2 = r.sign_message(msg2, i)
assert r.verify_message(msg1, signature_1) and r.verify_message(msg2, signature_2) and not r.verify_message(msg1, signature_2)
```

Monero and several other cryptocurrencies use this technology.^{[citation needed]}

Seamless Wikipedia browsing. On steroids.

Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.

Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.