Explicit Optimal Binary Pebbling for One-Way Hash Chain Reversal
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Improved Internet Security Protocols Using Cryptographic One-Way Hash Chains" (2014)
University of Central Florida STARS Electronic Theses and Dissertations, 2004-2019 2014 Improved Internet Security Protocols Using Cryptographic One- Way Hash Chains Amerah Alabrah University of Central Florida Part of the Computer Sciences Commons, and the Engineering Commons Find similar works at: https://stars.library.ucf.edu/etd University of Central Florida Libraries http://library.ucf.edu This Doctoral Dissertation (Open Access) is brought to you for free and open access by STARS. It has been accepted for inclusion in Electronic Theses and Dissertations, 2004-2019 by an authorized administrator of STARS. For more information, please contact [email protected]. STARS Citation Alabrah, Amerah, "Improved Internet Security Protocols Using Cryptographic One-Way Hash Chains" (2014). Electronic Theses and Dissertations, 2004-2019. 4599. https://stars.library.ucf.edu/etd/4599 IMPROVED INTERNET SECURITY PROTOCOLS USING CRYPTOGRAPHIC ONE-WAY HASH CHAINS by AMERAH ABDULRAHMAN ALABRAH B.S. King Saud University, 2006 M.S. Colorado State University, 2008 A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Electrical Engineering and Computer Science in the College of Engineering and Computer Science at the University of Central Florida Orlando, Florida Fall Term 2014 Major Professor: Mostafa Bassiouni © 2014 Amerah Alabrah ii ABSTRACT In this dissertation, new approaches that utilize the one-way cryptographic hash functions in designing improved network security protocols are investigated. The proposed approaches are designed to be scalable and easy to implement in modern technology. The first contribution explores session cookies with emphasis on the threat of session hijacking attacks resulting from session cookie theft or sniffing. -
Efficient Quantum-Immune Keyless Signatures with Identity
Efficient Quantum-Immune Keyless Signatures with Identity Ahto Buldas1;2, Risto Laanoja1;2, and Ahto Truu1 1 Guardtime AS, Tammsaare tee 60, 11316 Tallinn, Estonia. [email protected] 2 Tallinn University of Technology, Ehitajate tee 5, 12618 Tallinn, Estonia. Abstract. We show how to extend hash-tree based data signatures to server-assisted personal digital signature schemes. The new signature scheme does not use trapdoor functions and is based solely on cryptographic hash functions and is thereby, considering the current state of knowledge, resistant to quantum computational attacks. In the new scheme, we combine hash-tree data signature (time- stamping) solutions with hash sequence authentication mechanisms. We show how to implement such a scheme in practice. 1 Introduction Electronic signatures use secret keys to protect the integrity of data. Keys can be compromised because of technical failures, human factor, or both threats in combination. In the creation process of electronic signatures, some types of secrets (keys, passwords, etc.) seem unavoidable, because secrets are necessary for authenticating the signer. Even if one uses biometric authentication, there must be a secure channel between the biometric reader and the signature creation device, and even if the signature creation device is physically (and securely) connected to biometric reader, the signature itself must be protected against modification (the integrity of signatures) and traditional solutions use public-key cryptography for that. This means that the validity of signatures depend on assumptions that some private keys are secure. For example, the keys of Public Key Infrastruc- ture (PKI) service providers like the OCSP responders are used to sign the validity statements of public-key certificates. -
A Study on the Concept of Using Efficient Lightweight Hash Chain To
applied sciences Article A Study on the Concept of Using Efficient Lightweight Hash Chain to Improve Authentication in VMF Military Standard Dohoon Kim 1 , Sang Seo 1, Heesang Kim 1, Won Gi Lim 2 and Youn Kyu Lee 3,* 1 Department of Computer Science, Kyonggi University, Suwon-si, Gyeonggi-do 16227, Korea; [email protected] (D.K.); [email protected] (S.S.); [email protected] (H.K.) 2 Agency for Defense Development (ADD), Seoul 05661, Korea; [email protected] 3 Department of Information Security, Seoul Women’s University, Seoul 01797, Korea * Correspondence: [email protected] Received: 23 November 2020; Accepted: 14 December 2020; Published: 16 December 2020 Abstract: Authentication algorithms in the form of cryptographic schemes, such as the Secure Hash Algorithm 1 (SHA-1) and the digital signature algorithm (DSA), specified in the current variable message format (VMF) military standard have numerous reliability-related limitations when applied to tactical data link (TDL) and multi-TDL networks (MTN). This is because TDL and MTN require maximum tactical security, communication integrity, and low network overhead based on many protocol header bits for rapid communication with limited network resources. The application of such authentication algorithms to TDL and MTN in a rapidly changing battlefield environment without reinforcement measures will lead to functional weaknesses and vulnerabilities when high-level digital-covert activities and deception tactics are implemented. Consequently, the existing VMF authentication scheme must be improved to secure transmission integrity, lower network transaction, and receive authentication tactical information in VMF-based combat network radio (CNR) networks. Therefore, in this study, a tactical wireless ad hoc network topology, similar to that of the existing CNRs, is considered, and a lightweight multi-factor hash chain-based authentication scheme that includes a time-based one-time password (T-OTP) for network overhead reduction and terminal authentication is proposed, coupled with exception handling. -
The Application of Hash Chains and Hash Structures to Cryptography
The application of hash chains and hash structures to cryptography Thomas Page Technical Report RHUL–MA–2009–18 4 August 2009 Department of Mathematics Royal Holloway, University of London Egham, Surrey TW20 0EX, England http://www.rhul.ac.uk/mathematics/techreports The application of hash chains and hash structures to cryptography Thomas Page A thesis submitted for the degree of Doctor of Philosophy. Royal Holloway, University of London July 27, 2009 Declaration These doctoral studies were conducted under the supervision of Prof. Keith Martin and Dr. Siaw-Lynn Ng. The work presented in this thesis is the result of original research car- ried out by myself, whilst enrolled in the Department of Mathematics as a candidate for the degree of Doctor of Philosophy. This work has not been submitted for any other degree or award in any other university or educa- tional establishment. Thomas Page July 27, 2009 1 Abstract In this thesis we study how hash chains and other hash structures can be used in various cryptographic applications. In particular we focus on the applications of entity authentication, signatures and key establishment. We study recursive application of hash functions to create hash chains, hash trees and other hash structures. We collate all these to form a catalogue of structures that we apply to various cryptographic applications. We study existing work on authentication and create many entity authen- tication schemes based on structures from our catalogue. We present a novel algorithm to find efficient signature schemes from any given hash structure. We study some suggestions for suitable hash struc- tures and define a particular scalable hash structure complete with a simple message to signature map that is the most efficient such scheme of which we know.