针对可信移动平台(Trusted Mobile Platform,TMP)远程认证方式中直接匿名证明方案存在的性能瓶颈、R攻击以及跨信任域问题,提出了一种新型的具有用户可控关联性的匿名证明(Anonymous Attestation with User-controlled-linkability,TMP-...针对可信移动平台(Trusted Mobile Platform,TMP)远程认证方式中直接匿名证明方案存在的性能瓶颈、R攻击以及跨信任域问题,提出了一种新型的具有用户可控关联性的匿名证明(Anonymous Attestation with User-controlled-linkability,TMP-UAA)方案.通过引入可信第三方CA构建了方案的模型,该模型可以有效解决传统直接匿名证明设计中存在的R攻击和跨信任域问题,且易于部署实现.根据提出的方案模型,首先利用Paillier加密系统及可验证加密技术设计了一个安全两方计算协议,该协议用于实现TPM-UAA方案中的Join协议;其次运用该协议并结合提出的l-MSDH假设和XDH假设给出了方案的具体设计;然后在随机预言模型下对方案的安全性进行了证明,证明表明该方案满足用户可控匿名性以及用户可控可追踪性;此外在性能方面与现有直接匿名证明方案相比,该方案具有更短的签名长度以及更高的计算效率;最后阐述了TPM-UAA方案在可信移动环境下的跨域证明,该证明避免了传统直接匿名证明存在的跨信任域及R攻击问题.展开更多
Cache-enabled small cell networks have been regarded as a promising approach for network operators to cope with the explosive data traffic growth in future 5 G networks. However, the user association and resource allo...Cache-enabled small cell networks have been regarded as a promising approach for network operators to cope with the explosive data traffic growth in future 5 G networks. However, the user association and resource allocation mechanism has not been thoroughly studied under given content placement situation. In this paper, we formulate the joint optimization problem of user association and resource allocation as a mixed integer nonlinear programming(MINLP) problem aiming at deriving a balance between the total utility of data rates and the total data rates retrieved from caches. To solve this problem, we propose a distributed relaxing-rounding method. Simulation results demonstrate that the distributed relaxing-rounding method outperforms traditional max-SINR method and range-expansion method in terms of both total utility of data rates and total data rates retrieved from caches in practical scenarios. In addition, effects of storage and backhaul capacities on the performance are also studied.展开更多
Measuring mobile calls data is an increasingly import issue,which will benefit to the understanding of the behavior of mobile users and assist telecom operators to optimize their business strategies.The existing resea...Measuring mobile calls data is an increasingly import issue,which will benefit to the understanding of the behavior of mobile users and assist telecom operators to optimize their business strategies.The existing researches on cell phone data measurement only focus on mobile calls or on mobile-internet surfing and little researches focus on the interactions of behaviors between them.In this paper,some basic factors of the association between mobile calls and mobile-internet surfing are measured.Then first their distributions are compared and the preference of users is quantified.After that experiments on the curve fitting of both the whole and parts of these distributions are done.Through the comparison of the correlation coefficients and Fourier fitting parameters,different behaviors is found between workdays and weekends,as well as Saturdays and Sundays in mobile-call distributions.Besides,the results of our observation show that the mobile-internet traffic does not always monotone increase with the increase of online time,significant changes are observed after 8hours of mobile-internet surfing.展开更多
文摘针对可信移动平台(Trusted Mobile Platform,TMP)远程认证方式中直接匿名证明方案存在的性能瓶颈、R攻击以及跨信任域问题,提出了一种新型的具有用户可控关联性的匿名证明(Anonymous Attestation with User-controlled-linkability,TMP-UAA)方案.通过引入可信第三方CA构建了方案的模型,该模型可以有效解决传统直接匿名证明设计中存在的R攻击和跨信任域问题,且易于部署实现.根据提出的方案模型,首先利用Paillier加密系统及可验证加密技术设计了一个安全两方计算协议,该协议用于实现TPM-UAA方案中的Join协议;其次运用该协议并结合提出的l-MSDH假设和XDH假设给出了方案的具体设计;然后在随机预言模型下对方案的安全性进行了证明,证明表明该方案满足用户可控匿名性以及用户可控可追踪性;此外在性能方面与现有直接匿名证明方案相比,该方案具有更短的签名长度以及更高的计算效率;最后阐述了TPM-UAA方案在可信移动环境下的跨域证明,该证明避免了传统直接匿名证明存在的跨信任域及R攻击问题.
基金supported by National Natural Science Foundation of China under Grants No. 61371087 and 61531013The Research Fund of Ministry of Education-China Mobile (MCM20150102)
文摘Cache-enabled small cell networks have been regarded as a promising approach for network operators to cope with the explosive data traffic growth in future 5 G networks. However, the user association and resource allocation mechanism has not been thoroughly studied under given content placement situation. In this paper, we formulate the joint optimization problem of user association and resource allocation as a mixed integer nonlinear programming(MINLP) problem aiming at deriving a balance between the total utility of data rates and the total data rates retrieved from caches. To solve this problem, we propose a distributed relaxing-rounding method. Simulation results demonstrate that the distributed relaxing-rounding method outperforms traditional max-SINR method and range-expansion method in terms of both total utility of data rates and total data rates retrieved from caches in practical scenarios. In addition, effects of storage and backhaul capacities on the performance are also studied.
基金Supported by the National High Technology Research and Development Programme of China(No.2011AA010706)the National Natural Science Foundation of China(No.61170041)
文摘Measuring mobile calls data is an increasingly import issue,which will benefit to the understanding of the behavior of mobile users and assist telecom operators to optimize their business strategies.The existing researches on cell phone data measurement only focus on mobile calls or on mobile-internet surfing and little researches focus on the interactions of behaviors between them.In this paper,some basic factors of the association between mobile calls and mobile-internet surfing are measured.Then first their distributions are compared and the preference of users is quantified.After that experiments on the curve fitting of both the whole and parts of these distributions are done.Through the comparison of the correlation coefficients and Fourier fitting parameters,different behaviors is found between workdays and weekends,as well as Saturdays and Sundays in mobile-call distributions.Besides,the results of our observation show that the mobile-internet traffic does not always monotone increase with the increase of online time,significant changes are observed after 8hours of mobile-internet surfing.
