نتایج جستجو برای: distribution key

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

1988
Kenji Koyama Kazuo Ohta

At Crypto-87 conference, we proposed identity-based key distribution systems for generating a common secret conference key for two or more users. Protocols were shown for three configurations: a ring, a complete graph, and a star. Yacobi has made an impersonation attack on the protocols for the complete graph and star networks. This paper proposes improved identity-based key distribution protoc...

Journal: :CoRR 2014
Pratik P. Chaphekar

This paper presents a survey of key distribution schemes for wireless sensor networks. This survey includes the new approach of key distribution using the piggy bank method. Different Network architectures and different key pre-distribution schemes are described. The survey includes the use of the piggy bank approach to cryptography in which part of the key is pre-distributed and the remainder ...

Journal: :Comput. J. 2012
Chuan-Gang Liu Chih-Hung Chao Chih-Wen Leou Jung-Shian Li

2007
Takashi Uehara Yoh Iwasa Hisashi Ohtsuki

Questions: What determines the duration of conventional display in animal contests? Mathematical method: Evolutionarily stable probability distribution of display duration is calculated mathematically. Key assumptions: Display lasts until one of the contestants chooses to fight or flee. The outcome of fighting between two contestants is determined by their relative strength, which is unknown at...

Journal: :Computer Networks and ISDN Systems 1994
Borka Jerman-Blazic Denis Trcek Tomaz Klobucar Franc Bracun

Journal: :Australasian J. Combinatorics 1993
Christine M. O'Keefe

Many problems in information security can be resolved using combinatorial structures, primarily geometries. In fact, often the most efficient solutions kn'awn are provided by schemes based on geometries. In this expository article we look at two problems in information security and discuss proposed geometrical solutions. In addition, we generalise two known constructions for Key Distribution Pa...

Journal: :IEEE Trans. Information Theory 1996
Amos Beimel Benny Chor

A (g; b) key distribution scheme allows conferences of g users to generate secret keys, such that disjoint coalitions of b users cannot gain any information on the generated key (in the information theoretic sense). In this work, we study the relationships between communication and space eeciency of key distribution schemes. We prove that communication does not help in the context of unrestrict...

Journal: :IACR Cryptology ePrint Archive 2004
Junghyun Nam Seungjoo Kim Dongho Won

Very recently, Jung, Paeng and Kim [IEEE Communications Letters, Vol 8, No 7, pp 446–448, July 2004] have demonstrated the insecurity of Xu and Tilborg’s ID-based conference key distribution scheme, and in addition, have revised the scheme to fix the security flaws discovered by them. However, in this paper, we show that Jung-Paeng-Kim’s revised scheme is still insecure since it is vulnerable t...

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

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