Jine Tang, Zhenhua Wang, Yunchuan Sun, Chu Du, Zhangbing Zhou
In the Internet of Things, smart things communicate with each other, and sensed data are aggregated and queried for satisfying certain requests of end-users. Wireless sensor networks (WSN) is a key enabling technique for achieving the vision of the Internet of Things. In real applications of WSN, such as environmental monitoring and vehicle tracking, they may require to launch spatial queries for collecting sensory data to achieve certain goals. Among various queries, top-k query is one of the fundamental operators in many applications of wireless sensor networks for phenomenon monitoring. In this paper we propose a novel top-k query algorithm based on hierarchical grid index and range filter of head nodes, which is able to filter out as many unlikely top-k results as early as possible within the network from transmission.
{"title":"Top-k Queries in Wireless Sensor Networks Leveraging Hierarchical Grid Index","authors":"Jine Tang, Zhenhua Wang, Yunchuan Sun, Chu Du, Zhangbing Zhou","doi":"10.1109/IMIS.2014.51","DOIUrl":"https://doi.org/10.1109/IMIS.2014.51","url":null,"abstract":"In the Internet of Things, smart things communicate with each other, and sensed data are aggregated and queried for satisfying certain requests of end-users. Wireless sensor networks (WSN) is a key enabling technique for achieving the vision of the Internet of Things. In real applications of WSN, such as environmental monitoring and vehicle tracking, they may require to launch spatial queries for collecting sensory data to achieve certain goals. Among various queries, top-k query is one of the fundamental operators in many applications of wireless sensor networks for phenomenon monitoring. In this paper we propose a novel top-k query algorithm based on hierarchical grid index and range filter of head nodes, which is able to filter out as many unlikely top-k results as early as possible within the network from transmission.","PeriodicalId":345694,"journal":{"name":"2014 Eighth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134293450","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A ubiquitous health care system takes the advantage of portability and small size of wireless sensor nodes to provide remote health care services and real-time health monitoring. A gateway is needed to mediate communication between a local sensor network and remote data consumers. In current implementations of ubiquitous health care systems ZigBee-based sensors are often used to gather vital sign data such as ECG and heart rate. Transferring large quantities of vital signs from a ZigBee-based sensor sink node to a gateway requires a bandwidth that ZigBee alone is not able to provide. In this paper, we present a technical design of a Bluetooth-based mobile gateway that bridges the connection between a sensor network and the Internet. Our system enables ubiquitous health care experience while providing a platform for additional services such as alarms, notifications and analysis of medical data. Controlling a sensor network from the mobile gateway is also possible. The flexible design of the system does not restrict its usage only to health care services - the gateway can be configured to work with any kind of sensor network having a sink node with Bluetooth capability.
{"title":"Mobile Gateway for Ubiquitous Health Care System Using ZigBee and Bluetooth","authors":"T. Laine, Chaewoo Lee, Haejung Suk","doi":"10.1109/IMIS.2014.17","DOIUrl":"https://doi.org/10.1109/IMIS.2014.17","url":null,"abstract":"A ubiquitous health care system takes the advantage of portability and small size of wireless sensor nodes to provide remote health care services and real-time health monitoring. A gateway is needed to mediate communication between a local sensor network and remote data consumers. In current implementations of ubiquitous health care systems ZigBee-based sensors are often used to gather vital sign data such as ECG and heart rate. Transferring large quantities of vital signs from a ZigBee-based sensor sink node to a gateway requires a bandwidth that ZigBee alone is not able to provide. In this paper, we present a technical design of a Bluetooth-based mobile gateway that bridges the connection between a sensor network and the Internet. Our system enables ubiquitous health care experience while providing a platform for additional services such as alarms, notifications and analysis of medical data. Controlling a sensor network from the mobile gateway is also possible. The flexible design of the system does not restrict its usage only to health care services - the gateway can be configured to work with any kind of sensor network having a sink node with Bluetooth capability.","PeriodicalId":345694,"journal":{"name":"2014 Eighth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130938665","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Despite various proposed Medium Access Control (MAC) approaches, efficient medium access in VANET remains a significant challenge for the broadcast of safety messages. A key contributing factor, especially with the high node mobility apparent in VANET, is the hidden terminal problem. Since the hidden terminal problem is fundamentally a problem of lack of awareness, increased neighbor awareness at the MAC layer has been suggested as a possible solution. An increased awareness of neighboring nodes' slot allocation requires an increased number of TDMA slots. In this paper we evaluate the impact of TDMA frame size in a neighbor-aware MAC. An analytical model is developed to support the simulation results, based on a geographical probability of RF interference and the slot allocation scheme used in the TDMA MAC. The results show that the packet delivery increases with increased TDMA frame size to support neighbor awareness, as the probability for packet collisions decrease. Packet delivery decreases with increases in neighbor count, since more nodes cause packet collisions. The receiver throughput initially increases as TDMA frame size is increased, since more transmission opportunities occur, and packet delivery increases. However, when the TDMA increases beyond an optimal, throughput is adversely affected by underutilization. Despite the decrease in packet delivery ratio, receiver throughput is higher for more nodes.
{"title":"The Effect of TDMA Frame Size and the Hidden Node Problem on the Performance of a Neighbor-Aware VANET MAC","authors":"M. J. Booysen, G. Rooyen","doi":"10.1109/IMIS.2014.40","DOIUrl":"https://doi.org/10.1109/IMIS.2014.40","url":null,"abstract":"Despite various proposed Medium Access Control (MAC) approaches, efficient medium access in VANET remains a significant challenge for the broadcast of safety messages. A key contributing factor, especially with the high node mobility apparent in VANET, is the hidden terminal problem. Since the hidden terminal problem is fundamentally a problem of lack of awareness, increased neighbor awareness at the MAC layer has been suggested as a possible solution. An increased awareness of neighboring nodes' slot allocation requires an increased number of TDMA slots. In this paper we evaluate the impact of TDMA frame size in a neighbor-aware MAC. An analytical model is developed to support the simulation results, based on a geographical probability of RF interference and the slot allocation scheme used in the TDMA MAC. The results show that the packet delivery increases with increased TDMA frame size to support neighbor awareness, as the probability for packet collisions decrease. Packet delivery decreases with increases in neighbor count, since more nodes cause packet collisions. The receiver throughput initially increases as TDMA frame size is increased, since more transmission opportunities occur, and packet delivery increases. However, when the TDMA increases beyond an optimal, throughput is adversely affected by underutilization. Despite the decrease in packet delivery ratio, receiver throughput is higher for more nodes.","PeriodicalId":345694,"journal":{"name":"2014 Eighth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132688128","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The ultimate goal of this research is to provide n-gram data that is specialized for scholarly utilization. To this end, this paper outlines the construction of a scholarly n-gram through the processing of large text documents. Many researchers, especially non-native English language speakers, find it difficult to construct sentences and paragraphs with appropriate and disambiguated words. One of the methods that can assist them is the provision of n-gram data. A representative n-gram known as Web 1T 5-Gram Version 1, which was constructed by processing virtually all documents retrieved using Google, already exists. However, this data contain unfocused word recommendations, therefore, they are not suitable. Consequently, we are constructing a scholarly n-gram. In this paper, we demonstrate the efficiency of n-gram using Web 1T unigram and introduce and discuss the specifics of our research plan related to scholarly n-gram.
本研究的最终目标是提供专门用于学术用途的n-gram数据。为此，本文概述了通过处理大型文本文档构建学术n-gram的方法。许多研究人员，特别是非英语母语人士，发现很难用合适的和消歧的词来构建句子和段落。可以帮助他们的方法之一是提供n-gram数据。一个具有代表性的n-gram(称为Web 1t5 -gram Version 1)已经存在，它是通过处理使用谷歌检索的几乎所有文档而构建的。然而，这些数据包含了没有重点的单词推荐，因此，它们不适合。因此，我们正在构建一个学术性的n图。在本文中，我们使用Web 1T图展示了n-gram的效率，并介绍和讨论了我们与学术n-gram相关的研究计划的细节。
{"title":"Construction of Scholarly n-Gram from Huge Text Data","authors":"Myunggwon Hwang, Ha-neul Yeom, Mi-Nyeong Hwang, Hanmin Jung","doi":"10.1109/IMIS.2014.4","DOIUrl":"https://doi.org/10.1109/IMIS.2014.4","url":null,"abstract":"The ultimate goal of this research is to provide n-gram data that is specialized for scholarly utilization. To this end, this paper outlines the construction of a scholarly n-gram through the processing of large text documents. Many researchers, especially non-native English language speakers, find it difficult to construct sentences and paragraphs with appropriate and disambiguated words. One of the methods that can assist them is the provision of n-gram data. A representative n-gram known as Web 1T 5-Gram Version 1, which was constructed by processing virtually all documents retrieved using Google, already exists. However, this data contain unfocused word recommendations, therefore, they are not suitable. Consequently, we are constructing a scholarly n-gram. In this paper, we demonstrate the efficiency of n-gram using Web 1T unigram and introduce and discuss the specifics of our research plan related to scholarly n-gram.","PeriodicalId":345694,"journal":{"name":"2014 Eighth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131842281","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Wireless MESH Network (WMN) has become an important technology and has been widely deployed due to its simplicity, low cost, and flexibility in implementation. WMN is a wireless multi-hop network, therefore the privacy protection is extremely important. This paper proposes an anonymous access authentication scheme based on the proxy group signature. The scheme completely protects user's privacy during authentication. In order to improve the efficiency of our scheme, we further adopt certificate-based signature mechanism to design a highly efficient handover authentication protocol. Finally, we show the security analysis of our scheme.
{"title":"Anonymous Authentication Scheme Based on Proxy Group Signature for Wireless MESH Network","authors":"Tianhan Gao, Qidi Miao, Nan Guo","doi":"10.1109/IMIS.2014.78","DOIUrl":"https://doi.org/10.1109/IMIS.2014.78","url":null,"abstract":"Wireless MESH Network (WMN) has become an important technology and has been widely deployed due to its simplicity, low cost, and flexibility in implementation. WMN is a wireless multi-hop network, therefore the privacy protection is extremely important. This paper proposes an anonymous access authentication scheme based on the proxy group signature. The scheme completely protects user's privacy during authentication. In order to improve the efficiency of our scheme, we further adopt certificate-based signature mechanism to design a highly efficient handover authentication protocol. Finally, we show the security analysis of our scheme.","PeriodicalId":345694,"journal":{"name":"2014 Eighth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115198051","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, the effective bandwidth expansion schemes are investigated to improve the performance of energy efficiency for the Orthogonal Frequency Division Multiplexing (OFDM) wireless communication systems. Three Improved Energy Efficient Bandwidth Expansion (IEEBE) schemes are proposed to assign the available system bandwidth for users. With an exhausted method, the energy efficient Bandwidth Expansion Coefficient (BEC) can be found. Thus the energy efficient performance of the IEEBE is superior to the Same Bandwidth Expansion (SBE). Three methods of pairs, grouping and two-layer grouping are proposed to effectively find the BEC for users based on IEEBE. Simulation results show that two-layer grouping (TLG) outperforms the other two methods and improves Energy Reduction Factor (ERF) by 8.9 % to the SBE.
{"title":"Energy Efficiency of Bandwidth Expansion Algorithms in Wireless Communication Systems","authors":"Yung-Fa Huang, Chuan-Bi Lin, Chia-Chi Chang, Che-Hao Li, Ching-Mu Chen","doi":"10.1109/IMIS.2014.67","DOIUrl":"https://doi.org/10.1109/IMIS.2014.67","url":null,"abstract":"In this paper, the effective bandwidth expansion schemes are investigated to improve the performance of energy efficiency for the Orthogonal Frequency Division Multiplexing (OFDM) wireless communication systems. Three Improved Energy Efficient Bandwidth Expansion (IEEBE) schemes are proposed to assign the available system bandwidth for users. With an exhausted method, the energy efficient Bandwidth Expansion Coefficient (BEC) can be found. Thus the energy efficient performance of the IEEBE is superior to the Same Bandwidth Expansion (SBE). Three methods of pairs, grouping and two-layer grouping are proposed to effectively find the BEC for users based on IEEBE. Simulation results show that two-layer grouping (TLG) outperforms the other two methods and improves Energy Reduction Factor (ERF) by 8.9 % to the SBE.","PeriodicalId":345694,"journal":{"name":"2014 Eighth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115714729","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Daniel Gutiérrez-Reina, S. T. Marín, E. Asimakopoulou, N. Bessis, F. Barrero
Broadcast schemes play an important role in the performance of mobile ad hoc networks. They are widely used as a dissemination mechanism and as a part of the discovery phase of routing protocols. The simple flooding algorithm is the usual mechanism employed in mobile ad hoc networks, but it has been demonstrated its inefficiency in congested scenarios due to the high number of collisions and contentions. These problems can be partially alleviated by using a probabilistic broadcast scheme in which every node forwards the incoming packets according to a certain forwarding probability. In this paper we use the simple probabilistic broadcast scheme to evaluate the effects of congestion on the performance of broadcasting in ad hoc networks through a mediation analysis. We hypothesize that the congestion mediates in the relationship between the forwarding probability (independent variable) and the output metric (dependent variable). The simulation results prove the existence of the mediating effects and how such effects are counterbalanced depending on the target use of the probabilistic broadcast scheme.
{"title":"A Dissemination Analysis in Mobile Wireless Ad Hoc Networks Using Probabilistic Broadcast","authors":"Daniel Gutiérrez-Reina, S. T. Marín, E. Asimakopoulou, N. Bessis, F. Barrero","doi":"10.1109/IMIS.2014.15","DOIUrl":"https://doi.org/10.1109/IMIS.2014.15","url":null,"abstract":"Broadcast schemes play an important role in the performance of mobile ad hoc networks. They are widely used as a dissemination mechanism and as a part of the discovery phase of routing protocols. The simple flooding algorithm is the usual mechanism employed in mobile ad hoc networks, but it has been demonstrated its inefficiency in congested scenarios due to the high number of collisions and contentions. These problems can be partially alleviated by using a probabilistic broadcast scheme in which every node forwards the incoming packets according to a certain forwarding probability. In this paper we use the simple probabilistic broadcast scheme to evaluate the effects of congestion on the performance of broadcasting in ad hoc networks through a mediation analysis. We hypothesize that the congestion mediates in the relationship between the forwarding probability (independent variable) and the output metric (dependent variable). The simulation results prove the existence of the mediating effects and how such effects are counterbalanced depending on the target use of the probabilistic broadcast scheme.","PeriodicalId":345694,"journal":{"name":"2014 Eighth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"430 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115933157","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mebae Ushida, Yuji Yamaoka, Kouichi Itoh, H. Tsuda
The development of the GPS has recently increased the demand for the beneficial services from the mobile users' location data. If the location data are collected from various organizations, more beneficial services will be provided. However, the organizations are never able to share their location data, because they must avoid their users' privacy information leakage. Therefore, we propose a new system that (i) organizations transform the location data into secured location data that protects users' location information and send them to the third party called mediator and, (ii) the mediator provides beneficial services from the secured location data. We focus on the service that the mediator finds users who are nearby from all users over multiple organizations (one-to-many private location matching). In previous techniques, a user can judge another user (e.g., his/her friend) is close or not by using the secured location data (one-to-one private location matching). We also propose a new scheme that the mediator can perform one-to-many matching without users' privacy information leakage. Our scheme is the first result that realizes one-to-many matching without users' huge task and leaking their privacy.
{"title":"New Privacy-Preserving Method for Matching Location Data","authors":"Mebae Ushida, Yuji Yamaoka, Kouichi Itoh, H. Tsuda","doi":"10.1109/IMIS.2014.89","DOIUrl":"https://doi.org/10.1109/IMIS.2014.89","url":null,"abstract":"The development of the GPS has recently increased the demand for the beneficial services from the mobile users' location data. If the location data are collected from various organizations, more beneficial services will be provided. However, the organizations are never able to share their location data, because they must avoid their users' privacy information leakage. Therefore, we propose a new system that (i) organizations transform the location data into secured location data that protects users' location information and send them to the third party called mediator and, (ii) the mediator provides beneficial services from the secured location data. We focus on the service that the mediator finds users who are nearby from all users over multiple organizations (one-to-many private location matching). In previous techniques, a user can judge another user (e.g., his/her friend) is close or not by using the secured location data (one-to-one private location matching). We also propose a new scheme that the mediator can perform one-to-many matching without users' privacy information leakage. Our scheme is the first result that realizes one-to-many matching without users' huge task and leaking their privacy.","PeriodicalId":345694,"journal":{"name":"2014 Eighth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115976934","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
An Internet web application is comprised of dynamic web objects that are updated from time to time. This work investigates the placement of web objects over multi-tier servers in which each host can obtain an object by constructing locally, or via a network transmission from the upstream host. The cost of maintaining web objects consists of the computing resources used for constructing objects as well as the network bandwidth used for object delivery. This paper develops a new efficient algorithm to find the minimum cost object placement strategy.
Internet web应用程序由不时更新的动态web对象组成。这项工作研究了web对象在多层服务器上的放置，其中每个主机可以通过本地构建或通过来自上游主机的网络传输获得对象。维护web对象的成本包括用于构造对象的计算资源和用于对象交付的网络带宽。本文提出了一种新的高效算法来寻找成本最小的目标放置策略。
{"title":"Minimum Cost Content Object Reconstruction in Multi-tier Servers","authors":"Lung-Pin Chen, Chih-Wei Hsieh, Fang-Yie Leu","doi":"10.1109/IMIS.2014.76","DOIUrl":"https://doi.org/10.1109/IMIS.2014.76","url":null,"abstract":"An Internet web application is comprised of dynamic web objects that are updated from time to time. This work investigates the placement of web objects over multi-tier servers in which each host can obtain an object by constructing locally, or via a network transmission from the upstream host. The cost of maintaining web objects consists of the computing resources used for constructing objects as well as the network bandwidth used for object delivery. This paper develops a new efficient algorithm to find the minimum cost object placement strategy.","PeriodicalId":345694,"journal":{"name":"2014 Eighth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114646131","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
During the execution of a business process users need to be authenticated by multiple component service providers, while their identities need to be shared and propagated across multi-domain in a privacy-preserving fashion. An anonymous credential-based identity verification scheme is proposed to address privacy issue. Users establish trust relationship with the federation by running the enrollment protocol, which is based on zero-knowledge proof of a set of committed attributes. The IdP cannot learn identity-related information about the user. Anonymous credentials issued by the IdP allow users to selectively disclose attributes as required and prove them in an untraceable and unlinkable way, where the IdP cannot trace the showing of credential and component service providers cannot address multiple transactions to the same user even if they collude either. With the proposed attributes proof protocols, users can prove AND and OR relation over multiple attributes, and interval and inequality relation over a single attribute as well.
{"title":"Anonymous Credential-Based Privacy-Preserving Identity Verification for Business Processes","authors":"Nan Guo, Y. Jin, Kangbin Yim","doi":"10.1109/IMIS.2014.80","DOIUrl":"https://doi.org/10.1109/IMIS.2014.80","url":null,"abstract":"During the execution of a business process users need to be authenticated by multiple component service providers, while their identities need to be shared and propagated across multi-domain in a privacy-preserving fashion. An anonymous credential-based identity verification scheme is proposed to address privacy issue. Users establish trust relationship with the federation by running the enrollment protocol, which is based on zero-knowledge proof of a set of committed attributes. The IdP cannot learn identity-related information about the user. Anonymous credentials issued by the IdP allow users to selectively disclose attributes as required and prove them in an untraceable and unlinkable way, where the IdP cannot trace the showing of credential and component service providers cannot address multiple transactions to the same user even if they collude either. With the proposed attributes proof protocols, users can prove AND and OR relation over multiple attributes, and interval and inequality relation over a single attribute as well.","PeriodicalId":345694,"journal":{"name":"2014 Eighth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123596544","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：