Mehrdad Nojoumian

Learn More
We introduce the notion of a Social Secret Sharing Scheme, in which shares are allocated based on a player’s reputation and the way he interacts with other participants. During the social tuning phase, weights of players are adjusted such that participants who cooperate will end up with more shares than those who defect. Alternatively, newcomers are able to(More)
We first review the notion of social secret sharing and its trust function. We then illustrate how this construction can be used in cloud computing to create a self-organizing environment. In fact, we show distributed secure systems using threshold secret sharing can be adjusted automatically based on the resource availability of the cloud providers.(More)
In a threshold scheme, the sensitivity of the secret as well as the number of players may fluctuate due to various reasons, e.g., mutual trust may vary or the structure of the players’ organization might be changed. A possible solution to this problem is to modify the threshold and/or change the secret. Moreover, a common problem with almost all secret(More)
This article proposes efficient solutions for the construction of sealed-bid second-price and combinatorial auction protocols in an active adversary setting. The main reason for constructing secure auction protocols is that the losing bids can be used in the future auctions as well as negotiations if they are not kept private. Our motivation is to apply(More)
The research presented in this paper aims at facilitating the creation of knowledge bases (KBs) for software specifications, of which the UML superstructure specification is our initial target. Our motivation is that such specifications are dense, repetitive and difficult to use. They are written primarily in semi-structured text, but the structure must be(More)
The concept of social secret sharing was introduced in 2010 by Nojoumian et al. In Nojoumian et al.’s scheme (called SSS), the number of shares allocated to each party depends on the player’s reputation and the way he interacts with other parties. In other words, weights of the players are periodically adjusted such that cooperative participants receive(More)
This paper aims at the trust calculation in social networks by addressing some major issues: Firstly, the paper evaluates a specific trust function and its behaviors, and then it focuses on the modification of that trust function by considering diverse scenarios. After that, the paper proposes a new approach with a specific functionality. The main goals are(More)
Rational secret sharing was proposed by Halpern and Teague in [12]. The authors show that, in a setting with rational players, secret sharing and multiparty computation are only possible if the actual secret reconstruction round remains unknown to the players. All the subsequent works use a similar approach with different assumptions. We change the(More)