Contents

Decision Linear assumption

Informally the DLIN assumption states that given ${\displaystyle (u,\,v,\,h,\,u^{x},\,v^{y})}$, with ${\displaystyle u,\,v,\,h}$ random group elements and ${\displaystyle x,\,y}$ random exponents, it is hard to distinguish ${\displaystyle h^{x+y}}$ from an independent random group element ${\displaystyle \eta }$.

In symmetric pairing-based cryptography the group ${\displaystyle G}$ is equipped with a pairing ${\displaystyle e:G\times G\to T}$ which is bilinear. This map gives an efficient algorithm to solve the decisional Diffie-Hellman problem. ^[2] Given input ${\displaystyle (g,\,g^{a},\,g^{b},\,h)}$, it is easy to check if ${\displaystyle h}$ is equal to ${\displaystyle g^{ab}}$. This follows by using the pairing: note that

${\displaystyle e(g^{a},g^{b})=e(g,g)^{ab}=e(g,g^{ab}).}$

Thus, if ${\displaystyle h=g^{ab}}$, then the values ${\displaystyle e(g^{a},g^{b})}$ and ${\displaystyle e(g,h)}$ will be equal.

Since this cryptographic assumption, essential to building ElGamal encryption and signatures, does not hold in this case, new assumptions are needed to build cryptography in symmetric bilinear groups. The DLIN assumption is a modification of Diffie-Hellman type assumptions to thwart the above attack.

Let ${\displaystyle G}$ be a cyclic groupofprime order ${\displaystyle p}$. Let ${\displaystyle u}$, ${\displaystyle v}$, and ${\displaystyle h}$ be uniformly random generatorsof${\displaystyle G}$. Let ${\displaystyle a,b}$ be uniformly random elements of ${\displaystyle \{1,\,2,\,\dots ,\,p-1\}}$. Define a distribution

${\displaystyle D_{1}=(u,\,v,\,h,\,u^{a},\,v^{b},\,h^{a+b}).}$

Let ${\displaystyle \eta }$ be another uniformly random element of ${\displaystyle G}$. Define another distribution

${\displaystyle D_{2}=(u,\,v,\,h,\,u^{a},\,v^{b},\,\eta ).}$

The Decision Linear assumption states that ${\displaystyle D_{1}}$ and ${\displaystyle D_{2}}$ are computationally indistinguishable.

Boneh, Boyen, and Shacham define a public key encryption scheme by analogy to ElGamal encryption.^[1] In this scheme, a public key is the generators ${\displaystyle u,v,h}$. The private key is two exponents such that ${\displaystyle u^{x}=v^{y}=h}$. Encryption combines a message ${\displaystyle m\in G}$ with the public key to create a ciphertext

${\displaystyle c:=(c_{1},\,c_{2},\,c_{3})=(u^{a},\,v^{b},\,m\cdot h^{a+b})}$.

To decrypt the ciphertext, the private key can be used to compute

${\displaystyle m':=c_{3}\cdot (c_{1}^{x}\cdot c_{2}^{y})^{-1}.}$

To check that this encryption scheme is correct, i.e. ${\displaystyle m'=m}$ when both parties follow the protocol, note that

${\displaystyle m'=c_{3}\cdot (c_{1}^{x}\cdot c_{2}^{y})^{-1}=m\cdot h^{a+b}\cdot ((u^{a})^{x}\cdot (v^{b})^{y})^{-1}=m\cdot h^{a+b}\cdot ((u^{x})^{a}\cdot (v^{y})^{b})^{-1}.}$

Then using the fact that ${\displaystyle u^{x}=v^{y}=h}$ yields

${\displaystyle m'=m\cdot h^{a+b}\cdot (h^{a}\cdot h^{b})^{-1}=m\cdot (h^{a+b}\cdot h^{-a-b})=m.}$

Further, this scheme is IND-CPA secure assuming that the DLIN assumption holds.

Boneh, Boyen, and Shacham also use DLIN in a scheme for group signatures. ^[1] The signatures are called "short group signatures" because, with a standard security level, they can be represented in only 250 bytes.

Their protocol first uses linear encryption in order to define a special type of zero-knowledge proof. Then the Fiat–Shamir heuristic is applied to transform the proof system into a digital signature. They prove this signature fulfills the additional requirements of unforgeability, anonymity, and traceability required of a group signature.

Their proof relies on not only the DLIN assumption but also another assumption called the ${\displaystyle q}$-strong Diffie-Hellman assumption. It is proven in the random oracle model.

Since its definition in 2004, the Decision Linear assumption has seen a variety of other applications. These include the construction of a pseudorandom function that generalizes the Naor-Reingold construction, ^[3]anattribute-based encryption scheme, ^[4] and a special class of non-interactive zero-knowledge proofs. ^[5]