In Pursuit of Privacy: An Introduction to Anonymization Technologies
Journal Title: Current Trends in Computer Sciences & Applications - Year 2018, Vol 1, Issue 1
Abstract
Privacy in the age of pervasive computing and networking is a very hard topic to fully grasp. Any serious attempt at discussing it must take many different angles into account. User interactions grow richer month after month, and due to Big Data techniques, more information about each individual is known to third parties than to the person in question themselves; this is illustrated in the concept of inverse privacy [4]. What is a user to do to keep at least a basic expectation of privacy? Due to the pervasive analysis, a user can only expect their actions to remain private by becoming anonymous-By incorporating into their everyday activities Privacy Enhancement Technologies (PETs) that avoid each of their actions to be linked into a wide-encompassing profile. Anonymity is often achieved via confusion and blending in the crowd: If a person wants their messages to be concealed, they usually first need to identify and use an active network carrying traffic in which to hide; implementations starting with Chaum’s mix networks [2] expressly assume an existing level of traffic needed for anonymous messages to be hidden. Mix networks are based on public key cryptography, first delineated in 1976 [3]. In a nutshell, each message is encrypted with the public key of several intermediaries, forming a route that must be followed in order to reach its destination. That is, having users A, B, C, D and E, each of whom has an asymmetric key pair {KA, K-1A}, {KB, K-1B} etc. and denoting encryption and decryption of a clear-text message M to a secret-containing cyphertext S respectively as S=Enc(M; KA) (which anybody can do, as the public key KA is known by every actor) and M=Dec(S; K-1A) (which only A can perform, as only this actor has knowledge of K-1A).
Authors and Affiliations
Gunnar Wolf
Keywords
Related Articles
- EP ID EP576902
- DOI 10.32474/CTCSA.2018.01.000103
- Views 98
- Downloads 0
Comparison Between Second Zagreb Eccentricity Index and Eccentric Connectivity Index of Graphs
Throughout this paper we only consider the finite, undirected, simple and connected graphs. The degree of v ∊ V(G), denoted by degG(v), is the number of vertices in G adjacent to v. For any two vertices u; v in a graph G...
Mitigating Disaster using Secure Threshold-Cloud Architecture
There are many risks in moving data into public cloud environments, along with an increasing threat around large-scale data leakage during cloud outages. This work aims to apply secret sharing methods as used in cryptogr...
An Image Secret Sharing Method Based on Shamir Secret Sharing
This paper presents an image secret sharing method based on Shamir secret sharing method. We use the matrix projection to construct secret sharing scheme. A secret image to be divided as n image shares such that: i) Any...
Self-Payment Fraud Detection on Automated Teller Machine
Over the past decade the amount of transactions and reported frauds on Automated Teller Machines (ATM) has significantly increased. Various types of frauds have been reported around misusing ATM cards and many methods ha...
Internet of Things and Privacy
The Internet of Things is a concept that has been heard quite a lot in recent years, a concept that slowly emerged, but over time it has experienced a booming growth that was then adopted not only by giant IT companies,...