Loading...
Search for:
salmasizadeh--mohmoud
0.088 seconds
Total 88 records
Impossible Differential Cryptanalysis of Lightweight Blockciphers TEA and XTEA
, M.Sc. Thesis Sharif University of Technology ; Aref, Mohammad Reza (Supervisor) ; Salmasizadeh, Mohmoud (Co-Advisor)
Abstract
The lightweight blockciphers and lightweight authenticated encryptions are special kind of the symmetric schemes designed to use in cases that resources such as power, area, etc. are limited. Sensor Networks and RF-Tags are two good example of lightweight schemes application. This limitations force designers to use simpler functions and operators in comparison to conventional schemes; therefore, providing the security in this case is so important. A novel approach for evaluating security of an algorithm is to apply different kinds of attack. Impossible differential cryptanalysis is one of the shortcut cryptanalysis, using the impossible differential characteristic. Impossible differential...
Developing an Ensemble Learning Framework Using Machine Learning Methods and its Application in Preventing Road Accidents
, M.Sc. Thesis Sharif University of Technology ; Houshmand, Mohmoud (Supervisor)
Abstract
Road accidents are currently one the main existing problems and a big challenge in Iran that is putting the lives of Iranian citizens in danger. Each accident is the result of a complex interplay between road users, vehicles, roads and environment. One of the main goals of accident data analysis is to identify and determine the main factors of a road accident. The dataset used here was obtained from the road traffic police and is stored in 3 different databases and corresponds to the accidents that happened between years 1390 and 1395 according to the Shamsi calendar. In this thesis, in order to deal with the inherent complexity and heterogeneity of the accident data, we will first introduce...
Design and Implementation of C band Vector- Sum phase Shifter for WLAN Applications
, M.Sc. Thesis Sharif University of Technology ; Akbari, Mohmoud (Supervisor) ; Fakharzadeh Jahromi, Mohammad (Supervisor)
Abstract
On the demand of higher directivity, higher throughput and less interference, phased array systems and MIMO have become attractive to reach these goals. The advantages of phased array systems include the ability to perform electronic beam steering and arbitrary pattern synthesis. Phase shifters and variable gain amplifiers are used to reach these advantages. In this thesis, a ‘’ C‘’ band (4.8 GHz-6.2 GHz) vector-sum phase shifter using HMIC technology for realizing a phased array receiver is designed. This phase shifter can change the signal phase and amplitude. The main blocks of this phase shifter are low-insertion phase and low-noise variable gain amplifier, which consists of current...
Application of Game Theory in the Design and Analysis Electronic Voting Protocols
, M.Sc. Thesis Sharif University of Technology ; Salmasizadeh, Mahmoud (Supervisor)
Abstract
A voting protocol was introduced by Popveniuc in 2006; it is receipt freeness, so appeared to be resistant against the bribed voter. In 2009 Clark using the bribed contract, and attacked to the voting protocol, in the elections by two candidates. He showed that this protocol is not resistant to the bribed voter. In this thesis, we use game theory and graph to extend the bribed contract for n candidates. Thus with the help of a graph, we show that this protocol with any number of candidates, is not resistant to the bribed voter, and we show that by increasing the number of candidates, the resistance of the protocol would be high and if the number of candidates is n, the success rate of this...
A New Scheme for Provable Secure Anonymous Proxy Signature in the Standard Model
, M.Sc. Thesis Sharif University of Technology ; Salmasizadeh, Mahmoud (Supervisor)
Abstract
In order to protect the proxy signers’ privacy, many anonymous proxy signature schemes have been proposed. As far as we know, there is no provable secure anonymous proxy signature scheme without random oracles. Because the provable security in the random oracle model has received a lot of criticism, in this thesis, the aim is proposing the first provable secure anonymous proxy signature in the standard model based on existing standard assumptions.It is shown in the standard model that, the proposal is anonymous against full key exposure and existential unforgeable with the computational Diffie Hellman (CDH) and Subgroup Hiding (SGH) assumptions in bilinear groups.To provide anonymity for proxy...
Security Enhancement of an Electronic Voting Protocol with Minimum Strong Assumptions
, M.Sc. Thesis Sharif University of Technology ; Salmasizadeh, Mahmoud (Supervisor)
Abstract
Electronic voting is one of the applications of electronic systems, in which collection and tallying the votes are performed electronically. In electronic voting systems, cryptography is used to provide security requirements but defects of the cryptography have made the electronic voting protocol designers to use strong assumptions which are impractical or hard to implement.In this research, some of the strong assumptions in electronic voting protocols are studied and the soloution of solving them is given. First, the assumption of trusting to the tally authority in electronic voting protocols which are based on deniable authentications is considered and a new internet voting protocol based...
Information Theoretic Security in Broadcast and Multiple Acess Channels
,
M.Sc. Thesis
Sharif University of Technology
;
Salmasizadeh, Mahmoud
(Supervisor)
Abstract
Wireless communication networks such as cell phones are rapidly expanding and every day they attract more users. Information flow in these networks is basically through free space. Thus, theses networks are inherently subjected to eavesdropping. Cryptography based on the secure key is the well known traditional way of protecting information security in wireless networks. However, these cryptosystems are just computationally secure and have their vulnerabilities. Information theoretic security is a relatively new method which doesn’t rely on any preshared key or key infrastructure and uses inherent characteristics of the communication channel to provide robust and provable security.In this...
Design of a Traceable Optimistic Fair Exchange Protocol
, M.Sc. Thesis Sharif University of Technology ; Salmasizadeh, Mahmoud (Supervisor)
Abstract
Fair exchange of digital items through computer network is an important research topic of modern cryptography. Generallty, a fair exchange protocol is a way which helps two parties to exchange their digital items fairly, so that at the end of the protocol execution, both parties recieve their desirable items or none of them recieves anything. In a practical applications, fair exchange protocol is widely used in different but related fields like contract signing protocols,non-repudiation protocols,e-ayment system and certified e-mails. In a fair exchange protocol, a trusted third party (TTP) acts as an arbitrator between two parties. To reduce the traffic load of the arbitrator, the concept...
An Optimistic Fair Exchange Protocol for Proxy Signatures
, M.Sc. Thesis Sharif University of Technology ; Salmasizadeh, Mahmoud (Supervisor)
Abstract
Increasing use of World Wide Web and users tend to accompany in the electronic transaction has caused a fair exchange becomes very important and pervasive electronic transaction. These transactions have a lot of usage and benefits. In this study, the optimistic fair exchange has been studied. It is a special case of the fair exchange while having more advantages than the fair exchange. A situation considered that a signer could not sign a message by himself so he delegates his right in signing to a person as a proxy signer. In this study, a protocol of optimistic fair exchange for proxy signature is presented. So, the proxy signer can accompany in the optimistic fair exchange instead of the...
Construction of a New Membrane Bioreactor for Industrial Wastewater Treatment
, M.Sc. Thesis Sharif University of Technology ; Seifkordi, Ali Akbar (Supervisor) ; Hemati, Mohmoud (Co-Advisor) ; Rekabdar, Fatemeh (Co-Advisor)
Abstract
In recent years membrane bioreactors (MBR) were widely used as an advanced process for industrial wastewater treatment. But fouling issue causes some restrictions in these systems. So for fouling reduction many researches were done.In this study for fouling improvement, blending of hydrophilic polymer (PAN) with main polymer PVDF was used. Blending membrane in phase inversion process with DMAC as solvent and water as non-solvent was made. For pore-forming in membranes, PVP as hydrophilic additive with three different composition was added and then for more enhancement of antifouling property of membrane, TiO2 nanoparticles with four different composition were added to polymeric...
Generalized multiple-access relay channel with confidential messages
, Article ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications, 17 October 2010 through 20 October 2010, Taichung ; 2010 , Pages 1024-1029 ; 9781424460175 (ISBN) ; Salimi, S ; Salmasizadeh, M ; Sharif University of Technology
2010
Abstract
In this paper, we propose information theoretic schemes that achieve the rate-equivocation regions for the multiple-access relay channel with confidential messages. This channel consists of two users that play the role of eavesdropper for each other's message and a relay that helps them to have a reliable and secure communication. The relay can itself be an eavesdropper of the users messages. The first coding scheme used for achievability is noise forwarding strategy and the second is the combination of noise forwarding with the compress and forward strategy. In the first one, relay cooperates with the users to have a confidential communication by sending codewords independent of the secret...
Deterministic multiple access wiretap channel
, Article Proceedings 2010 IEEE International Conference on Information Theory and Information Security, ICITIS 2010, 17 December 2010 through 19 December 2010, Beijing ; 2010 , Pages 998-1001 ; 9781424469406 (ISBN) ; Salimi, S ; Salmasizadeh, M ; Sharif University of Technology
2010
Abstract
Two-user Multiple Access Channel with a Wire- Tapper (MAC-WT) is considered. A general outer bound for the secrecy capacity region is given. Also, we have defined the Deterministic MAC-WT, where the channel input of each user is a deterministic function of the channel output and the channel input of the other user. For this network single-letter inner and outer bounds for the secrecy capacity region are given. Furthermore, it is shown that in the Deterministic MAC-WT, if the wiretapper channel is a degraded version of the main channel, inner and outer bounds meet and the secrecy capacity region is characterized
A new achievable rate-equivocation region for the relay-eavesdropper channel
, Article Proceedings - 2010 18th Iranian Conference on Electrical Engineering, ICEE 2010, 11 May 2010 through 13 May 2010 ; 2010 , Pages 188-193 ; 9781424467600 (ISBN) ; Salimi, S ; Salmasizadeh, M ; Sharif University of Technology
2010
Abstract
In this paper, we propose an information-theoretic scheme which achieves a new rate-equivocation region for the four-terminal relay-eavesdropper channel. The coding scheme used to achieve this region is a combination of the partial decode and forward, compress and forward and noise forwarding strategies. In this strategy the relay cooperates with the source to have both a reliable and secure communication by decoding some part of the source message, compressing the received signal and also sending the codewords independent of the transmitted message. Using this scheme we can obtain the perfect secrecy capacity of the semi- deterministic and deterministic relay channels
Secrecy capacity of wiretap channel for a new scenario and designing code for wiretap channel
, Article Proceedings - 2010 18th Iranian Conference on Electrical Engineering, ICEE 2010, 11 May 2010 through 13 May 2010 ; 2010 , Pages 183-187 ; 9781424467600 (ISBN) ; Salimi, S ; Salmasizadeh, M ; Sharif University of Technology
2010
Abstract
The concept of information theoretic security is introduced. Secrecy capacity of two receiver broadcast channel for a new scenario is derived in which it is assumed that the legitimate receiver has access to a noisy version of eavesdroppers channel outputs. Also the ideas of code designing to achieve zero error on main channel and perfect secrecy on the eavesdropper's channel, without invoking complicated capacity achieving codes are provided
A certificate-based proxy signature with message recovery without bilinear pairing
, Article Security and Communication Networks ; Volume 9, Issue 18 , 2016 , Pages 4983-4991 ; 19390114 (ISSN) ; Mohajery, J ; Salmasizadeh, M ; Sharif University of Technology
John Wiley and Sons Inc
2016
Abstract
In this paper, we propose the first provable secure certificate-based proxy signature (CBPS) with message recovery without bilinear pairing. In 2003, Gentry introduced the concept of certificate-based cryptography to solve certificate management and key escrow problems in public key infrastructure and identity-based cryptosystems, respectively. Because the overall cost of pairing computation is higher than scalar multiplication (e.g., over elliptic curve group), consequently, the CBPS schemes without pairings would be more efficient. According to the available research in this regard, our scheme is the first provable secure CBPS scheme with message recovery that is based on the elliptic...
A new public key encryption scheme equivalent to factoring
, Article 2007 International Conference on Security and Management, SAM'07, Las Vegas, NV, 25 June 2007 through 28 June 2007 ; 2007 , Pages 546-552 ; 1601320485 (ISBN); 9781601320483 (ISBN) ; Mohajeri, J ; Salmasizadeh, M ; Sharif University of Technology
2007
Abstract
In this paper, we propose a new public key encryption scheme similar to ElGamal cryptosystem. We prove that it is provably secure, based on intractability of factoring problem and intuitively show that our scheme is as least as secure as RSA and ElGamal cryptosystems. We will also show that decryption in our scheme could be done four times faster than ElGamal
New proxy signature, proxy blind signature and blind proxy signature based on okamoto signature
, Article 2008 International Conference on Security and Management, SAM 2008, Las Vegas, NV, 14 July 2008 through 17 July 2008 ; 2008 , Pages 238-242 ; 160132085X (ISBN); 9781601320858 (ISBN) ; Mohajeri, J ; Salmasizadeh, M ; Sharif University of Technology
2008
Abstract
Proxy signature helps the proxy signer to sign messages on behalf of the original signer. In this paper, we propose a new protected proxy signature scheme. In the proposed scheme, the proxy signer can sign messages on behalf of the original signer with public key in the form of y=g 1 x1 g 2 x2by means of Okamoto signature scheme. Then, we extend our scheme to a new proxy blind signature and a new blind proxy signature by use of Okamoto-Schnorr blind signature. In our blind proxy signature scheme when one of the proxy signers sign message for the verifier, the original signer does not know which one belongs to the proxy signers, therefore, this scheme is suitable for many applications where...
Comparison based semantic security is probabilistic polynomial time equivalent to indistinguishability
, Article International Journal of Network Security ; Volume 6, Issue 3 , May , 2008 , Pages 354-360 ; 1816353X (ISSN) ; Mohajeri, J ; Salmasizadeh, M ; Sharif University of Technology
2008
Abstract
In this paper we try to unify the frameworks of definitions of semantic security, indistinguishability and non-malleability by defining semantic security in comparison based framework. This facilitates the study of relations among these goals against different attack models and makes the proof of the equivalence of semantic security and indistinguishability easier and more understandable. Besides, our proof of the equivalence of semantic security and indistinguishability does not need any intermediate goals such as non devidability to change the definition framework
Efficient scalable multi-party private set intersection using oblivious PRF
, Article 17th International Workshop on Security and Trust Management, STM 2021, co-located with the 26th European Symposium on Research in Computer Security, ESORICS 2021, 8 October 2021 through 8 October 2021 ; Volume 13075 LNCS , 2021 , Pages 81-99 ; 03029743 (ISSN); 9783030918583 (ISBN) ; Mohajeri, J ; Salmasizadeh, M ; Sharif University of Technology
Springer Science and Business Media Deutschland GmbH
2021
Abstract
In this paper, we present a concretely efficient protocol for private set intersection (PSI) in the multi-party setting using oblivious pseudorandom function (OPRF). In fact, we generalize the approach used in the work of Chase and Miao [CRYPTO 2020] towards deploying a lightweight multi-point OPRF construction for two-party PSI. Our protocol only includes oblivious transfer (OT) extension and garbled Bloom filter as its main ingredients and avoids computationally expensive operations. From a communication pattern perspective, the protocol consists of two types of interactions. The first type is performed over a star-like communication graph in which one designated party interacts with all...
Weak composite Diffie-Hellman
, Article International Journal of Network Security ; Volume 7, Issue 3 , 2008 , Pages 383-387 ; 1816353X (ISSN) ; Mohajeri, J ; Salmasizadeh, M ; Sharif University of Technology
2008
Abstract
In1985, Shmuley proposed a theorem about intractability of Composite Diffie-Hellman. The theorem of Shmuley may be paraphrased as saying that if there exist a probabilistic polynomial time oracle machine which solves the Diffie-Hellman modulo an RSA-number with odd-order bases then there exist a probabilistic algorithm which factors the modulo. In the other hand Shmuely proved the theorem only for odd-order bases and left the even-order case as an open problem. In this paper we show that the theorem is also true for even-order bases. Precisely speaking we prove that even if there exist a probabilistic polynomial time oracle machine which can solve the problem only for even-order bases still...