Sharif Digital Repository

In this thesis, in addition to reviewing the previous work done in the study of ideal access structures, we present the author's recent results in this field. As a first result, we introduce a new technique for reducing the size of the secret space in ideal homomorphic secret sharing schemes. The concept of decomposition of secret sharing schemes is formally introduced for the first time. In this regard, we show that ideal homomorphic and abelian secret sharing schemes are decomposable. We also examine the inherent group-characterizability of secret sharing schemes and show that an ideal secret sharing scheme is not necessarily inherently group-characterizable. Some weaker definitions of the... 

Voting is a detachable part of the democratic governments. In the era of modern computer systems, the need for electronic voting systems in no longer avoidable.Designing a secure electronic voting system is a difficult problem since both privacy and integrity must be achieved at the same time. This difficulty has cast the problem to the center of attention of many researchers.In this thesis we will consider the new generation of voting systems known as end-to-end that were designed to solve the problems in the previous generations of voting systems and to uphold the security of the system. Many of end-toend voting systems use concepts of cryptography in addition to machine tools.A central... 

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

A secret sharing scheme is a way to share a secret between a group of people so that only authorized subsets can retrieve the original secret. Secret sharing schemes were first introduced by Shamir and Blakley for threshold access structures. In a threshold access structure, a subset of individuals is allowed if the number of members exceeds a predetermined threshold. After Shamir, the study of general access structures was considered, and Ito, Saito, and Nishizeki proposed a way to construct a secret sharing scheme for these structures. Reducing the length of party's share in secret-sharing schemes and finding the optimal scheme for access structures has long been the focus of researchers... 

Determining the value of optimal information ratio for a given access structure and finding the upper and lower bounds for the information ratio in secreet sharing is one of the main problems that has been studied over time. In this thesis, we have tried to introduce the tools used in this field, including polymatroids and Shannon’s inequalities, linear programming, decomposition and etc, examine the papers presented in this field and rewrite obtained results in a simpler way  

Electron states of diamond vacancy under stress were studied theoretically. The generalized Hubbard model is used to calculate the electrons energy levels. The results shows that the degeneracy of some levels (T, with triple space degeneracy) reduced to levels with lower degeneracy (E, with double space degeneracy and A, without degeneracy). Besides this spiting of degeneracy the energy of all states changed and therefore the transition energy between these states changed too. Jahn-Teller effect was observed  

Dynamic searchable encryption schemes enable keyword search query and update operations on encrypted data. One of their applications is to use them in cloud storage services that allow the client to store, search and update data on an external server. Due to the importance of efficiency in real-world applications, retrieving information in searchable schemes involves leakage of some information such as search and access patterns. However, with the addition of update operations (insertion and deletion), more leakages are considered for these schemes. In this regard, reducing the amount of information disclosed to the server is necessary. For this purpose, forward and backward security... 

Genome sequencing is one of the fundamental problems in today’s Biology. It has applications in significant problems such as finding association between an individual’s genome sequence and his phenotypes, discovering new genes, and finding evolutionary relations between organisms. Following the rapid advances in sequencing technologies and generation of a huge amount of short reads, efficient computational tools are needed for processing sequencing data. Shortness of reads is a factor that makes the task of reconstructing repetitive genomic regions complicated. In fact, the main challenge in both sequencing and resequencing problems is reconstruction of repeat regions. Common resequencing... 

Real-time asynchronous data fusion for high-speed phenomena is an important and challenging task in the sensor networks. Examples of data fusion applications in sensor networks are: managing the traffic of maneuvering airplanes and ground vehicles in airside areas of an airport, traffic management in streets and roads, Driver Assistance Systems, guidance of antiaircraft and antimissile missiles. In all the data fusion applications the estimation of the required variables is necessary.
In this research two methods are introduced for real-time asynchronous data fusion, especially for track-to-track fusion of high-speed phenomena in sensor networks. The effectiveness and usability of these... 

One of the main requirements in today’s computer networks such as the Internet is protecting the privacy of users. Hence, anonymity is a useful tool for privacy and provides user’s anonymity. So far, several protocols have been designed to provide anonymity but most of the times, attackers found a way to take advantage of weaknesses in the design and implementation of these protocols. There is a class of attacks,where attacker tries to relate clients of anonymity system to each other, regardless of the communication protocols they use, just by observing networks traffic.The MIX technique forms the basis of many popular ervices that offer anonymity of communication in open and shared networks... 

Using “Searchable Encryption” enables us to encrypt the data, while preserving the possibility of running search queries. One of the most important applications of the mentioned is in Cloud Storage. As users do not trust the Cloud space, they are not inclined to store their data on the Could. The solution to this problem is of course, Cryptography. However, ordinary Cryptography methods, eliminate the data’s searchability. Hence, we need encryption schemes that code the data while retaining their searchability. So far, various schemes has been proposed that differ in their performance, security level, and usage. In this thesis, we aim to discuss and analyze these methods  

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

In recent years, different cryptographic tools have been introduced for a wide range of cloud computing applications that can be classified based on a trade-off between performance and security. In this thesis, we introduced the private set operation schemes, and at their heart, private set intersection schemes, in the cloud computing platform. These schemes are of particular importance because they can be used as basic cryptographic schemes for a wide range of functionalities in the cloud platform. Using these schemes, the user can securely store datasets on the cloud, run set queries remotely and receive the desired results. To this end, we first modeled the syntax and the security notions... 

Designing efficient and secure electronic voting protocols without the presence of trusted authorities, which are known as decentralized voting protocols, is one of the most interesting and challenging problems in cryptography. In these protocols the outcome of the protocol is determined by voters collaborating with each other. Since voting is a significant concept in every society, the correctness and security of voting protocols are important. For security analysis of electronic voting protocols, an intuitive proof is not enough and we require a comprehensive approach that provides provable security. In this thesis, we use universal composition framework to analyze a decentralized e-voting... 

In the present work, trajectory optimization of the Dual-Arm Cam-Lock robot considering kinematic and dynamic redundancy is performed. First, the optimal control problem is solved only considering kinematic redundancy and then is solved considering dynamic redundancy. General form of the dynamic model for the system is developed using Lagrangian relations. Global optimization method is used for redundancy resolution problem. A performance index is defined based on the consumed kinetic energy and is minimized through a desired trajectory using the global optimization method. Formulations of optimal control problem are derived and initial boundary problem is changed to two point boundary value... 

Due to vast use of Ametryn herbicide in agricultural and even non-agricultural activities and the possibility of contamination of carp and natural water sources by this herbicide, determination of this herbicide in surface and ground water sources is very important. Therefor introducing simple and sensitive method for determination of Ametryn is critical.
This study demonstrate a simple and sensitive colorimetric method for the detection and determination of Ametryn based on aggregation of citrate capped AuNPs. Studied method relies upon shape and distance dependent AuNPs surface plasmon resonance. By replacing the sulfide containing Ametryn herbicide with citrate molecules on AuNPs... 

Side channel attacks, where an attacker learns some physical information about the state of a device, are one of the ways in which cryptographic schemes are broken in practice. leakage resilient ryptography addressed this issue at a higher abstraction level, proposing models capturing such attacks. Auxiliary Input is one of these models. In this thesis, we study public-key encryption schemes in this model of leakage. we also propose a method to consider this leakage continuously (i.e., not just one observation of the adversary). at the end, we consider the leakage from both the secret key owner and the encryptor. This odel captures a wider class of side-channel attacks  

Automotive brake pad is one of the most widely used composites. Commonly, more than 10 components are applied to make these materials and due to the large number of components and interactions between them, choice, explaination of the behavior and optimization of brake friction materials are some industry's challenges. Until now, some methods have been presented to design and optimization of these materials, but due to different complexities, there is lack of practical method that could be used for explaining the tribological behavior, engineering calculation and optimization of brake friction materials. Today, formulation of the current brake pads in the industry has mainly come from trial... 

According to increasing energy demand in Iran and the world, the role of natural gas as a relatively clean and cost-effective source has received more attention. Given the high share of the residential sector in the country's natural gas consumption, providing a model for forecasting the demand of this sector is of great importance for policy makers and decision makers in this field. In the present study, we employ three popular methods of machine learning, support vector regression, artificial neural network and decision tree to predict the consumption of natural gas in the residential sector in Tehran according to meteorological parameters (including temperature, precipitation and wind... 

The Gaussian mixture (cardinalized) probability hypothesis density (GM-(C)PHD) filter is a closed form approximation of multi-target Bayes filter which can overcome most of multi-target tracking problems. Limited field of view, decreasing cost of cameras and its advances induce us to use large-scale camera networks. Increasing the size of camera networks make centralized networks practically inefficient. On the other hand, scalability, simplicity and low data transmission cost has made distributed networks a good replacement for centralized networks. However, data fusion in distributed network is sub-optimal due to unavailable cross-correlation.Among data fusion algorithms which deal with...