نتایج جستجو برای: Combinatorial Scheme

تعداد نتایج: 264394  

Journal: :journal of communication engineering 0
parisa daneshjoo computer engineering department, science and research branch, islamic azad university, tehran, iran hamid haj seyed javadi department of mathematics and computer science, shahed university, tehran, iran hamid reza sharifi computer engineering department, science and research branch, islamic azad university, tehran, iran

sink location is considered as a basic service in geographic routing in wireless sensor networks. obtaining the location of sink node by source node using an efficient method with low complexity has always been a challenging issue in research. in this paper, a sink location algorithm based on fano plane is proposed. the research challenge is how to ensure the intersection of two slq and sla rou...

The establishing of a pairwise key between two nodes for encryption in a wireless sensor network is a challenging issue. To do this, we propose a new deterministic key pre-distribution scheme which has modified the multiple key space scheme (MKSS). In the MKSS, the authors define two random parameters to make better resilience than existing schemes. Instead of a random selection of these parame...

Journal: :journal of advances in computer engineering and technology 2015
hamid haj seyyed javadi mohaddese anzani

key distribution is an important problem in wireless sensor networks where sensor nodesare randomly scattered in adversarial environments.due to the random deployment of sensors, a list of keys must be pre-distributed to each sensor node before deployment. to establish a secure communication, two nodes must share common key from their key-rings. otherwise, they can find a key- path in which ens...

Journal: :Proceedings of the Karelian Research Centre of the Russian Academy of Sciences 2018

Key distribution is an important problem in wireless sensor networks where sensor nodesare randomly scattered in adversarial environments.Due to the random deployment of sensors, a list of keys must be pre-distributed to each sensor node before deployment. To establish a secure communication, two nodes must share common key from their key-rings. Otherwise, they can find a key- path in which ens...

Journal: :Proceedings of the Karelian Research Centre of the Russian Academy of Sciences 2016

2004
Makoto Yokoo Koutarou Suzuki

This paper presents a secure Generalized Vickrey Auction (GVA) scheme that does not require third-party servers, i.e., the scheme is executed only by an auctioneer and bidders. Combinatorial auctions, in which multiple goods are sold simultaneously, have recently attracted considerable attention. The GVA can handle combinatorial auctions and has good theoretical characteristics such as incentiv...

1999
Douglas R. Stinson Ruizhong Wei

Verifiable secret sharing schemes (VSS) are secret sharing schemes dealing with possible cheating by the participants. In this paper, we propose a new unconditionally secure VSS. Then we construct a new proactive secret sharing scheme based on that VSS. In a proactive scheme, the shares are periodically renewed so that an adversary cannot get any information about the secret unless he is able t...

Journal: :archives of razi institute 2016
m.h. motedayen g. nikbakht m.j. rasaee a. zare mirakabadi

human snake bitten poisoning is a serious threat in many tropical and subtropical countries such as iran. the best acceptable treatment of envenomated humans is antivenoms; however they have a series of economic and medical problems and need more improvements. in this study a combinatorial human immunoglobulin gene library against some of iranian snakes venoms was constructed. total rna prepare...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید