Lattice Based Universal Re-encryption for Mixnet

Kunwar Singh¹⁺, C. Pandu Rangan², and A.K.Banerjee¹

¹National Institute of Technology Tiruchirappalli, India
{kunwar, banerjee}@nitt.edu

²Indian Institute of Technology Madras
Chennai, Tamil Nadu, India
rangan@cse.iitm.ac.in

Abstract

Mixnet (Mix Network) was proposed by David Chaum for anonymous communication in 1981. A mixnet is a multistage system that accepts encrypted messages under the public keys of all intermediate mixnet nodes and outputs randomly permuted corresponding plaintexts. In 2004, Golle et al  presented a new primitive called universal re-encryption based on the Elgamal public key cryptosystem. Universal mixnet based on universal re-encryption takes the input as encrypted messages under the public key of the recipients not the public key of the universal mixnet so it dispenses with the complexities of the key generation, key distribution and key maintenance. In Eurocrypt 2010 Gentry, Halevi and Vaikunthanathan presented a cryptosystem which is an additive homomorphic and a multiplicative homomorphic for only one multiple. In this paper we present universal re-encryption scheme under learning with error (LWE) assumption based on

Keywords: Lattice, Learning With Error (LWE), Universal Re-encryption

+: Corresponding author: Kunwar Singh

Computer Science and Engineering Department, National Institute of Technology,
Trichy, Tiruchirappalli-15, Tamilnadu, India,
Tel: +91-43125013212, Web: http://www.nitt.edu/home/academics/departments/cse/faculty/kunwar/

Journal of Internet Services and Information Security (JISIS), 4(1): 1-11, February  2014 [pdf]