005 |
|
19991110072144.9 |
035 |
|
|aAAI9804494
|
035 |
|
|a(UnM)AAI9804494
|
040 |
|
|aTWNTU|cTWNTU|dTWNTU
|
095 |
|
|aNTTTCL|bN|cN000007|d008|pNR|fFRANK|zNR|m0|tDDC
|
100 |
1
|
|aKEUNG, STEPHEN SAI-LUNG.
|
245 |
10
|
|aDESIGN AND ANALYSIS OF SECURITY PROTOCOLS AGAINST OFF-LINE GUESSING ATTACKS (NETWORK SECURITY, CRYPTOGRAPHY, HACKING).
|
300 |
|
|a151 p.
|
500 |
|
|aSource: Dissertation Abstracts International, Volume: 58-08, Section: B, page: 4369.
|
500 |
|
|aChair: KAI-YEUNG (SUNNY) SIU.
|
502 |
|
|aThesis (PH.D.)--UNIVERSITY OF CALIFORNIA, IRVINE, 1997.
|
520 |
|
|aThe Internet has brought people a lot of information, providing them more convenience and bringing people closer together. At the same time, people are concerned about their own privacy being threatened. Thus, network security is necessary to protect people's privacy. In general, network security is needed in places, including local area (LAN) and dial-up networks, where information is delivered between computers. In order to secure information in computer networks, security protocol design must cover authentication, confidentiality, and message integrity issues to prevent attackers from impersonating a legitimate user, extracting unauthorized information, and tampering messages.
|
520 |
|
|aCryptosystems are used to protect people's information so that an attacker cannot easily recover it. These systems rely on a software "key" to perform the information encryption (scrambling) and decryption (unscrambling). Very often, such a software key either is a user's password or its derivative. Passwords are considered weak because of their limited possible choices compared to random bit strings. Thus, an attacker attempting to guess a user's password through some automated mechanism is considered feasible. In fact, it is possible for an attack to guess the password off-line in an isolated machine without being detected.
|
520 |
|
|aThe main contribution of this dissertation is a set of security protocols that are resistant to feasible off-line guessing and other attacks, for many different network settings. These settings include client-server, peer-to-peer, point-to-multipoint, and wireless network. The protocols are not only secure against different attacks, but many of them are also optimized in terms of either the number of messages or the number of rounds for performance reasons. The feasibility of off-line guessing attacks is quantified by the amount of search space that a protocol provides; the larger the search space, the more secure against such attacks. This dissertation also describes an algorithm that determines the search space of a protocol. Then, for completeness, a formal logic is used to prove the correctness of a selected protocol. Since the same techniques are used when designing the protocols presented here, one can also apply the same idea to these protocols to show their correctness.
|
590 |
|
|aSchool code: 0030.
|
650 |
4
|
|aEngineering, Electronics and Electrical.
|
650 |
4
|
|aComputer Science.
|
690 |
|
|a0544
|
690 |
|
|a0984
|
710 |
20
|
|aUNIVERSITY OF CALIFORNIA, IRVINE.
|
773 |
0
|
|tDissertation Abstracts International|g58-08B.
|
790 |
|
|a0030
|
790 |
10
|
|aSIU, KAI-YEUNG (SUNNY),|eadvisor.
|
791 |
|
|aPH.D.
|
792 |
|
|a1997
|
809 |
|
|d008|tDDC|pNR
|
856 |
40
|
|uhttp://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=9804494
|