Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
Privacy homomorphisms for social networks with private relationships
Computer Networks: The International Journal of Computer and Telecommunications Networking
Resisting structural re-identification in anonymized social networks
Proceedings of the VLDB Endowment
Collective privacy management in social networks
Proceedings of the 18th international conference on World wide web
Persona: an online social network with user-defined privacy
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Oblivious transfer with access control
Proceedings of the 16th ACM conference on Computer and communications security
A privacy-preserving scheme for online social networks with efficient revocation
INFOCOM'10 Proceedings of the 29th conference on Information communications
A Practical Attack to De-anonymize Social Network Users
SP '10 Proceedings of the 2010 IEEE Symposium on Security and Privacy
An analysis of social network-based Sybil defenses
Proceedings of the ACM SIGCOMM 2010 conference
| Hi-index | 0.00 |
In this paper, we construct a system which can hide users' identity when they visit untrusted third party storage sites. We also define a fine-grained access control policy for the data owner to freely define who can access the record. That is to say, the data owner divide his friends into several groups and issues them corresponding credentials for accessing his data. However, he can adds a friend at any time in a revocation list (RL) so that that friend could not access the data owner's data any more even if he has credentials. We theoretically prove the security of our protocols, and evaluate the performance of our protocols through simulations.