Search for: hash-functions
Total 26 records
Article IEEE Embedded Systems Letters ; Vol. 6, issue. 4 , 2014 , pp. 89-92 ; ISSN: 19430663 ; Tian, K ; Azarderakhsh, R ; Bayat Sarmadi, S ; Sharif University of Technology
The development of extremely-constrained embedded systems having sensitive nodes such as RFID tags and nanosensors necessitates the use of lightweight block ciphers. Nevertheless, providing the required security properties does not guarantee their reliability and hardware assurance when the architectures are prone to natural and malicious faults. In this letter, error detection schemes for lightweight block ciphers are proposed with the case study of XTEA (eXtended TEA). Lightweight block ciphers such as XTEA, PRESENT, SIMON, and the like might be better suited for low-resource deeply-embedded systems compared to the Advanced Encryption Standard. Three different error detection approaches...
Article IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems ; Vol. 33, issue. 7 , July , 2014 , p. 1105-1109 ; 0278-0070 ; Mozaffari-Kermani, M ; Reyhani-Masoleh, A ; Sharif University of Technology
The secure hash algorithm (SHA)-3 has been selected in 2012 and will be used to provide security to any application which requires hashing, pseudo-random number generation, and integrity checking. This algorithm has been selected based on various benchmarks such as security, performance, and complexity. In this paper, in order to provide reliable architectures for this algorithm, an efficient concurrent error detection scheme for the selected SHA-3 algorithm, i.e., Keccak, is proposed. To the best of our knowledge, effective countermeasures for potential reliability issues in the hardware implementations of this algorithm have not been presented to date. In proposing the error detection...
Article 13th International ISC Conference on Information Security and Cryptology, 7 September 2016 through 8 September 2016 ; 2016 , Pages 72-78 ; 9781509039494 (ISBN) ; Salmasizadeh, M ; Daneshgar, A ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
Non-malleable codes are kind of encoding schemes which are resilient to tampering attacks. The main idea behind the non-malleable coding is that the adversary can't be able to obtain any valuable information about the message. Non-malleable codes are used in tamper resilient cryptography and protecting memory against tampering attacks. Several kinds of definitions for the non-malleability exist in the literature. The Continuous non-malleability is aiming to protect messages against the adversary who issues polynomially many tampering queries. The first continuous non-malleable encoding scheme has been proposed by Faust et al. (FMNV) in 2014. In this paper, we propose a new method for proving...
Article ACM International Conference Proceeding Series, 24 November 2009 through 26 November 2009, Seoul ; Volume 403 , 2009 , Pages 940-944 ; 9781605587103 (ISBN) ; Movaghar, A ; Safi, S. M ; Sharif University of Technology
Secure routing is one of the most important topics in the wireless MANETs networks. MANETs networks don't have a central infrastructure for the management of routing in the networks. Each node independently routes and sends packets, so many attacks such as forging, modifying, and denial of service (DoS), Occur in these networks. In this paper, we present the new protocol, SEAODV; Secure Efficient Ad-hoc on Demand Routing Protocol for MANETs networks. SEAODV is based on the AODV algorithm and in comparison with existing secure AODV protocols such as SAODV, ARAN and SEAR have improved security and performances. SEAODV uses HEAP authentication Scheme with symmetric cryptography and one-way hash...
Article Wireless Personal Communications ; Volume 95, Issue 4 , 2017 , Pages 5057-5080 ; 09296212 (ISSN) ; Baghery, K ; Khazaei, S ; Aref, M. R ; Sharif University of Technology
Recently, Radio Frequency Identification (RFID) and Near Field Communication systems are found in various user-friendly services that all of us deal with in our daily lives. As these systems are ubiquitously deployed in different authentication and identification applications, inferring information about our behavior will be possible by monitoring our use of them. In order to provide privacy and security requirements of RFID users in novel authentication applications, lots of security schemes have been proposed which have tried to provide secure and untraceable communication for end-users. In this paper, we investigate the privacy of three RFID security schemes which have been proposed...
M.Sc. Thesis Sharif University of Technology ; Aref, Mohammad Reza ; Eghlidos, Taraneh
Collision attack is one of the usual attacks in cryptanalysis of hash functions. One method for applying this attack is linear approximation of equivalent compress function. Finding collisions for linearized compress function, having low Hamming weight, with a large probability could provide collisions for the main compress function. For this purpose, the problem of finding collision for used compress function is modeled by that of the linearized one, having low Hamming weight differences with a large probability. The problem of finding collisions with low Hamming weight differences is equivalent to the problem of finding codewords with low Hamming weights in linear binary code. Canteaut and...
M.Sc. Thesis Sharif University of Technology ; Sharif Khani, Mohammad
The crypto-processors are used for encryption and decryption of the sensitive and important information. A crypto-processor converts input plaintext to ciphertext by an input key using a particular cryptographic algorithm. It also converts ciphertext to plaintext by the same or another key. Cryptographic standards are divided in two types: symmetric key algorithms (private key) and asymmetric key algorithms (public key). Current processors generally support only one or a few number of cryptographic algorithms. The motivation of this project is design and implementation of a multi-standard crypto-processor which supports the most of symmetric and asymmetric cryptographic algorithms, such as...
M.Sc. Thesis Sharif University of Technology ; Khazaei, Shahram
In this thesis, first we will have a brief review on hash functions and related concepts.Then, we will descibe the hash function, Cubehash, which is one of the competitors in the competition held by NIST for selecting SHA-3 standard. Next, we will describe an attack based on linearization of differential paths in hash functions and apply this attack on Cubehash. At the end, we will discuss the results of this attack on Cubehash
M.Sc. Thesis Sharif University of Technology ; khazaei, Shahram
A hash function maps efficiently every finite length string to a fixed one. The output represents the entire content of the input, similar to digital fingerprint of input text. In order to be able to use a hash function in cryptography, it should be hard to find two distinct inputs with the same output (collision), because finding a collision in hash functions leads to malicious attacks on many security systems.We say a hash function is provably collision resistant, if finding a collision can be reduced to the known hard problems. Family of MD hash functions are one of the most famous applied hash functions which are considerably used in industrial applications. However, they are not...
M.Sc. Thesis Sharif University of Technology ; Aref, Mohammad Reza
With the advent of the Internet of Things (IoT), e-health has become one of the main topics of research. Due to the sensitivity of patient information, patient privacy seems challenging. Nowadays, patient data is usually stored in the cloud in healthcare programs, making it difficult for users to have enough control over their data. The recent increment in announced cases of security and surveillance breaches compromising patients' privacy call into question the conventional model, in which third-parties gather and control immense amounts of patients' Healthcare data. In this work, we try to resolve the issues mentioned above by using blockchain technology. We propose a blockchain-based...
M.Sc. Thesis Sharif University of Technology ; Khazaei, Shahram
Correlation-intractability is a random-oracle-like property of hash functions, so one can expect that constructions that are secure in random-oracle-model, remain secure when implemented using a correlation-intractable hash function. This is true about Fiat-Shamir transform which is a method for eliminating interaction from public-coin interactive proofs. One can see that when this method is applied to a public-coin three-round honest-verifier zero-knowledge proof, using a correlation-intractable hash function that also satisfies some mild assumption, the result is a NIZK argument. This is the basis for the correlation-intractability framework for NIZK which recently has been used to...
M.Sc. Thesis Sharif University of Technology ; Mohajeri, Javad ; Salmasizadeh, Mahmoud
Nowadays, intelligent transportation systems have become possible and practical with the help of vehicular ad-hoc networks. This network is a subset of mobile ad-hoc networks introduced and studied separately due to its unique properties. With the help of vehicular ad-hoc networks, the level of road and drivers safety is increased and safety messages can be sent to road side units or other vehicles, so real-time is one of the main requirements of these networks. Other advantages of implementing such networks include providing entertainment and internet access services.On the other hand, these networks face various challenges, including routing data packets, preserving security requirements,...
Article 1st IFIP International Conference on New Technologies, Mobility and Security, NTMS 2007, Paris, 2 May 2007 through 4 May 2007 ; 2007 , Pages 447-458 ; 9781402062698 (ISBN) ; Sattarzadeh, B ; Jalili, R ; Sharif University of Technology
Kluwer Academic Publishers 2007
Many smart-card-based remote authentication schemes have been proposed recently. In 2004, Yoon et al. presented an improved scheme which is the leading of a research track started from Sun, 2000. In this paper, we illustrate that Yoon et al.'s scheme is vulnerable to the parallel session attack and propose an enhancement of the scheme to resist that attack. In our scheme the parties further establish a forward-secure session key by employing only hash functions to protect the subsequent communications. We also demonstrate that our scheme has better security in comparison to other related works, while it does not incur much computational cost © 2007 Springer
Article 2008 16th International Conference on Networks, ICON 2008, New Delhi, 12 December 2008 through 14 December 2008 ; February , 2008 ; 9781424438051 (ISBN) ; Jalili, R ; Sharif University of Technology
Numerous authentication protocols for RFID systems were proposed as attempt to prevent unauthorized tracking and monitoring, impersonation or cloning, and information leakage. Many of such attempts cannot establish essential requirements that one robust authentication protocol must guarantee. In this paper, we propose a rapid mutual authentication protocol, called FLMAP, that overcomes all the drawbacks of previously proposed protocols. Our protocol has three passes and it does not use any cryptographic primitives such as hash functions and encryption algorithms; it is very fast and efficient. Significant characteristics of the protocol are forward security, tag anonymity, location privacy,...
Article Proceedings of the 2008 International Conference on Advanced Infocomm Technology, ICAIT '08, 29 July 2008 through 31 July 2008, Shenzhen ; 2008 ; 9781605580883 (ISBN) ; Tajamolian, M ; Dehghan, M ; Mousavi, R ; Sharif University of Technology
Mobile Ad Hoc Networks (MANETs) are networks with selforganizing capabilities and without a fixed infrastructure. Wireless nodes communicate among themselves using multi-hop radio relaying, without requiring the packets to pass through a central access point or a base station. In a highly mobile and infrastructure-less scenario, pre-configuration of addresses is not possible. Therefore node addresses need to be configured dynamically with minimum delay and packet loss. Existing solutions for IP address auto-configuration do not address security issues. In this paper we propose a secure address autoconfiguration for Mobile Ad hoc Networks (MANET) based on Virtual Address Space Mapping ....
Article Proceedings - International Conference on Advanced Information Networking and Applications, AINA, 26 May 2009 through 29 May 2009, Bradford ; 2009 , Pages 176-180 ; 1550445X (ISSN); 9780769536392 (ISBN) ; Taghiloo, M ; Tajamolian, M ; Sharif University of Technology
Mobile ad hoc networks allow to create very dynamic communication systems, which are independent from any fixed infrastructure. One of the most important issues regarding the management of an ad hoc network is the configuration of the system according to the way users move. Since a centralized control structure does not exist, we need to determine how the IP addresses must be assigned to the nodes in the network. In this paper we add a security mechanism to VASM protocol based on zero knowledge approach. A hash function has very low running time. So this so this scheme is very light-weight. The VASM protocol uses coordinate value of point in main address sheet for generating addresses. The...
Article 2010 International Conference on Information Science and Applications, ICISA 2010, 21 April 2010 through 23 April 2010 ; April , 2010 ; 9781424459438 (ISBN) ; Eidkhani, E ; Mortazavi, S. A ; Nemaney Pour, A ; Sharif University of Technology
This paper presents a new group key management protocol, CKC (Code for Key Calculation). This protocol is based on logical key hierarchy. When a new member joins the group, server sends only the group key for that member. Then, current members and the new member calculate the necessary keys using node codes and one-way hash function. Node code is a code which is assigned to each node of the key tree. Again at leave, server just sends the new group key to remaining members. By this key, members calculate necessary keys using node codes and one-way hash function. The security of the keys is based on one-wayness of hash function. The results show that CKC reduces computational and communication...
Article Telecommunication Systems ; Volume 51, Issue 2-3 , 2012 , Pages 115-123 ; 10184864 (ISSN) ; Eidkhani, E ; Mortazavi, S. A ; Nemaney Pour, A ; Sharif University of Technology
This paper presents a new group key management protocol, CKC (Code for Key Calculation) for secure IP multicast. In this protocol which is based on logical key hierarchy, only the group key needs to be sent to new member at join. Then, using the group key current members and the new member calculate the necessary keys by node codes and one-way hash function. A node code is a random number assigned to each node to help users calculate necessary keys. Again, at leave server just sends the new group key to the remaining members. By this key, members calculate necessary keys using node codes and one-way hash function. The security of the keys is based on one-wayness of hash function. The results...
Article IEEE Transactions on Vehicular Technology ; Volume 67, Issue 6 , 2018 , Pages 5409-5423 ; 00189545 (ISSN) ; Salmasizadeh, M ; Susilo, W ; Majidi, A ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc 2018
Vehicular ad-hoc networks (VANETs) are under active development, thanks in part to recent advances in wireless communication and networking technologies. The most fundamental part in VANETs is to enable message authentications between vehicles and roadside units. Message authentication using proxy vehicles has been proposed to reduce the computational overhead of roadside units significantly. In this message authentication scheme, proxy vehicles that verify multiple messages at the same time improve roadside units' efficiency. In this paper, first we show that the only proxy-based authentication scheme (PBAS) presented for this goal by Liu et al. cannot guarantee message authenticity, and...
Article 15th ACM International Conference on Computing Frontiers, CF 2018, 8 May 2018 through 10 May 2018 ; 2018 , Pages 204-207 ; 9781450357616 (ISBN) ; Azarderakhsh, R ; Bayat Sarmadi, S ; ACM Special Interest Group on Microarchitectural Research and Processing (SIGMICRO) ; Sharif University of Technology
Association for Computing Machinery, Inc 2018
In cryptographic engineering, extensive attention has been devoted to ameliorating the performance and security of the algorithms within. Nonetheless, in the state-of-the-art, the approaches for increasing the reliability of the efficient hash functions ECHO and Fugue have not been presented to date.We propose efficient fault detection schemes by presenting closed formulations for the predicted signatures of different transformations in these algorithms. These signatures are derived to achieve low overhead for the specific transformations and can be tailored to include byte/word-wide predicted signatures. Through simulations, we show that the proposed fault detection schemes are...