Visible to the public Control Theory and Privacy, 2014, Part 2

SoS Newsletter- Advanced Book Block


SoS Logo

Control Theory and Privacy, 2014

Part 2

In the Science of Security, control theory offers methods and approaches to potentially solve hard problems. The research work presented here specifically addresses issues in privacy. The work was presented in 2014.

Le Ny, J.; Mohammady, M., “Differentially Private MIMO Filtering for Event Streams and Spatio-Temporal Monitoring,” Decision and Control (CDC), 2014 IEEE 53rd Annual Conference on, vol., no., pp. 2148, 2153, 15-17 Dec. 2014. doi:10.1109/CDC.2014.7039716
Abstract: Many large-scale systems such as intelligent transportation systems, smart grids or smart buildings collect data about the activities of their users to optimize their operations. In a typical scenario, signals originate from many sensors capturing events involving these users, and several statistics of interest need to be continuously published in real-time. Moreover, in order to encourage user participation, privacy issues need to be taken into consideration. This paper considers the problem of providing differential privacy guarantees for such multi-input multi-output systems operating continuously. We show in particular how to construct various extensions of the zero-forcing equalization mechanism, which we previously proposed for single-input single-output systems. We also describe an application to privately monitoring and forecasting occupancy in a building equipped with a dense network of motion detection sensors, which is useful for example to control its HVAC system.
Keywords: MIMO systems; filtering theory; sensors; HVAC system; differential privacy; differentially private MIMO filtering; event streams; intelligent transportation systems; large-scale systems; motion detection sensors; single-input single-output systems; smart buildings; smart grids; spatio temporal monitoring; zero-forcing equalization mechanism; Buildings; MIMO; Monitoring; Noise; Privacy; Sensitivity; Sensors (ID#: 15-5758)


Distl, B.; Hossmann, T., “Privacy in Opportunistic Network Contact Graphs,” A World of Wireless, Mobile and Multimedia Networks (WoWMoM), 2014 IEEE 15th International Symposium on, vol., no., pp. 1, 3, 19-19 June 2014. doi:10.1109/WoWMoM.2014.6919020
Abstract: Opportunistic networks are formed by people carrying mobile devices with wireless capabilities. When in mutual transmission range, the nodes of such networks use device-to-device communication to automatically exchange data, without requiring fixed infrastructure. To solve challenging opportunistic networking problems like routing, nodes exchange information about whom they have met in the past and form a contact graph, which encodes the social structure of past meetings. This contact graph is then used to assign a utility to each node (e.g., based on their centrality), thereby defining a ranking of the nodes' values for carrying a message. However, while being a useful tool, the contact graph represents a privacy risk to the users, as it allows an attacker to learn about social links. In this paper, we investigate the trade-off of privacy and utility in the contact graph. By transforming the graph through adding and removing edges, we are able to control the amount of link privacy. The evaluation of a greedy approach shows that it maintains the node ranking very well, even if many links are changed.
Keywords: data privacy; graph theory; mobile computing; smart phones; telecommunication network routing; link privacy; node ranking; opportunistic network contact graphs; opportunistic network routing; past meeting recording; privacy risk; social structure recording; Approximation algorithms; Correlation; Greedy algorithms; Measurement; Mobile handsets; Privacy; Routing (ID#: 15-5759)


Han Vinck, A.J.; Jivanyan, A.; Winzen, J., “Gaussian Fuzzy Commitment,” Information Theory and Its Applications (ISITA), 2014 International Symposium on, vol., no., pp. 571, 574, 26-29 Oct. 2014. doi:(not provided)
Abstract: We discuss the protection of Gaussian biometric templates. We first introduce the Juels-Wattenberg for binary biometrics, where the binary biometrics are a result of hard-quantized Gaussian biometrics. The Juels-Wattenberg scheme adds a random binary code word to the biometric for privacy reasons and to allow errors in the biometric at authentication. We modify the Juels-Wattenberg scheme in such a way that we do not have to quantize the biometrics. We investigate and compare the performance of both approaches.
Keywords: Gaussian processes; authorisation; biometrics (access control); data privacy; fuzzy set theory; Gaussian biometric template protection; Gaussian fuzzy commitment; Juels-Wattenberg scheme; binary biometrics; hard-quantized Gaussian biometrics; random binary code word; Australia; Authentication; Decoding; Error analysis; Error correction codes; Noise; Vectors (ID#: 15-5760)


Prasad, M.; Chou, K.P.; Saxena, A.; Kawrtiya, O.P.; Li, D.L.; Lin, C.T., “Collaborative Fuzzy Rule Learning for Mamdani Type Fuzzy Inference System with Mapping of Cluster Centers,” Computational Intelligence in Control and Automation (CICA), 2014 IEEE Symposium on, vol., no., pp. 1, 6, 9-12 Dec. 2014. doi:10.1109/CICA.2014.7013227
Abstract: This paper demonstrates a novel model for Mamdani type fuzzy inference system by using the knowledge learning ability of collaborative fuzzy clustering and rule learning capability of FCM. The collaboration process finds consistency between different datasets, these datasets can be generated at various places or same place with diverse environment containing common features space and bring together to find common features within them. For any kind of collaboration or integration of datasets, there is a need of keeping privacy and security at some level. By using collaboration process, it helps fuzzy inference system to define the accurate numbers of rules for structure learning and keeps the performance of system at satisfactory level while preserving the privacy and security of given datasets.
Keywords: fuzzy reasoning; fuzzy set theory; learning (artificial intelligence); pattern clustering; Mamdani type fuzzy inference system; cluster centers mapping; collaboration process; collaborative fuzzy clustering; collaborative fuzzy rule learning; knowledge learning ability; Brain modeling; Collaboration; Data models; Fuzzy logic; Knowledge based systems; Mathematical model; Prototypes; collaboration process; collaborative fuzzy clustering (CFC); fuzzy c-means (FCM); fuzzy inference system; privacy and security; structure learning (ID#: 15-5761)


Ignatenko, T.; Willems, F.M.J., “Privacy-Leakage Codes for Biometric Authentication Systems,” Acoustics, Speech and Signal Processing (ICASSP), 2014 IEEE International Conference on, vol., no., pp. 1601, 1605, 4-9 May 2014. doi:10.1109/ICASSP.2014.6853868
Abstract: In biometric privacy-preserving authentication systems that are based on key-binding, two terminals observe two correlated biometric sequences. The first terminal selects a secret key, which is independent of the biometric data, binds this secret key to the observed biometric sequence and communicates it to the second terminal by sending a public message. This message should only contain a negligible amount of information about the secret key, but also leak as little as possible about the biometric data. Current approaches to realize such biometric systems use fuzzy commitment with codes that, given a secret-key rate, can only achieve the corresponding privacy-leakage rate equal to one minus this secret-key rate. However, the results in Willems and Ignatenko [2009] indicate that lower privacy leakage can be achieved if vector quantization is used at the encoder. In this paper we study the use of convolutional and turbo codes applied in fuzzy commitment and its modifications that realize this.
Keywords: biometrics (access control); convolutional codes; correlation theory; data privacy; fuzzy set theory; message authentication; sequential codes; turbo codes; vector quantisation; biometric authentication system; biometric privacy preserving authentication system; biometric sequence; convolutional codes; correlated biometric sequences; encoder; fuzzy commitment; privacy leakage codes; privacy leakage rate; public message sending; secret key rate; turbo codes; vector quantization; Authentication; Biometrics (access control); Convolutional codes; Decoding; Privacy; Quantization (signal); Signal to noise ratio; BCH codes; Biometric authentication; convolutional codes; privacy; turbo codes (ID#: 15-5762)


Al-Abdulkarim, L.; Molin, E.; Lukszo, Z.; Fens, T., “Acceptance of ICT-Intensive Socio-Technical Infrastructure Systems: Smart Metering Case in the Netherlands,” Networking, Sensing and Control (ICNSC), 2014 IEEE 11th International Conference on, vol., no., pp. 399, 404, 7-9 April 2014. doi:10.1109/ICNSC.2014.6819659
Abstract: There are several initiatives worldwide to deploy SMs (SM). SM systems offer services aimed at achieving many goals beyond metering electricity consumption of households. Despite the advantages gained by SMs, there are serious issues that may lead to the system's inability to reach its goals. One obstacle, which can lead to social rejection of SMs, is perceived security and privacy violations of consumers' information. This poses a significant threat to a successful rollout and operation of the system as consumers represent a cornerstone in the fulfillment of goals such as energy efficiency and savings, by their active interaction with SMs. To investigate consumers' perception of SMs, theories and models from the technology acceptance literature can be used for understanding consumers' behaviors, and exploring possible factors that can have a significant impact on consumers' acceptance and usage of a SM. In this paper, a hybrid and extended model of a two well-known technology acceptance theories is presented. These theories are: the Unified Theory of Acceptance and Usage of Technology- UTAUT, and Innovation Diffusion Theory- IDT. The hybrid model is further extended with acceptance determinants derived from the Smart metering case in the Dutch context. The model aims to investigate determinants that can shed light on consumers' perception and acceptance of SM.
Keywords: consumer behaviour; domestic appliances; electricity supply industry; energy conservation; innovation management; power consumption; power system security; smart meters; Dutch context; ICT-intensive socio-technical infrastructure system; IDT; Netherlands; SM systems; UTAUT; acceptance determinants; consumer acceptance; consumer behaviors; consumer information; consumer perception; consumer usage; electricity consumption metering; energy efficiency; energy savings; households; innovation diffusion theory; privacy violations; security violations; smart metering case; social rejection; technology acceptance literature; technology acceptance theories; unified theory of acceptance and usage of technology; Reliability; System-on-chip; Critical infrastructures; Information security and privacy; Smart metering; Social acceptance; Socio-technical systems (ID#: 15-5763)


Chi Chen; Chaogang Wang; Tengfei Yang; Dongdai Lin; Song Wang; Jiankun Hu, “Optional Multi-Biometric Cryptosystem Based on Fuzzy Extractor,” Fuzzy Systems and Knowledge Discovery (FSKD), 2014 11th International Conference on, vol., no., pp. 989, 994, 19-21 Aug. 2014. doi:10.1109/FSKD.2014.6980974
Abstract: Following the wide use of smart devices, biometric cryptosystem is used to protect users' privacy data. However, biometric cryptosystem is rarely used in the scenario of mobile cloud, because the biometric sensors are different on various devices. In this paper, an optional multi-biometric cryptosystem based on fuzzy extractor and secret share technology is proposed. Each of the enrolled biometric modality generates a feature vector, and then the feature vector is put into a fuzzy extractor to get a stable codeword, namely a bit-string. All the codewords are used to bind a random key based on a secret share method, and the key can be used to encrypt users' privacy data. During the verification phase, part of the enrolled biometric modalities are enough to recover the random key. Therefore, the proposed scheme can provide a user the same biometric key on different devices. In addition, experiment on a virtual multi-biometric database shows that the novel concept of optional multi-biometric cryptosystem is better than the corresponding uni-biometric cryptosystem both in matching accuracy and key entropy.
Keywords: biometrics (access control); cloud computing; cryptography; entropy; fuzzy set theory; mobile computing; vectors; bit-string; codewords; feature vector; fuzzy extractor; key entropy; mobile cloud; optional multibiometric cryptosystem; smart devices; users privacy data; Accuracy; Cryptography; Databases; Feature extraction; Fingerprint recognition; Iris recognition; cryptosystem; fuzzy extractor; key generation; mobile cloud; multi-biometric; secret share (ID#: 15-5764)


Barber, R.F.; Duchi, J., “Privacy: A Few Definitional Aspects and Consequences for Minimax Mean-Squared Error,” Decision and Control (CDC), 2014 IEEE 53rd Annual Conference on, vol., no., pp. 1365, 1369, 15-17 Dec. 2014. doi:10.1109/CDC.2014.7039572
Abstract: We explore several definitions of “privacy” in statistical estimation and data analysis. We present and review definitions that attempt to capture what, intuitively, it should mean to limit disclosures from the output of a statistical estimation task, providing minimax upper and lower bounds on mean squared error for estimation problems under several common (and some new) definitions of privacy.
Keywords: data analysis; data privacy; estimation theory; mean square error methods; minimax techniques; statistical analysis; data analysis; data privacy; minimax mean-squared error; statistical estimation; Computer science; Convergence; Data analysis; Data privacy; Estimation; Privacy; Testing (ID#: 15-5765)


Singh, K.; Jian Zhong; Batten, L.; Bertok, P., “A Solution for Privacy-Preserving, Remote Access to Sensitive Data,” Information Theory and its Applications (ISITA), 2014 International Symposium on, vol., no., pp. 309, 313, 26-29 Oct. 2014. doi:(not provided)
Abstract: Sharing data containing sensitive information, such as medical records, always has privacy and security implications. In situations such as health environments, accurate individual data needs to be provided while at the same time, mass data release for medical research may also be required. This paper outlines a solution for maintaining the privacy of data released en masse in a controlled manner as well as for providing secure access to the original data for authorized users. Our solution maintains privacy in a more efficient manner than do previous solutions.
Keywords: data privacy; data sharing; remote access; sensitive data; sensitive information; Computer architecture; Data privacy; Encryption; Privacy; Protocols (ID#: 15-5766)


Pradhan, P.; Venkitasubramaniam, P., “Under the Radar Attacks in Dynamical Systems: Adversarial Privacy Utility Tradeoffs,” Information Theory Workshop (ITW), 2014 IEEE, vol., no., pp. 242, 246, 2-5 Nov. 2014. doi:10.1109/ITW.2014.6970829
Abstract: Cyber physical systems which integrate physical system dynamics with digital cyber infrastructure are envisioned to transform our core infrastructural frameworks such as the smart electricity grid, transportation networks and advanced manufacturing. This integration however exposes the physical system functioning to the security vulnerabilities of cyber communication. Both scientific studies and real world examples have demonstrated the impact of data injection attacks on state estimation mechanisms on the smart electricity grid. In this work, an abstract theoretical framework is proposed to study data injection/modification attacks on Markov modeled dynamical systems from the perspective of an adversary. Typical data injection attacks focus on one shot attacks by adversary and the non-detectability of such attacks under static assumptions. In this work we study dynamic data injection attacks where the adversary is capable of modifying a temporal sequence of data and the physical controller is equipped with prior statistical knowledge about the data arrival process to detect the presence of an adversary. The goal of the adversary is to modify the arrivals to minimize a utility function of the controller while minimizing the detectability of his presence as measured by the KL divergence between the prior and posterior distribution of the arriving data. Adversarial policies and tradeoffs between utility and detectability are characterized analytically using linearly solvable control optimization.
Keywords: Markov processes; radar; telecommunication security; Markov modeled dynamical systems; advanced manufacturing; adversarial privacy utility tradeoffs; core infrastructural frameworks; cyber communication; cyber physical systems; data arrival process; data injection attacks; digital cyber infrastructure; dynamic data injection attacks; dynamical systems; physical system dynamics; radar attacks; security vulnerabilities; smart electricity grid; state estimation mechanisms; temporal sequence; transportation networks; Markov processes; Mathematical model; Power system dynamics; Privacy; Process control; Smart grids; State estimation (ID#: 15-5767)


Jiyun Yao; Venkitasubramaniam, P., “The Privacy Analysis of Battery Control Mechanisms in Demand Response: Revealing State Approach and Rate Distortion Bounds,” Decision and Control (CDC), 2014 IEEE 53rd Annual Conference on, vol., no., pp. 1377, 1382, 15-17 Dec. 2014. doi:10.1109/CDC.2014.7039594
Abstract: Perfect knowledge of a user's power consumption profile by a utility is a violation of privacy and can be detrimental to the successful implementation of demand response systems. It has been shown that an in-home energy storage system which provides a viable means to achieve the cost savings of instantaneous electricity pricing without inconvenience can also be used to maintain the privacy of a user's power profile. The optimization of the tradeoff between privacy, as measured by Shannon entropy, and cost savings that can be provided by a finite capacity battery with zero tolerance for delay is known to be equivalent to a Partially Observable Markov Decision Process with non linear belief dependent rewards- solutions to such systems suffer from high computational complexity. In this paper, we propose a “revealing state” approach to enable computation of a class of battery control policies that aim to maximize the achievable privacy of in-home demands. In addition, a rate-distortion approach is presented to derive upper bounds on the privacy-cost savings tradeoff of battery control policies. These bounds are derived for a discrete model, where demand and price follow i.i.d uniform distributions. Numerical results show that the derived bounds are quite close to each other demonstrating the efficacy of the proposed class of strategies.
Keywords: data privacy; demand side management; energy storage; rate distortion theory; secondary cells; stochastic systems; battery control mechanisms; demand response; in-home demands; in-home energy storage system; privacy analysis; privacy-cost savings tradeoff; rate distortion bounds; rate-distortion approach; revealing state approach; stochastic control; uniform distributions; Batteries; Electricity; Entropy; Optimization; Privacy; Upper bound; Demand Response; Entropy; Privacy; Random Walk; Scheduling; Storage; Utility (ID#: 15-5768)


Pequito, S.; Kar, S.; Sundaram, S.; Aguiar, A.P., “Design of Communication Networks for Distributed Computation with Privacy Guarantees,” Decision and Control (CDC), 2014 IEEE 53rd Annual Conference on, vol., no., pp. 1370, 1376, 15-17 Dec. 2014. doi:10.1109/CDC.2014.7039593
Abstract: In this paper we address a communication network design problem for distributed computation with privacy guarantees. More precisely, given a possible communication graph between different agents in a network, the objective is to design a protocol, by proper selection of the weights in the dynamics induced by the communication graph, such that 1) weighted average consensus of the initial states of all the agents will be reached; and 2) there are privacy guarantees, where each agent is not able to retrieve the initial states of non-neighbor agents, with the exception of a small subset of agents (that will be precisely characterized). In this paper, we assume that the network is cooperative, i.e., each agent is passive in the sense that it executes the protocol correctly and does not provide incorrect information to its neighbors, but may try to retrieve the initial states of non-neighbor agents. Furthermore, we assume that each agent knows the communication protocol.
Keywords: cooperative communication; graph theory; multi-agent systems; protocols; communication graph; communication network design; communication protocol; cooperative network; distributed computation; network agent; nonneighbor agent; privacy guarantee; weighted average consensus; Bipartite graph; Computational modeling; Computers; Educational institutions; Privacy; Protocols; Tin (ID#: 15-5769)


Papadopoulos, A.; Czap, L.; Fragouli, C., “Secret Message Capacity of a Line Network,” Communication, Control, and Computing (Allerton), 2014 52nd Annual Allerton Conference on, vol., no., pp. 1341, 1348, Sept. 30 2014 - Oct. 3 2014. doi:10.1109/ALLERTON.2014.7028611
Abstract: We investigate the problem of information theoretically secure communication in a line network with erasure channels and state feedback. We consider a spectrum of cases for the private randomness that intermediate nodes can generate, ranging from having intermediate nodes generate unlimited private randomness, to having intermediate nodes generate no private randomness, and all cases in between. We characterize the secret message capacity when either only one of the channels is eavesdropped or all of the channels are eavesdropped, and we develop polynomial time algorithms that achieve these capacities. We also give an outer bound for the case where an arbitrary number of channels is eavesdropped. Our work is the first to characterize the secrecy capacity of a network of arbitrary size, with imperfect channels and feedback.
Keywords: channel capacity; computational complexity; data privacy; network theory (graphs); state feedback; telecommunication security; erasure channels; imperfect channels; information theoretically secure communication problem; intermediate nodes; line network; polynomial time algorithms; private randomness; secret message capacity; state feedback; Automatic repeat request; Random variables; Receivers; Relays; Security; State feedback; Vectors (ID#: 15-5770)


Bounagui, Y.; Hafiddi, H.; Mezrioui, A., “Challenges for IT Based Cloud Computing Governance,” Intelligent Systems: Theories and Applications (SITA-14), 2014 9th International Conference on, vol., no., pp. 1, 8, 7-8 May 2014. doi:10.1109/SITA.2014.6847289
Abstract: For some years now, the concept of Cloud Computing (CC) is presented as the new revolution of information technology. It presents not only a technical innovation for better IT system flexibility, improvement of working methods and cost control, but also a new economic model, built around the concept of IT Services that are identifiable, classifiable and countable for end users, who can benefit by paying for use without having to make huge investments. In this paper, we show that despite these advantages, the implementation of such a concept has an impact on the enterprise stakeholders (IT Direction, Business Direction, Suppliers Direction, etc.). Many aspects must be managed differently from traditional systems. Availability, security, privacy and compliance are just some of the aspects that must be monitored and managed more effectively. Thus, the IT based CC governance is a necessity in terms of defining good management practices, especially because there is a lack of an adapted Governance Framework. The current IT governance practices/standards (ITIL, COBIT, ISO2700x, etc.) still have many limitations: they are far from covering an “end-to-end” governance; they are difficult to use and to maintain and have many overlapping points. It becomes mandatory for companies to address these challenges and control the capabilities offered by the CC, develop cloud oriented policies that reflect their exact needs and to have a flexible, coherent and global IT based CC Governance Framework.
Keywords: business data processing; cloud computing; information technology; CC; IT based cloud computing governance; IT direction; IT services; IT system flexibility; adapted governance framework; business direction; cost control; economic model; enterprise stakeholders; information technology; suppliers direction; technical innovation; Automation; Computational modeling; Organizations; Reliability; Software; Standards organizations; Cloud Computing; Framework ; IT Governance; Security; Standards (ID#: 15-5771)


Tiits, M.; Kalvet, T.; Mikko, K.-L., “Social Acceptance of ePassports,” Biometrics Special Interest Group (BIOSIG), 2014 International Conference of the, vol, no., pp. 1, 6, 10-12 Sept. 2014. doi:(not provided)
Abstract: Using large-scale web survey in six countries we study the societal readiness and acceptance of specific technology options in relation to the potential next generation of ePassports. We find that the public has only limited knowledge of the electronic data and functions ePassports include, and often have no clear opinion on various potential uses for ePassports and related personal data. Still, the public expects from ePassports improvements in protection from document forgery, accuracy and reliability of the identification of persons, and protection from identity theft. The main risks the public associates with ePassports includes the possible use of personal information for purposes other than those initially stated, and covert surveillance. Compared to earlier studies, our research shows that issues of possible privacy invasion and abuse of information are much more perceived by the public. There is a weak correlation between a persons' level of knowledge about ePassports and their willingness to accept the use of advanced biometrics, such as fingerprints or eye iris images, in different identity management and identity checking scenarios. Furthermore, the public becomes more undecided about ePassport applications as we move from the basic state of the art towards more advanced biometric technologies in various scenarios. The successful pathway to greater acceptability of the use of advanced biometrics in ePassports should start from the introduction of perceivably high-benefit and low-risk applications. As the public awareness is low, citizens' belief in government benevolence, i.e. the belief that the government acts in citizens' best interest, comes out as an important factor in the overall context.
Keywords: biometrics (access control); data privacy; government data processing; social aspects of automation; biometrics; ePassports social acceptance; government benevolence; identity checking scenarios; identity management; information abuse; privacy invasion; Context; Fingerprint recognition; Government; Iris recognition; Logic gates; Security; ePassports; social acceptance; unified theory of acceptance and use of technology (ID#: 15-5773)


Xi Chen; Luping Zheng; Zengli Liu; Jiashu Zhang, “Privacy-Preserving Biometrics Using Matrix Random Low-Rank Approximation Approach,” Biometrics and Security Technologies (ISBAST), 2014 International Symposium on, vol., no., pp. 6, 12, 26-27 Aug. 2014. doi:10.1109/ISBAST.2014.7013085
Abstract: In this paper, we propose a matrix random low-rank approximation (MRLRA) approach to generate cancelable biometric templates for privacy-preserving. MRLRA constructs a random low-rank matrix to approximate the hybridization of biometric feature and a random matrix. Theoretically analysis shows the distance between one cancelable low-rank biometric template by MRLRA and its original template is very small, which results to the verification and authentication performance by MRLRA is near that of original templates. Cancelable biometric templates by MRLRA conquer the weakness of random projection based cancelable biometric templates, in which the performance will deteriorate much under the same tokens. Experiments have verified that (i) cancelable biometric templates by MRLRA are sensitive to the user-specific tokens which are used for constructing the random matrix in MRLRA; (ii) MRLRA can reduce the noise of biometric templates; (iii) Even under the condition of same tokens, the performance of cancelable biometric templates by MRLRA doesn't deteriorate much.
Keywords: approximation theory; biometrics (access control); data privacy; formal verification; matrix algebra; MRLRA approach; authentication; hybridization; matrix random low-rank approximation approach; privacy-preserving biometrics; verification; Approximation methods; Authentication; Biometrics (access control); Databases; Face; Feature extraction; Vectors; Cancelable biometric templates; Matrix random low-rank approximation; Privacy-preserving (ID#: 15-5774)


Zheng Yan; Mingjun Wang; Peng Zhang, “A Scheme to Secure Instant Community Data Access Based on Trust and Contexts,” Computer and Information Technology (CIT), 2014 IEEE International Conference on, vol., no., pp. 646, 651, 11-13 Sept. 2014. doi:10.1109/CIT.2014.136
Abstract: Mobile Ad Hoc Networks provides a generic platform for instant social networking (ISN), such as instant community (IC). For a crucial talk in an instant community, it is important to set up a secure communication channel among trustworthy members in order to avoid malicious eavesdropping or narrow down member communication scope. Previous work hasn't yet considered how to control social communication data access based on trust and other attributes and suffered from a weakness in terms of complexity. In this paper, we propose a scheme to secure instant community data access based on trust levels, contexts and time clock in a fine-grained control manner by applying Attribute-Based Encryption. Any community member can select other members with at least a minimum level of trust for secure ISN communications. The advantages, security and performance of the proposed scheme are evaluated and justified through extensive analysis, security proof and implementation. The results show the efficiency and effectiveness of our scheme.
Keywords: cryptography; mobile ad hoc networks; mobile computing; social networking (online); trusted computing; ISN; attribute-based encryption; data access security; instant social networking; mobile ad hoc networks; trust levels; Access control; Communities; Complexity theory; Encryption; Integrated circuits; Privacy preserving; data mining; data perturbation; k-anonymity (ID#: 15-5775)


Articles listed on these pages have been found on publicly available internet pages and are cited with links to those pages. Some of the information included herein has been reprinted with permission from the authors or data repositories. Direct any requests via Email to for removal of the links or modifications to specific citations. Please include the ID# of the specific citation in your correspondence.