Sharif Digital Repository

Now days titanium dioxide is used in different applications because of its good electrical properties, optical stability and cost savings. According to their different nanoscale TiO2 structures, it has been determined that 1D structures such as nanorods, nanotubes and nanowires has better properties than the other structures, including enhancing electron transport and create an offered directional way of transporting of the electrons. However, the grain boundaries in polycrystalline TiO2 nanowires or nanotubes cause electron scattering or trapping, which limit their application in optoelectronics. From these TiO2 structures, TiO2 nanorods have special importance because of less defects... 

OFDM is a multicarrier modulation scheme with high bandwidth efficiency and robustness to multipath environment used in high data rate transmission. However, a drawback of this system is the large Peak-to-Average-Power Ratio (PAR) of the transmit signal which makes its straightforward implementation quite costly. PAR in an OFDM based system can be reduced significantly by PTS method for which data recovery requires side information (SI) about the phases used at transmitter. Sending SI, not only reduces the rate, but also increases BER, for any error in SI detection can damage a large amount of transmitted information. By introducing a new phase set, we propose a PTS based method for MPSK... 

In this paper, the behavior of a fractional order Van der Pol-like oscillator is investigated using a describing function method. A parametric function for the boundary between oscillatory and nonoscillatory regions of this system is extracted. The analytical results are evaluated by numerical simulations which demonstrate sufficient reliability of the proposed analyzing method  

The cooperative relay cognitive interference channel (RCIC) is a four-node network with two source nodes (primary source and cognitive source) and two destination nodes, in which sources try to communicate at certain rates with their corresponding destinations simultaneously through a common medium and each destination can act as a relay to assist the other one. For the partially cooperative RCIC (PC-RCIC), in which only one of the destinations (corresponding to the cognitive source) acts as a relay, we derive an achievable rate region based on using rate splitting and superposition coding at the cognitive source, and using decode-and-forward scheme at the relay. For the degraded PC-RCIC, we... 

This paper is devoted to the analysis of fractional order Van der Pol system studied in the literature. Based on the existing theorems on the stability of incommensurate fractional order systems, we determine parametric range for which a fractional order Van der Pol system with a specific order can perform as an undamped oscillator. Numerical simulations are presented to support the given analytical results. These results also illuminate a main difference between oscillations in a fractional order Van der Pol oscillator and its integer order counterpart. We show that contrary to integer order case, trajectories in a fractional Van der Pol oscillator do not converge to a unique cycle. © 2009... 

In this letter, we surpass the jamming effect and also estimate the jamming channel state information by using Kalman filtering (KF) approach. Furthermore, we design a closed-form beamforming weight for maximizing the achievable rate subject to the condition that the total relays power transmission would be below a predefined threshold level, which is formulated as a Quadratically Constrained Quadratic Program (QCQP). Simulation results show efficient performance of the proposed method for different destruction powers of jammer by achieving the Cramer Rao Lower Bound (CRLB). IEEE  

Strong Designated Verifier Signature (SDVS) provides authentication for the signer and the verifier such that the signer is assured that what s/he has signed, is only verified by the designated verifier. Currently, the security of most of the SDVS schemes is based on hard problems in the number theory. As it is proved that all kinds of cryptosystems which are based on the number theory will not tolerate quantum attacks, here, an SDVS scheme based on hard problems in coding theory is presented. We have proved that the suggested scheme is unforgeable under a chosen message attack in Random Oracle Model. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd  

In this letter, we surpass the jamming effect and also estimate the jamming channel state information by using the Kalman filtering approach. Furthermore, we design a closed-form beamforming weight for maximizing the achievable rate subject to the condition that the total relays power transmission would be below a predefined threshold level, which is formulated as a quadratically constrained quadratic program. Simulation results show the efficient performance of the proposed method for different destruction powers of the jammer by achieving the Cramér-Rao lower bound. © 1997-2012 IEEE  

In a cloud storage service, public auditing mechanisms allow a third party to verify integrity of the outsourced data on behalf of data users without the need to retrieve data from the cloud server. Recently, Shen et al. proposed a new lightweight and privacy preserving cloud data auditing scheme which employs a third party medium to perform time-consuming operations on behalf of users. The authors have claimed that the scheme meets the security requirements of public auditing mechanisms. In this paper, we show that Shen et al.'s scheme is insecure by proposing two attacks on the scheme. In the first attack, an outside adversary can modify some messages in transmission to the cloud server... 

Cloud storage has significantly reduced data management costs for data owners. However, loss of physical control over the data after outsourcing, triggers some security concerns such as data integrity. Provable Data Possession (PDP) protocols, enable data owners to audit the integrity of their outsourced data without the need to retrieve the file from cloud server. However, most existing PDP schemes require resource-constrained users to perform costly operations for generating metadata on file blocks. In online/offline PDP mechanisms introduced most recently, the user’s computation is divided into online/offline phases, where the costly operations are allowed to be carried out in the offline... 

Data sharing is considered as a favorite service provided by cloud storage servers in which the stored data is shared among a group of users. However, auditing such shared data is a big security issue for cloud users. In this paper, we propose an ID-Based public shared data integrity auditing scheme, in which all the group users are able to update, delete or insert new blocks into the shared data. Besides, the cloud server can revoke a misbehaving user with a minimum overhead. The scheme is secure against an untrusted cloud server and also preserves data privacy against the public verifier. Furthermore, overhead analysis shows the efficiency of proposed scheme in comparison to the existing... 

Cloud storage auditing is considered as a significant service used to verify the integrity of data stored in public cloud. However, most existing auditing protocols suffer form complex certificate management/verification since they rely on expensive Public Key Infrastructure (PKI). On the other hand, most cloud users have constrained computational resources. The few existing ID-based storage auditing protocols in the literature, require resource-constrained users to perform costly operations for generating metadata on file blocks. In this paper, we propose a storage auditing protocol which benefits from ID-based structure and lightweight user computations, simultaneously. Our construction... 

In this paper, we investigate reliable transmission of three correlated discrete memoryless sources over a two-relay network. In our considered model, one of the sources is available at the sender whereas, the other two sources are known to the first and the second relay. We present both joint and separate source-channel coding schemes, and derive the corresponding sets of sufficient conditions for reliable sources transmission. The manner of cooperation in both schemes is Decode-and-Forward strategy. In the joint approach, we generalize the correlation preserving mapping technique to our model using nested backward decoding. Our proposed separate approach is based on Slepian-Wolf source... 

The great attention to cognitive radio networks (CRNs) in recent years, as a revolutionary communication paradigm that aims to solve the problem of spectrum scarcity, prompts serious investigation on security issues of these networks. One important security concern in CRNs is the preservation of users location privacy, which is under the shadow of threat, especially in database-driven CRNs. To this end, in this paper, we propose a Location Privacy Preserving Database-Driven Spectrum-Sharing (L-PDS 2) protocol for sharing the spectrum between PUs and SUs in a database-driven CRN, while protecting location privacy of both primary and secondary users, simultaneously. We also present two... 

Since their introduction, Cognitive Radio Networks (CRN), as a new solution to the problem of spectrum scarcity, have received great attention from the research society. An important field in database-driven CRN studies is pivoted on their security issues. A critical issue in this context is user’s location privacy, which is potentially under serious threat. The query process by secondary users (SU) from the database is one of the points where the problem rises. In this paper, we propose a Privacy-Preserving Query Process (PPQP), accordingly. This method lets SUs deal in the process of spectrum query without sacrificing their location information. Analytical assessment of PPQP’s privacy... 

In this paper, an adaptive channel estimation algorithm is proposed for the multi-user robust relay beamforming problem. We propose a norm-bounded channel uncertainty model for all of the channels. We employ the Extended Kalman Filter (EKF) and the Unscented Kalman Filter (UKF) for joint estimation of channel coefficients and beamforming weights, and propose a Markov model for source-relay and relay-destination channels as well as the beamforming weights in the relays. The channel coefficients and bemforming weights are shown to be well-estimated in order to minimize the total relays power transmission subject to worst-case signal to interference and noise ratio (SINR) criterion at each... 

In this paper, we study the problem of secret communication over a Compound Multiple Access Channel (MAC). In this channel, we assume that one of the transmitted messages is confidential that is only decoded by its corresponding receiver and kept secret from the other receiver. For this proposed setting (compound MAC with confidential messages), we derive general inner and outer bounds on the secrecy capacity region. Also, as examples, we investigate 'Less noisy' and 'Gaussian' versions of this channel, and extend the results of the discrete memoryless version to these cases. Moreover, providing numerical examples for the Gaussian case, we illustrate the comparison between achievable rate... 

One of the approaches to modify the McEliece cryptosystem to overcome its large key size is replacing binary Goppa codes with a new structured code. However, this modification makes such cryptosystems encounter some new attacks. There are a few modified McEliece cryptosystem variants which are known to be secure. One of them is the cryptosystem introduced by Baldi et al. which uses quasi-cyclic low-density parity check (QC-LDPC) codes. This cryptosystem is still unbroken as no efficient attack has been reported against it since 2008. In this study, an attack has been applied to this cryptosystem which is feasible when the code length is a multiple of a power of 2. Also an important weakness... 

In this paper, we study the problem of secret communication over a compound Multiple Access Channel (MAC). In this channel, we assume that one of the transmitted messages is confidential, which is only decoded by its corresponding receiver and kept secret from the other receiver. We call this proposed setting the compound MAC with a confidential message. For this model, we derive general inner and outer bounds for both imperfect and perfect secrecy conditions for the second receiver. Also, as examples, we investigate less noisy and Gaussian versions of this channel, and extend the results of the discrete memoryless version to these cases. Moreover, providing numerical examples for the... 

The authors study the problem of secret communication over a multiple-access channel with a common message. Here, the authors assume that two transmitters have confidential messages, which must be kept secret from the wiretapper (the second receiver), and both of them have access to a common message which can be decoded by the two receivers. The authors call this setting as multiple-access wiretap channel with common message (MAWC-CM). For this setting, the authors derive general inner and outer bounds on the secrecy capacity region for the discrete memoryless case and show that these bounds meet each other for a special case called the switch channel. As well, for a Gaussian version of...