首页 > 最新文献

2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)最新文献

英文 中文
Privacy Preserving Queries on Directed Graph 有向图上的隐私保护查询
Sara Ramezanian, Tommi Meskanen, Valtteri Niemi
In this work, a trust relation determines whether a certain user (at source-host) has permission to access another user (at target-host) by utilising an authentication key with unique fingerprint F. These trust relations can be interpreted as a directed graph, where nodes are user-host pairs and edges are fingerprints. We study the problem of constructing a privacy preserving trust relation data structure. Moreover, we design and prototype a querying mechanism for this data structure and show that it is feasible in practice. We validate our design by utilising real world data.
在这项工作中,信任关系通过使用具有唯一指纹f的认证密钥来确定某个用户(在源主机上)是否有权访问另一个用户(在目标主机上)。这些信任关系可以被解释为一个有向图,其中节点是用户-主机对,边是指纹。研究了一个保护隐私的信任关系数据结构的构造问题。在此基础上,设计并原型化了该数据结构的查询机制,并在实践中证明了该机制的可行性。我们利用真实世界的数据来验证我们的设计。
{"title":"Privacy Preserving Queries on Directed Graph","authors":"Sara Ramezanian, Tommi Meskanen, Valtteri Niemi","doi":"10.1109/NTMS.2018.8328714","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328714","url":null,"abstract":"In this work, a trust relation determines whether a certain user (at source-host) has permission to access another user (at target-host) by utilising an authentication key with unique fingerprint F. These trust relations can be interpreted as a directed graph, where nodes are user-host pairs and edges are fingerprints. We study the problem of constructing a privacy preserving trust relation data structure. Moreover, we design and prototype a querying mechanism for this data structure and show that it is feasible in practice. We validate our design by utilising real world data.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132007002","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}
引用次数: 2
A New Dynamic Trust Model for "On Cloud" Federated Identity Management 一种新的“云上”联邦身份管理动态信任模型
Keltoum Bendiab, S. Shiaeles, Samia Boucherkha
With the proliferation of Cloud-based services, Federated Identity Management (FIM) has gained considerable attention in recent years. It is considered as a promising approach to facilitate secure resource sharing between collaborating partners in the Cloud. However, current FIM frameworks such as OpenID, SAML, Liberty Alliance, Shibboleth and WS-Federation do not define a suitable trust model to allow dynamic and agile federation establishment. Hence, they cannot be deployed in dynamic and open environments like Cloud Computing. In this paper, we address this issue by presenting a new dynamic trust model that fulfils Cloud requirements. The proposed model introduces the theory of Fuzzy Cognitive Maps (FCM) into modelling and evaluating unknown entities trustworthiness in FIM systems.
随着基于云的服务的激增,联邦身份管理(FIM)近年来获得了相当大的关注。它被认为是一种很有前途的方法,可以促进云中的协作伙伴之间的安全资源共享。然而,目前的FIM框架(如OpenID、SAML、Liberty Alliance、Shibboleth和WS-Federation)没有定义一个合适的信任模型来允许动态和敏捷的联邦建立。因此,它们不能部署在像云计算这样的动态开放环境中。在本文中,我们通过提出一个满足云需求的新的动态信任模型来解决这个问题。该模型将模糊认知图(FCM)理论引入到FIM系统中未知实体可信度的建模和评估中。
{"title":"A New Dynamic Trust Model for \"On Cloud\" Federated Identity Management","authors":"Keltoum Bendiab, S. Shiaeles, Samia Boucherkha","doi":"10.1109/NTMS.2018.8328673","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328673","url":null,"abstract":"With the proliferation of Cloud-based services, Federated Identity Management (FIM) has gained considerable attention in recent years. It is considered as a promising approach to facilitate secure resource sharing between collaborating partners in the Cloud. However, current FIM frameworks such as OpenID, SAML, Liberty Alliance, Shibboleth and WS-Federation do not define a suitable trust model to allow dynamic and agile federation establishment. Hence, they cannot be deployed in dynamic and open environments like Cloud Computing. In this paper, we address this issue by presenting a new dynamic trust model that fulfils Cloud requirements. The proposed model introduces the theory of Fuzzy Cognitive Maps (FCM) into modelling and evaluating unknown entities trustworthiness in FIM systems.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"225 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116575168","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}
引用次数: 7
"Speak, Friend, and Enter" - Secure, Spoken One-Time Password Authentication “说话,朋友,和输入”-安全,口头一次性密码认证
Outi-Marja Latvala, Chengyuan Peng, P. Honkamaa, Kimmo Halunen
User authentication is a long-standing problem in need of a comprehensive solution. As technology progresses towards more ubiquitous connectivity and digital services, there is a need for new methods that are usable in these new contexts. One direction of progress has been in virtual and augmented reality technologies. Augmented reality provides tools also for better user authentication. We have developed a system, where user authentication can be done with the help of augmented reality, visual cryptography and speech recognition. This type of authentication can be used in untrusted environments and in scenarios, where the hands of the user are not available for inputting a password with some keyboard.
用户身份验证是一个长期存在的问题,需要一个全面的解决方案。随着技术向更加无处不在的连接和数字服务发展,需要在这些新环境中可用的新方法。其中一个进步方向是虚拟现实和增强现实技术。增强现实还为更好的用户身份验证提供了工具。我们已经开发了一个系统,在这个系统中,用户身份验证可以通过增强现实、视觉加密和语音识别来完成。这种类型的身份验证可以在不受信任的环境中使用,也可以在用户无法用键盘输入密码的情况下使用。
{"title":"\"Speak, Friend, and Enter\" - Secure, Spoken One-Time Password Authentication","authors":"Outi-Marja Latvala, Chengyuan Peng, P. Honkamaa, Kimmo Halunen","doi":"10.1109/NTMS.2018.8328719","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328719","url":null,"abstract":"User authentication is a long-standing problem in need of a comprehensive solution. As technology progresses towards more ubiquitous connectivity and digital services, there is a need for new methods that are usable in these new contexts. One direction of progress has been in virtual and augmented reality technologies. Augmented reality provides tools also for better user authentication. We have developed a system, where user authentication can be done with the help of augmented reality, visual cryptography and speech recognition. This type of authentication can be used in untrusted environments and in scenarios, where the hands of the user are not available for inputting a password with some keyboard.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121600602","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}
引用次数: 3
Workplace Capacity Design Using the Minimum Dominating Set in Server Migration Services 服务器迁移服务中使用最小支配集的工作场所容量设计
Y. Fukushima, I. Goda, T. Murase, T. Yokohira
A server migration service (SMS) has been proposed as a means of improving communication QoS of network application (NW-Apps) operated on Infrastructure as a Service (IaaS)-type cloud services. In SMS, computers called workplaces (WPs) are distributed across the network, and a server-side application (server) of a NW-App can migrate among the WPs in order to improve the communication QoS of NW-Apps. In this paper, we tackle a WP capacity design problem where we determine where WPs should be placed within a NW, and what capacity they should have. We propose two methods for the problem. Method 1 seeks to place higher capacity WPs at locations where more servers are likely to stay. Method 2 tries to position WPs such that the required level of communication QoS for NW-Apps can be satisfied with at least one WP at any location in the NW. This is accomplished by formulating the WP capacity design problem as a minimum dominating set (MDS) problem and solving it.
服务器迁移服务(SMS)已被提出作为一种改善在基础设施即服务(IaaS)类型的云服务上运行的网络应用程序(NW-Apps)的通信QoS的手段。在SMS中,被称为工作场所(WPs)的计算机分布在整个网络中,NW-App的服务器端应用程序(server)可以在WPs之间迁移,以提高NW-App的通信QoS。在本文中,我们解决了一个WP容量设计问题,我们确定WP应该放置在NW中的位置,以及它们应该具有的容量。我们针对这个问题提出了两种方法。方法1寻求在可能驻留更多服务器的位置放置更大容量的wp。方法2尝试定位WP,使NW应用程序所需的通信QoS水平可以在NW的任何位置至少有一个WP来满足。这是通过将WP容量设计问题表述为最小支配集(MDS)问题并对其进行求解来实现的。
{"title":"Workplace Capacity Design Using the Minimum Dominating Set in Server Migration Services","authors":"Y. Fukushima, I. Goda, T. Murase, T. Yokohira","doi":"10.1109/NTMS.2018.8328725","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328725","url":null,"abstract":"A server migration service (SMS) has been proposed as a means of improving communication QoS of network application (NW-Apps) operated on Infrastructure as a Service (IaaS)-type cloud services. In SMS, computers called workplaces (WPs) are distributed across the network, and a server-side application (server) of a NW-App can migrate among the WPs in order to improve the communication QoS of NW-Apps. In this paper, we tackle a WP capacity design problem where we determine where WPs should be placed within a NW, and what capacity they should have. We propose two methods for the problem. Method 1 seeks to place higher capacity WPs at locations where more servers are likely to stay. Method 2 tries to position WPs such that the required level of communication QoS for NW-Apps can be satisfied with at least one WP at any location in the NW. This is accomplished by formulating the WP capacity design problem as a minimum dominating set (MDS) problem and solving it.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127702529","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}
引用次数: 0
Using Dynamic Occupancy Patterns for Improved Presence Detection in Intelligent Buildings 利用动态占用模式改进智能建筑的存在检测
C. Papatsimpa, J. Linnartz
Presence detection is used in occupancy-based control to dynamically adjust energy-related appliances in smart buildings. Yet, practical applications typically suffer from high sensor unreliability. In our previous work, we suggested a Hidden Markov Model (HMM) for fusing information from multiple sources to better estimate the user state (presence/absence). We now extend this model and exploit information on the time-dependency of the probability of occupancy according to the time of the day. People generally have a typical working schedule, that is, occupants in an office arrive and leave every day at almost the same time. In this approach, we use our prior knowledge on office occupancy profiles to develop a time-dependent (in-homogeneous) HMM. Judging from our experiments, the algorithm shows improved performance, also, in a real-world test set-up where user presence and sensors error may not exactly follow our idealized model assumptions.
存在检测用于基于占用的控制,以动态调整智能建筑中的能源相关设备。然而,实际应用通常受到传感器高不可靠性的影响。在我们之前的工作中,我们提出了一种隐马尔可夫模型(HMM),用于融合来自多个源的信息,以更好地估计用户状态(存在/不存在)。我们现在扩展了这个模型,并根据一天中的时间利用占用概率的时间依赖性信息。人们通常有一个典型的工作时间表,也就是说,办公室里的人每天几乎在同一时间到达和离开。在这种方法中,我们使用我们对办公室占用概况的先验知识来开发一个时间相关(非同质)HMM。从我们的实验来看,该算法也显示出改进的性能,在现实世界的测试设置中,用户在场和传感器误差可能不完全符合我们的理想模型假设。
{"title":"Using Dynamic Occupancy Patterns for Improved Presence Detection in Intelligent Buildings","authors":"C. Papatsimpa, J. Linnartz","doi":"10.1109/NTMS.2018.8328723","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328723","url":null,"abstract":"Presence detection is used in occupancy-based control to dynamically adjust energy-related appliances in smart buildings. Yet, practical applications typically suffer from high sensor unreliability. In our previous work, we suggested a Hidden Markov Model (HMM) for fusing information from multiple sources to better estimate the user state (presence/absence). We now extend this model and exploit information on the time-dependency of the probability of occupancy according to the time of the day. People generally have a typical working schedule, that is, occupants in an office arrive and leave every day at almost the same time. In this approach, we use our prior knowledge on office occupancy profiles to develop a time-dependent (in-homogeneous) HMM. Judging from our experiments, the algorithm shows improved performance, also, in a real-world test set-up where user presence and sensors error may not exactly follow our idealized model assumptions.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134048864","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}
引用次数: 4
Quantitative Description of Internal Activity on the Ethereum Public Blockchain 以太坊公有区块链内部活动的定量描述
Andra Anoaica, H. Levard
One of the most popular platform based on blockchain technology is Ethereum. Internal activity on this public blockchain is analyzed both from a quantitative and qualitative point of view. In a first part, it is shown that the creation of the Ethereum Alliance consortium has been a game changer in the use of the technology. In a second part, the network robustness against attacks is investigated from a graph point of view, as well as the distribution of internal activity among users. Addresses of great influence were identified, and allowed to formulate conjectures on the current usage of this technology.
基于区块链技术的最流行的平台之一是以太坊。从定量和定性的角度分析了这个公共区块链的内部活动。在第一部分中,证明了以太坊联盟联盟的创建已经改变了该技术的使用。在第二部分中,从图的角度研究了网络对攻击的鲁棒性,以及用户之间内部活动的分布。确定了具有重大影响的地址,并允许对该技术的当前使用情况进行推测。
{"title":"Quantitative Description of Internal Activity on the Ethereum Public Blockchain","authors":"Andra Anoaica, H. Levard","doi":"10.1109/NTMS.2018.8328741","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328741","url":null,"abstract":"One of the most popular platform based on blockchain technology is Ethereum. Internal activity on this public blockchain is analyzed both from a quantitative and qualitative point of view. In a first part, it is shown that the creation of the Ethereum Alliance consortium has been a game changer in the use of the technology. In a second part, the network robustness against attacks is investigated from a graph point of view, as well as the distribution of internal activity among users. Addresses of great influence were identified, and allowed to formulate conjectures on the current usage of this technology.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127248256","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}
引用次数: 19
Formal Verification of Smart Contracts Based on Users and Blockchain Behaviors Models 基于用户和区块链行为模型的智能合约形式化验证
Tesnim Abdellatif, Kei-Léo Brousmiche
Blockchain technology has attracted increasing attention in recent years. One reason of this new trend is the introduction of on-chain smart contracts enabling the implementation of decentralized applications in trust-less environments. Along with its adoption, attacks exploiting smart contract vulnerabilities are inevitably growing. To counter these attacks and avoid breaches, several approaches have been explored such as documenting vulnerabilities or model checking using formal verification. However, these approaches fail to capture the Blockchain and users behavior properties. In this paper, we propose a novel formal modeling approach to verify a smart contract behavior in its execution environment. We apply this formalism on a concrete smart contract example and analyze its breaches with a statical model checking approach.
近年来,区块链技术越来越受到人们的关注。这种新趋势的一个原因是引入了链上智能合约,使在无信任环境中实现分散的应用程序成为可能。随着智能合约的采用,利用智能合约漏洞的攻击不可避免地会增加。为了对抗这些攻击并避免破坏,已经探索了几种方法,例如使用正式验证记录漏洞或模型检查。然而,这些方法无法捕获区块链和用户行为属性。在本文中,我们提出了一种新的形式化建模方法来验证智能合约在其执行环境中的行为。我们将这种形式应用于一个具体的智能合约示例,并使用静态模型检查方法分析其违规行为。
{"title":"Formal Verification of Smart Contracts Based on Users and Blockchain Behaviors Models","authors":"Tesnim Abdellatif, Kei-Léo Brousmiche","doi":"10.1109/NTMS.2018.8328737","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328737","url":null,"abstract":"Blockchain technology has attracted increasing attention in recent years. One reason of this new trend is the introduction of on-chain smart contracts enabling the implementation of decentralized applications in trust-less environments. Along with its adoption, attacks exploiting smart contract vulnerabilities are inevitably growing. To counter these attacks and avoid breaches, several approaches have been explored such as documenting vulnerabilities or model checking using formal verification. However, these approaches fail to capture the Blockchain and users behavior properties. In this paper, we propose a novel formal modeling approach to verify a smart contract behavior in its execution environment. We apply this formalism on a concrete smart contract example and analyze its breaches with a statical model checking approach.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129029129","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}
引用次数: 99
Digitizing, Securing and Sharing Vehicles Life-cycle over a Consortium Blockchain: Lessons Learned 在联盟区块链上数字化、保护和共享车辆生命周期:经验教训
Kei-Léo Brousmiche, Thomas Heno, C. Poulain, Antoine Dalmieres, Elyes Ben Hamida
Nowadays, vehicles odometer fraud is becoming a growing problem internationally, and is costing European consumers between 5.6 to 9.6 billion euros per year. This is partly due to the lack of unified vehicles life-cycle management, and to the fact that vehicles data are currently spread across multiple stakeholders that do not trust each other or collaborate together. In this paper, we propose a Blockchain- backed Vehicles Data and Processes Ledger framework to streamline the management of vehicles life-cycle and data history, and hence to provide more transparency and collaborations between the involved stakeholders. The architecture and lessons learned from the first implementation phase are discussed, followed by future research challenges.
如今,汽车里程表欺诈已成为一个日益严重的国际问题,每年给欧洲消费者造成56亿至96亿欧元的损失。部分原因是由于缺乏统一的车辆生命周期管理,以及车辆数据目前分布在多个利益相关者之间,这些利益相关者之间互不信任或合作。在本文中,我们提出了一个区块链支持的车辆数据和流程分类账框架,以简化车辆生命周期和数据历史的管理,从而在相关利益相关者之间提供更多的透明度和协作。讨论了从第一个实现阶段获得的体系结构和经验教训,然后讨论了未来的研究挑战。
{"title":"Digitizing, Securing and Sharing Vehicles Life-cycle over a Consortium Blockchain: Lessons Learned","authors":"Kei-Léo Brousmiche, Thomas Heno, C. Poulain, Antoine Dalmieres, Elyes Ben Hamida","doi":"10.1109/NTMS.2018.8328733","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328733","url":null,"abstract":"Nowadays, vehicles odometer fraud is becoming a growing problem internationally, and is costing European consumers between 5.6 to 9.6 billion euros per year. This is partly due to the lack of unified vehicles life-cycle management, and to the fact that vehicles data are currently spread across multiple stakeholders that do not trust each other or collaborate together. In this paper, we propose a Blockchain- backed Vehicles Data and Processes Ledger framework to streamline the management of vehicles life-cycle and data history, and hence to provide more transparency and collaborations between the involved stakeholders. The architecture and lessons learned from the first implementation phase are discussed, followed by future research challenges.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122830677","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}
引用次数: 56
Spectrum Sharing in Cognitive Radio Systems 认知无线电系统中的频谱共享
Raouia Masmoudi
In this paper, we focus on a wireless flat fading channel in a Cognitive radio network composed of licensed users (primary) and unlicensed users (secondary). We propose a framework for analyzing the access strategy based on the received interference at the secondary receiver and analyzing the achievable capacity of the secondary under the average power and average interference constraints. The proposed approach to the spectrum sharing, based on the received interference at the secondary receiver, significantly reduces the system complexity. We categorize the spectrum sharing into two cases based on the maximum interference threshold. We obtain a critical system parameter to eliminate the interference threshold constraint.
本文主要研究由授权用户(主)和非授权用户(次)组成的认知无线网络中的无线平坦衰落信道。我们提出了一种基于从接收机接收到的干扰分析接入策略的框架,并分析了在平均功率和平均干扰约束下副接收机的可实现容量。提出的基于从接收机接收到的干扰进行频谱共享的方法,大大降低了系统的复杂度。我们根据最大干扰阈值将频谱共享分为两种情况。我们得到了一个关键的系统参数来消除干扰阈值约束。
{"title":"Spectrum Sharing in Cognitive Radio Systems","authors":"Raouia Masmoudi","doi":"10.1109/NTMS.2018.8328720","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328720","url":null,"abstract":"In this paper, we focus on a wireless flat fading channel in a Cognitive radio network composed of licensed users (primary) and unlicensed users (secondary). We propose a framework for analyzing the access strategy based on the received interference at the secondary receiver and analyzing the achievable capacity of the secondary under the average power and average interference constraints. The proposed approach to the spectrum sharing, based on the received interference at the secondary receiver, significantly reduces the system complexity. We categorize the spectrum sharing into two cases based on the maximum interference threshold. We obtain a critical system parameter to eliminate the interference threshold constraint.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129897614","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}
引用次数: 3
NFB: A Protocol for Notarizing Files over the Blockchain NFB:在区块链上公证文件的协议
Haikel Magrahi, Nouha Omrane, Olivier Senot, Rakia Jaziri
Blockchains, such as Bitcoin and Ethereum and their respective P2P networks have seen significant adoption in many sectors in the past few years. All these technologies that use the Blockchain pattern show that it is possible to rebuild any transactional system with better performance without relying on any trusted parties to manage transactions between peers. This insight has lead many companies to invest millions to understand the technology and to find a way to migrate from centralized to decentralized solutions. These solutions need to store large amounts of data in a secure and confidential way. Many distributed storage systems now exist using Blockchain technology (Cloud, FileSystems, etc.). But none of the tools proposed are able to manage the document life cycle nor archive documents based on regulatory compliance. In this paper, we describe our protocol named NFB (Notarizing Files over the Blockchain). This protocol ensures the communication between two systems: a permissive Blockchain and a secured centralized archiving Document Management System. The method described is used to allow users to archive, control, analyze and validate their transactions in a system that offers confidentiality, security and distribution features.
过去几年,比特币和以太坊等区块链及其各自的P2P网络在许多领域得到了广泛采用。所有这些使用区块链模式的技术表明,无需依赖任何可信方来管理对等体之间的交易,就可以重建任何具有更好性能的事务系统。这种洞察力导致许多公司投资数百万美元来了解技术,并找到从集中式解决方案迁移到分散式解决方案的方法。这些解决方案需要以安全和保密的方式存储大量数据。许多分布式存储系统现在使用区块链技术(云,文件系统等)。但是所提出的工具都不能管理文档生命周期,也不能基于法规遵从性对文档进行归档。在本文中,我们描述了我们的协议NFB(在区块链上公证文件)。该协议确保了两个系统之间的通信:一个允许的区块链和一个安全的集中归档文档管理系统。所描述的方法用于允许用户在提供机密性、安全性和分发功能的系统中存档、控制、分析和验证他们的交易。
{"title":"NFB: A Protocol for Notarizing Files over the Blockchain","authors":"Haikel Magrahi, Nouha Omrane, Olivier Senot, Rakia Jaziri","doi":"10.1109/ntms.2018.8328740","DOIUrl":"https://doi.org/10.1109/ntms.2018.8328740","url":null,"abstract":"Blockchains, such as Bitcoin and Ethereum and their respective P2P networks have seen significant adoption in many sectors in the past few years. All these technologies that use the Blockchain pattern show that it is possible to rebuild any transactional system with better performance without relying on any trusted parties to manage transactions between peers. This insight has lead many companies to invest millions to understand the technology and to find a way to migrate from centralized to decentralized solutions. These solutions need to store large amounts of data in a secure and confidential way. Many distributed storage systems now exist using Blockchain technology (Cloud, FileSystems, etc.). But none of the tools proposed are able to manage the document life cycle nor archive documents based on regulatory compliance. In this paper, we describe our protocol named NFB (Notarizing Files over the Blockchain). This protocol ensures the communication between two systems: a permissive Blockchain and a secured centralized archiving Document Management System. The method described is used to allow users to archive, control, analyze and validate their transactions in a system that offers confidentiality, security and distribution features.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123067173","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}
引用次数: 13
期刊
2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1