首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   15篇
  免费   3篇
  国内免费   3篇
综合类   2篇
无线电   9篇
一般工业技术   1篇
自动化技术   9篇
  2021年   1篇
  2019年   1篇
  2018年   1篇
  2017年   2篇
  2015年   1篇
  2014年   1篇
  2013年   1篇
  2012年   1篇
  2007年   3篇
  2002年   3篇
  2001年   1篇
  2000年   2篇
  1999年   1篇
  1997年   2篇
排序方式: 共有21条查询结果,搜索用时 15 毫秒
1.
In the last decade, the number of web‐based applications is increasing rapidly, which leads to high demand for user authentication protocol for multiserver environment. Many user‐authentication protocols have been proposed for different applications. Unfortunately, most of them either have some security weaknesses or suffer from unsatisfactory performance. Recently, Ali and Pal proposed a three‐factor user‐authentication protocol for multiserver environment. They claimed that their protocol can provide mutual authentication and is secure against many kinds of attacks. However, we find that Ali and Pal's protocol cannot provide user anonymity and is vulnerable to 4 kinds of attacks. To enhance security, we propose a new user‐authentication protocol for multiserver environment. Then, we provide a formal security analysis and a security discussion, which indicate our protocol is provably secure and can withstand various attacks. Besides, we present a performance analysis to show that our protocol is efficient and practical for real industrial environment.  相似文献   
2.
The problem of state space explosion is still an outstanding challenge in Markovian performance analysis for multiserver mul- tiqueue (MSMQ) systems. The system behavior of a MSMQ system is described using stochastic high-level Petri net (SHLPN) models, and an approximate performance analysis technique is proposed based on decomposition and refinement methods as well as iteration technique. A real MSMQ system, Web-server cluster, is investigated. The performance of an integrated scheme of request dispatching and scheduling is analyzed with both Poisson and self-similar request arrivals. The study shows that the approximate analysis technique significantly reduces the complexity of the model solution and is also efficient for accuracy of numerical results.  相似文献   
3.
We consider a Markovian multiserver queueing model with time dependent parameters where waiting customers may abandon and subsequently retry. We provide simple fluid and diffusion approximations to estimate the mean, variance, and density for both the queue length and virtual waiting time processes arising in this model. These approximations, which are generated by numerically integrating only 7 ordinary differential equations, are justified by limit theorems where the arrival rate and number of servers grow large. We compare our approximations to simulations, and they perform extremely well.  相似文献   
4.
A multiserver Poisson queuing system with losses, with a variable number of servers, and an additive quality functional is investigated. All major characteristic of the system are obtained in an explicit form. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 92–101, July–August 2007.  相似文献   
5.
李军  孙玉方 《计算机学报》1997,20(5):396-403
本文描述基于微核心技术的国产操作系统COSIXV2.0中文件系统服务器的安全性设计。  相似文献   
6.
Multiserver authentication complies with the up‐to‐date requirements of Internet services and latest applications. The multiserver architecture enables the expedient authentication of subscribers on an insecure channel for the delivery of services. The users rely on a single registration of a trusted third party for the procurement of services from various servers. Recently, Chen and Lee, Moon et al, and Wang et al presented multiserver key agreement schemes that are found to be vulnerable to many attacks according to our analysis. The Chen and Lee scheme was found susceptible to impersonation attack, trace attack, stolen smart card attack exposing session key, key‐compromise impersonation attack, and inefficient password modification. The Moon et al is susceptible to stolen card attack leading to further attacks, ie, identity guessing, key‐compromise impersonation attack, user impersonation attack, and session keys disclosure, while Wang et al is also found to be prone to trace attack, session‐specific temporary information attack, key‐compromise information attack, and privileged insider attack leading to session key disclosure and user impersonation attacks. We propose an improved protocol countering the indicated weaknesses of these schemes in an equivalent cost. Our scheme demonstrates automated and security analysis on the basis of Burrows‐Abadi‐Needham logic and also presents the performance evaluation for related schemes.  相似文献   
7.
Time dependent behavior has an impact on the performance of telecommunication models. Examples include: staffing a call center, pricing the inventory of private line services for profit maximization, and measuring the time lag between the peak arrivals and peak load for a system. These problems and more motivate the development of a queueing theory with time varying rates. Queueing theory as discussed in this paper is organized and presented from a communications perspective. Canonical queueing models with time-varying rates are given and the necessary mathematical tools are developed to analyze them. Finally, we illustrate the use of these models through various communication applications.  相似文献   
8.
An M|M|N queueing system with identical servers and controlled mode, which is characterized by the parameter, “exponential distribution of service time,” is considered. The mode varies in accordance with a multithreshold strategy. The system is subjected to the action of catastrophic failures that induce the departure of all the customers from the system. An algorithm is developed for calculating the stationary state probability of the system and the performance characteristics with fixed control strategy. An optimal strategy is found numerically in a limited region of values of the threshold. Numerical examples are presented.  相似文献   
9.
In the past decades, the demand for remote mutual authentication and key agreement (MAKA) scheme with privacy preserving grows rapidly with the rise of the right to privacy and the development of wireless networks and Internet of Things (IoT). Numerous remote MAKA schemes are proposed for various purposes, and they have different properties. In this paper, we survey 49 three‐factor–based remote MAKA schemes with privacy preserving from 2013 to 2019. None of them can simultaneously achieve security, suitability for multiserver environments, user anonymity, user untraceability, table free, public key management free, and independent authentication. Therefore, we propose an efficient three‐factor MAKA scheme, which achieves all the properties. We propose a security model of a three‐factor–based MAKA scheme with user anonymity for multiserver environments and formally prove that our scheme is secure under the elliptic curve computational Diffie‐Hellman problem assumption, decisional bilinear Diffie‐Hellman problem assumption, and hash function assumption. We compare the proposed scheme to relevant schemes to show our contribution and also show that our scheme is sufficiently efficient for low‐power portable mobile devices.  相似文献   
10.
The fast growth of mobile services and devices has made the conventional single‐server architecture ineffective from the point of its functional requirements. To extend the scalability and availability of mobile services to various applications, it is required to deploy multiserver architecture. In 2016, Moon et al insisted that Lu et al's scheme is weak to insiders and impersonation attack, then they proposed a biometric‐based scheme for authentication and key agreement of users in multiserver environments. Unfortunately, we analyze Moon et al's scheme and demonstrate that their scheme does not withstand various attacks from a malicious registered server. We propose a user authentication scheme with server mutual verification to overcome these security drawbacks. The proposed scheme withstands an attack from malicious insiders in multiserver environments. We use a threshold cryptography to strengthen the process of server authorization and to provide better security functionalities. We then prove the authentication and session key of the proposed scheme using Burrows‐Abadi‐Needham (BAN) logic and show that our proposed scheme is secure against various attacks.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号