Benaloh cryptosystem

The Benaloh Cryptosystem is an extension of the Goldwasser-Micali cryptosystem (GM) created in 1985 by Josh (Cohen) Benaloh. The main improvement of the Benaloh Cryptosystem over GM is that longer blocks of data can be encrypted at once, whereas in GM each bit is encrypted individually.^[1]^[2]^[3]

Scheme Definition

Like many public key cryptosystems, this scheme works in the group $(\mathbb {Z} /n\mathbb {Z} )^{*}$ where n is a product of two large primes. This scheme is homomorphic and hence malleable.

Key Generation

Given block size r, a public/private key pair is generated as follows:

Choose large primes p and q such that $r\vert (p-1),\operatorname {gcd} (r,(p-1)/r)=1,$ and $\operatorname {gcd} (r,(q-1))=1$
Set $n=pq,\phi =(p-1)(q-1)$
Choose $y\in \mathbb {Z} _{n}^{*}$ such that $y^{\phi /r}\not \equiv 1\mod n$ .

Note: If r is composite, it was pointed out by Fousse et al. in 2011^[4] that the above conditions (i.e., those stated in the original paper) are insufficient to guarantee correct decryption, i.e., to guarantee that

D(E(m))=m

in all cases (as should be the case). To address this, the authors propose the following check: let

r=p_{1}p_{2}\dots p_{k}

be the prime factorization of r. Choose

y\in \mathbb {Z} _{n}^{*}

such that for each factor

p_{i}

, it is the case that

y^{\phi /p_{i}}\neq 1\mod n

.

Set $x=y^{\phi /r}\mod n$

The public key is then $y,n$ , and the private key is $\phi ,x$ .

Message Encryption

To encrypt message $m\in \mathbb {Z} _{r}$ :

Choose a random $u\in \mathbb {Z} _{n}^{*}$
Set $E_{r}(m)=y^{m}u^{r}\mod n$

Message Decryption

To decrypt a ciphertext $c\in \mathbb {Z} _{n}^{*}$ :

Compute $a=c^{\phi /r}\mod n$
Output $m=\log _{x}(a)$ , i.e., find m such that $x^{m}\equiv a\mod n$

To understand decryption, first notice that for any $m\in \mathbb {Z} _{r}$ and $u\in \mathbb {Z} _{n}^{*}$ we have:

a=(c)^{\phi /r}\equiv (y^{m}u^{r})^{\phi /r}\equiv (y^{m})^{\phi /r}(u^{r})^{\phi /r}\equiv (y^{\phi /r})^{m}(u)^{\phi }\equiv (x)^{m}(u)^{0}\equiv x^{m}\mod n

To recover m from a, we take the discrete log of a base x. If r is small, we can recover m by an exhaustive search, i.e. checking if $x^{i}\equiv a\mod n$ for all $0\dots (r-1)$ . For larger values of r, the Baby-step giant-step algorithm can be used to recover m in $O({\sqrt {r}})$ time and space.

Security

The security of this scheme rests on the Higher residuosity problem, specifically, given z,r and n where the factorization of n is unknown, it is computationally infeasible to determine whether z is an rth residue mod n, i.e. if there exists an x such that $z\equiv x^{r}\mod n$ .

References

^ Cohen, Josh; Ficsher, Michael (1985). A Robust and Verifiable Cryptographically Secure Election Scheme (PDF). Proceedings of 26th IEEE Symposium on Foundations of Computer Science. pp. 372–382.
^ Benaloh, Josh (1987). Verifiable Secret-Ballot Elections (Ph.D. thesis) (PDF).
^ Benaloh, Josh (1994). Dense Probabilistic Encryption (PDF). Workshop on Selected Areas of Cryptography. pp. 120–128.
^ Fousse, Laurent; Lafourcade, Pascal; Alnuaimi, Mohamed (2011). "Benaloh's Dense Probabilistic Encryption Revisited". arXiv:1008.2991 [cs.CR].

[COHEN-FISCHER-1] Cohen, Josh; Ficsher, Michael (1985). A Robust and Verifiable Cryptographically Secure Election Scheme (PDF). Proceedings of 26th IEEE Symposium on Foundations of Computer Science. pp. 372–382.

[BENALOH-THESIS-2] Benaloh, Josh (1987). Verifiable Secret-Ballot Elections (Ph.D. thesis) (PDF).

[BENALOH-DPE-3] Benaloh, Josh (1994). Dense Probabilistic Encryption (PDF). Workshop on Selected Areas of Cryptography. pp. 120–128.

[ACRYPT-4] Fousse, Laurent; Lafourcade, Pascal; Alnuaimi, Mohamed (2011). "Benaloh's Dense Probabilistic Encryption Revisited". arXiv:1008.2991 [cs.CR].

[1]

[2]

[3]

[4]

Fahrer / Team für die Suche eingeben: