2015
DOI: 10.1155/2015/963628
|View full text |Cite
|
Sign up to set email alerts
|

Lattice Based Mix Network for Location Privacy in Mobile System

Abstract: In 1981, David Chaum proposed a cryptographic primitive for privacy calledmix 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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
1
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 19 publications
0
1
0
Order By: Relevance
“…Using the latticebased commitment scheme [4] makes the proof fully post-quantum. Additionally, there have been some proposals for a lattice-based universal re-encryption for mix-nets [30] but none of them give a proof of a shuffle.…”
Section: Previous Workmentioning
confidence: 99%
“…Using the latticebased commitment scheme [4] makes the proof fully post-quantum. Additionally, there have been some proposals for a lattice-based universal re-encryption for mix-nets [30] but none of them give a proof of a shuffle.…”
Section: Previous Workmentioning
confidence: 99%
“…To the best of our knowledge, the concept of using mix-nets for lattice-based cryptography is very new in the research literature, and as such, there are not many proposed schemes. Until 2017 there have been proposals for a lattice-based universal re-encryption for mix-nets [140,141] but none of them proposes a proof of a shuffle, which is essential for verifiable protocols.…”
Section: Related Workmentioning
confidence: 99%
“…Using the lattice-based commitment scheme [20] makes the proof fully post-quantum. Additionally, there have been some proposals for a lattice-based universal re-encryption for mix-nets [141] but none of them give a proof of a shuffle.…”
Section: Related Workmentioning
confidence: 99%