A Game Theoretic Approach to Optimize Identity Exposure in Pervasive Computing Environments

Author(s):  
Feng W. Zhu ◽  
Sandra Carpenter ◽  
Wei Zhu ◽  
Matt Mutka
2010 ◽  
Vol 4 (4) ◽  
pp. 1-20
Author(s):  
Feng W. Zhu ◽  
Sandra Carpenter ◽  
Wei Zhu ◽  
Matt Mutka

In pervasive computing environments, personal information is typically expressed in digital forms. Daily activities and personal preferences with regard to pervasive computing applications are easily associated with personal identities. Privacy protection is a serious challenge. The fundamental problem is the lack of a mechanism to help people expose appropriate amounts of their identity information when accessing pervasive computing applications. In this paper, the authors propose the Hierarchical Identity model, which enables the expression of one’s identity information ranging from precise detail to vague identity information. The authors model privacy exposure as an extensive game. By finding subgame perfect equilibria in the game, the approach achieves optimal exposure. It finds the most general identity information that a user should expose and which the service provider would accept. The authors’ experiments show that their models can reduce unnecessary identity exposure effectively.


Cyber Crime ◽  
2013 ◽  
pp. 375-394
Author(s):  
Feng W. Zhu ◽  
Sandra Carpenter ◽  
Wei Zhu ◽  
Matt Mutka

In pervasive computing environments, personal information is typically expressed in digital forms. Daily activities and personal preferences with regard to pervasive computing applications are easily associated with personal identities. Privacy protection is a serious challenge. The fundamental problem is the lack of a mechanism to help people expose appropriate amounts of their identity information when accessing pervasive computing applications. In this paper, the authors propose the Hierarchical Identity model, which enables the expression of one’s identity information ranging from precise detail to vague identity information. The authors model privacy exposure as an extensive game. By finding subgame perfect equilibria in the game, the approach achieves optimal exposure. It finds the most general identity information that a user should expose and which the service provider would accept. The authors’ experiments show that their models can reduce unnecessary identity exposure effectively.


1982 ◽  
Vol 55 (3) ◽  
pp. 367 ◽  
Author(s):  
Carl Alan Batlin ◽  
Susan Hinko

Sign in / Sign up

Export Citation Format

Share Document