Lattice Based Mix Network for Location Privacy in Mobile SystemReportar como inadecuado




Lattice Based Mix Network for Location Privacy in Mobile System - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Mobile Information Systems - Volume 2015 2015, Article ID 963628, 9 pages -

Research Article

Computer Science and Engineering Department, NIT Trichy, Tiruchirappalli 620015, India

Computer Science and Engineering Department, IIT Madras, Chennai 600036, India

Mathematics Department, NIT Trichy, Tiruchirappalli 620015, India

Received 1 September 2014; Accepted 1 September 2014

Academic Editor: Ilsun You

Copyright © 2015 Kunwar Singh et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

In 1981, David Chaum proposed a cryptographic primitive for privacy called mix network Mixnet. A mixnet is cryptographic construction that establishes anonymous communication channel through a set of servers. In 2004, Golle et al. proposed a new cryptographic primitive called universal reencryption which takes the input as encrypted messages under the public key of the recipients not the public key of the universal mixnet. In Eurocrypt 2010, Gentry, Halevi, and Vaikunthanathan presented a cryptosystem which is an additive homomorphic and a multiplicative homomorphic for only one multiplication. In MIST 2013, Singh et al. presented a lattice based universal reencryption scheme under learning with error LWE assumption. In this paper, we have improved Singh et al.’s scheme using Fairbrother’s idea. LWE is a lattice hard problem for which till now there is no polynomial time quantum algorithm. Wiangsripanawan et al. proposed a protocol for location privacy in mobile system using universal reencryption whose security is reducible to Decision Diffie-Hellman assumption. Once quantum computer becomes a reality, universal reencryption can be broken in polynomial time by Shor’s algorithm. In postquantum cryptography, our scheme can replace universal reencryption scheme used in Wiangsripanawan et al. scheme for location privacy in mobile system.





Autor: Kunwar Singh, C. Pandu Rangan, and A. K. Banerjee

Fuente: https://www.hindawi.com/



DESCARGAR PDF




Documentos relacionados