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

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

2008
Joseph M. Renes

We study the advantages to be gained in quantum key distribution (QKD) protocols by combining the techniques of local randomization, or noisy preprocessing, and structured (nonrandom) block codes. Extending the results of [Smith, Renes, and Smolin, quant-ph/0607018] pertaining to BB84, we improve the best-known lower bound on the error rate for the 6-state protocol from 14.11% for local randomi...

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: :IEICE Transactions 2008
Jung Yeon Hwang Jongin Lim Dong Hoon Lee

Jeong et al. recently have proposed a strong ID-based key distribution scheme in order to achieve security against long-term key reveal and session state reveal attacks. In this letter, we show that, unfortunately, the ID-based key distribution scheme is vulnerable to an impersonation attack such that anyone can manipulate public transcripts generated by a user to impersonate the original user....

2017
Philip Chan Itzel Lucio-Martínez Xiaofan Mo Wolfgang Tittel

Journal: :Computer Standards & Interfaces 2005
Qiang Tang Chris J. Mitchell

In this paper we consider the security of two recently proposed anonymous conference key distribution schemes. We show that neither scheme is as practical as the authors claim and that, in certain circumstances, both schemes also suffer from security vulnerabilities. We also show that the attack described in one paper is invalid.

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

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

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