Sharif Digital Repository

In cloud storage services, public auditing mechanisms allow a third party to verify integrity of the outsourced data on behalf of data owners without the need to retrieve data from the cloud server. In some applications, the identity of data users should be kept private from the third party auditor. Oruta is a privacy preserving public auditing scheme for shared data in the cloud which exploits ring signatures to protect the identity privacy. In this paper, we propose two attacks and demonstrate that the scheme is insecure and a dishonest server can arbitrarily tamper the outsourced data without being detected by the auditor. We also propose a solution to remedy this weakness with the... 

As data sharing has become one of the most popular services offered by cloud storage, designing public auditing mechanisms for integrity of shared data becomes more important. Two problems which arise in shared data auditing include preserving users identity and collusion resistant revocation of users. When data stored at the cloud is shared among a group of users, different users may modify and sign different data blocks which leaks signer identities to the public verifier. Also, when a user is revoked from the group, signatures generated by this user should be re-signed by the cloud server using re-signature keys. In addition, collusion of cloud server and the revoked user should leak no... 

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... 

Broadcast encryption is a novel concept for sending a special message to a subset of users. In broadcast encryption schemes, the distribution center broadcasts the message in encrypted form and expect that only the intended users be able to decrypt the message. This concept has several applications such as pay-per-service TVs. In this paper, we investigate one of the most recent broadcast encryption schemes and show that the introduced scheme does not provide the main requirement of broadcast encryption schemes. For this purpose, we demonstrate that all of the users, including authorized and unauthorized users, can decrypt the broadcasted encrypted message. © 2016 IEEE  

Modeling and analysis of information system vulnerabilities helps us to predict possible attacks to networks using the network configuration and vulnerabilities information. As a fact, exploiting most of vulnerabilities result in access rights alteration. In this paper, we propose a new vulnerability analysis method based on the Take-Grant protection model. We extend the initial Take-Grant model to address the notion of vulnerabilities and introduce the vulnerabilities rewriting rules to specify how the protection state of the system can be changed by exploiting vulnerabilities. Our analysis is based on a bounded polynomial algorithm, which generates the closure of the Take-Grant graph... 

We study the translocation of stiff polymers through a nanopore, driven by the chemical-potential gradient exerted by binding proteins (chaperones) on the trans side of the pore. Bound chaperones prevent backsliding through the pore and, therefore, partially rectify the polymer passage. We show that the sequence of chain monomers with different binding affinity for the chaperones significantly affects the translocation dynamics. In particular, we investigate the effect of the nearest-neighbor adjacency probability of the two monomer types. Depending on the magnitude of the involved binding energies, the translocation speed may either increase or decrease with the adjacency probability. We... 

Combining the advection-diffusion equation approach with Monte Carlo simulations we study chaperone driven polymer translocation of a stiff polymer through a nanopore. We demonstrate that the probability density function of first passage times across the pore depends solely on the Péclet number, a dimensionless parameter comparing drift strength and diffusivity. Moreover it is shown that the characteristic exponent in the power-law dependence of the translocation time on the chain length, a function of the chaperone-polymer binding energy, the chaperone concentration, and the chain length, is also effectively determined by the Péclet number. We investigate the effect of the chaperone size on... 

The amount of rippling in graphene sheets is related to the interactions with the substrate or with the suspending structure. Here, we report on an irreversibility in the response to forces that act on suspended graphene sheets. This may explain why one always observes a ripple structure on suspended graphene. We show that a compression-relaxation mechanism produces static ripples on graphene sheets and determine a peculiar temperature Tc, such that for T