Papers published on a yearly basis
Papers
More filters
•
27 Aug 1996TL;DR: In this paper, the server provides an indication that a first login series based on a first password has reached a predetermined minimum number of remaining hash function iterations, and the client responds to the server's indication by generating an initialization signal which relates the first login-series based on the first password to a second-series-based on a second password.
Abstract: Methods and apparatus are disclosed for re-initializing a secure password series based on an iterated hash function. User login information is communicated over an insecure network connection or other transmission medium between a client and a server. The server provides an indication that a first login series based on a first password has reached a predetermined minimum number of remaining hash function iterations. This indication could also be generated by the client. In either case, the client responds to the indication by generating an initialization signal which relates the first login series based on the first password to a second login series based on a second password. The initialization signal may be generated as the exclusive-or of the results of applying a first number of hash function iterations to the first password and a second number of hash function iterations to the second password. The client transmits the initialization signal to the server, which stores it along with an encrypted password transmitted in a previous valid first series login by the same user. The server then compares a function of the stored initialization signal and an initial second series login to the previously-stored first series login to determine if the initial second series login is valid. The second password may be generated by the client using a pass phrase portion of the first password and a new seed portion which does not require additional user input. The password re-initialization process can thus be performed automatically without any need to notify the user.
83 citations
••
07 Jun 2004TL;DR: A policy-based mobile ad hoc network management system that provides the capability to express networking requirements in the form of policies at a high level and have them automatically realized in the network by intelligent agents.
Abstract: Ad hoc networking is the basis of the future military network-centric warfare architecture. Such networks are highly dynamic in nature, as mobile ad hoc networks are formed over wireless links that are susceptible to failure. Strict requirements on security and reliability combined with the dynamic nature of the network provide a strong motivation for self-forming, self-configuring, and self-healing capabilities in the network. This paper describes a policy-based mobile ad hoc network management system that addresses these needs. The system provides the capability to express networking requirements in the form of policies at a high level and have them automatically realized in the network by intelligent agents. Our system provides the following capabilities: flexible monitoring and reporting that enables collection of management information from network elements at configurable intervals; automated configuration and reconfiguration of network elements based on reported network status; user-definable aggregation and filtering of monitored management information at the source of the data so as to reduce management station processing and network transmission overhead.
83 citations
••
83 citations
••
TL;DR: A "covariance fast Kalman algorithm" is derived that does not assume a zero input signal prior to the start of computation as the original fastKalman algorithm does and is therefore considered a remedy for performance degradation.
Abstract: The roundoff noise in a finite-precision digital implementation of the fast Kalman algorithm presented in [1]-[3] is known to adversely affect the algorithm's performance. By experience, we found that such performance degradation is closely related to an abnormal behavior of a quantity in this algorithm. More explicitly, this quantity can be interpreted as a ratio between two autocorrelations, and hence should always be positive. However, in a finite-precision implementation, its computed value can go negative. The algorithm performance is found to degrade noticeably near where this computed value becomes negative for the first time. As a remedy, we consider a special method of reinitializing the algorithm periodically. For this, a "covariance fast Kalman algorithm" is derived. This algorithm does not assume a zero input signal prior to the start of computation as the original fast Kalman algorithm does.
83 citations
••
TL;DR: In this article, the growth of high quality gallium arsenide using trimethylgallium and diethylarsine was reported and the epitaxial layers had excellent morphology, an n-type background free-carrier concentration as low as 3×1014 cm−3 and a liquid nitrogen temperature mobility as high as 64 600 cm2/V
Abstract: In this letter we report the growth of high‐quality gallium arsenide using trimethylgallium and diethylarsine. The epitaxial layers had excellent morphology, an n‐type background free‐carrier concentration as low as 3×1014 cm−3 and a liquid nitrogen temperature mobility as high as 64 600 cm2/V s. The low‐temperature (2 K) photoluminescence spectrum has well‐resolved excitonic peaks, confirming the high quality of the material.
83 citations
Authors
Showing all 3097 results
Name | H-index | Papers | Citations |
---|---|---|---|
Joseph E. Stiglitz | 164 | 1142 | 152469 |
Pete Smith | 156 | 2464 | 138819 |
Jean-Marie Tarascon | 136 | 853 | 137673 |
Ramamoorthy Ramesh | 122 | 649 | 67418 |
Martin Vetterli | 105 | 761 | 57825 |
Noga Alon | 104 | 895 | 44575 |
Amit P. Sheth | 101 | 753 | 42655 |
Harold G. Craighead | 101 | 569 | 40357 |
Susan T. Dumais | 100 | 346 | 60206 |
Andrzej Cichocki | 97 | 952 | 41471 |
Robert E. Kraut | 97 | 297 | 38116 |
Kishor S. Trivedi | 95 | 698 | 36816 |
David R. Clarke | 90 | 553 | 36039 |
Axel Scherer | 90 | 736 | 43939 |
Michael R. Lyu | 89 | 696 | 33257 |