Encryption

Encrypted data is passed as an Enc<Owner, T> generic type, where Owner specifies who can decrypt the data (either Shared or Mxe), and T is the underlying data type being encrypted. In the case of Mxe, the nodes collectively can decrypt the data under dishonest majority assumptions, whereas if the Owner is Shared, then the data was encrypted using a shared secret between the user and the MXE. Underneath the hood, this generic wrapper type contains the encrypted data, as well as the public key (only for Shared owner) and nonce used to encrypt the data.

Encrypted data can be decrypted globally or selectively to a given user. For global decryption, you can call reveal method on any variable of . Read more about how we enable this using re-encryption (aka sealing) in Arcium .

Private inputs are encrypted using the arithmetization-oriented symmetric . Prior to the encryption, a elliptic curve Diffie-Hellman key exchange is performed between the client and the cluster to derive a common shared secret. The Rescue key is obtained by applying the key derivation to the shared secret. This increases the min-entropy of the key. Note:

Since the x25519 key exchange natively returns shared secrets in the finite field with $p = 2^{255} - 19$ elements, we implemented Rescue over the field $\mathbb{F}_{p}$ . States in the context of Rescue are elements of the $m$ -dimensional vector space $\mathbb{F}_p^m$ , i.e., the Rescue cipher transforms vectors of size $m$ to vectors of the same size.
The security level $s$ of the cipher is set to 128 bits.
We use the Rescue block cipher in (see Section 6.5), with fixed $m = 5$ . The choice $m = 5$ is motivated by the fact that it is the smallest value that attains the minimum of recommended rounds (10), given the fixed finite field and security level. The counters are of the form [nonce, i, 0, 0, 0], where nonce are 16 random bytes provided by the user.
The hash function used for the key derivation is over $\mathbb{F}_{2^{255}-19}$ , with $m = 6$ and capacity = 1 (yielding rate = 5, which matches the size of the states for the Rescue cipher, see 3.). According to , this offers 255 / 2 bits of security against collision, preimage and second-preimage attacks.
Since Rescue-Prime is based on the , the traditional can be replaced by the simpler MAC, see e.g. (Appendix B) or .

The decryption of input_enc: Enc<Owner, T> can conveniently be obtained by calling input_enc.to_arcis() (the nodes do not learn input, they simply convert the ciphertext to secret-shares of input by running the Rescue decryption circuit in MPC). If the owner is Shared, the MXE and the client perform a key exchange first. Similarly, owner.from_arcis(output) encrypts the secret-shared output by running the Rescue encryption circuit in MPC. Note:

After decrypting the user-provided inputs, the MXE increments the nonce by 1 and uses it for encrypting the outputs. For the forthcoming interaction with the MXE, a new nonce must be provided.
The performance will benefit from reducing the number of calls to owner.from_arcis(..) (per owner). Ideally, put all data encrypted to owner in one struct.

PreviousArcium Computation Lifecycle NextSealing aka re-encryption

Last updated 1 day ago

Since the x25519 key exchange natively returns shared secrets in the finite field with $p = 2^{255} - 19$ elements, we implemented Rescue over the field $\mathbb{F}_{p}$ . States in the context of Rescue are elements of the $m$ -dimensional vector space $\mathbb{F}_p^m$ , i.e., the Rescue cipher transforms vectors of size $m$ to vectors of the same size.
The security level $s$ of the cipher is set to 128 bits.
We use the Rescue block cipher in (see Section 6.5), with fixed $m = 5$ . The choice $m = 5$ is motivated by the fact that it is the smallest value that attains the minimum of recommended rounds (10), given the fixed finite field and security level. The counters are of the form [nonce, i, 0, 0, 0], where nonce are 16 random bytes provided by the user.
The hash function used for the key derivation is over $\mathbb{F}_{2^{255}-19}$ , with $m = 6$ and capacity = 1 (yielding rate = 5, which matches the size of the states for the Rescue cipher, see 3.). According to , this offers 255 / 2 bits of security against collision, preimage and second-preimage attacks.
Since Rescue-Prime is based on the , the traditional can be replaced by the simpler MAC, see e.g. (Appendix B) or .

After decrypting the user-provided inputs, the MXE increments the nonce by 1 and uses it for encrypting the outputs. For the forthcoming interaction with the MXE, a new nonce must be provided.
The performance will benefit from reducing the number of calls to owner.from_arcis(..) (per owner). Ideally, put all data encrypted to owner in one struct.