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

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

Journal: :CoRR 2010
Naqueeb Warsi Rahul Vaze Tapan Shah

For a single transmit and receive antenna system, a new constellation design is proposed to combat errors in the phase estimate of the channel coefficient. The proposed constellation is a combination of PSK and PAM constellations, where PSK is used to provide protection against phase errors, while PAM is used to increase the transmission rate using the knowledge of the magnitude of the channel ...

Journal: :CoRR 2014
S. Nagaraja C. J. Prabhakar P. U. Praveen Kumar

In this paper, we present feature-based technique for construction of mosaic image from underwater video sequence, which suffers from parallax distortion due to propagation properties of light in the underwater environment. The most of the available mosaic tools and underwater image mosaicing techniques yields final result with some artifacts such as blurring, ghosting and seam due to presence ...

2008
Maguelonne Héritier Samuel Foucher Langis Gagnon

Approach we have tested in our submitted runs. Our approach consists in finding links between video shot key-frames, based on the use of a probabilistic latent space model over local matches between the keyframe images. This allows the extraction of significant groups of local matching descriptors that may represent common characteristic elements of near duplicate key-frames. This is combined w...

Journal: :IACR Cryptology ePrint Archive 2005
Mahalingam Ramkumar

We introduce an efficient random key pre-distribution scheme (RKPS) whose performance is 2 to 3 orders of magnitude better than schemes of comparable complexity in the literature. This dramatic improvement is achieved by increasing insecure storage complexity (for example using external flash memory). The proposed scheme is a combination of the Kerberos-like key distribution scheme (KDS) propos...

پایان نامه :دانشگاه تربیت معلم - تهران - دانشکده روانشناسی و علوم تربیتی 1391

the purpose of this study was the relationship between problem – solvi ability with fdi cognitive style of students.the research method was correlation method. for data analysis pearson test was used. statistical society in this research was all the students of alligoodarz city in 1391-92 year.to sampling of statiscal population was used sampling multi-stage random the size of sample selected 2...

Journal: :Int. J. Pervasive Computing and Communications 2004
Ramaraju Kalidindi Vamsi Paruchuri Shivakumar Basavaraju Cariappa Mallanda Archit Kulshrestha Lydia Ray Rajgopal Kannan Arjan Durresi S. Sitharama Iyengar

Security in sensor networks is more important than traditional networks as they are deployed in hostile environments and are more prone to capture. Trusted third party authentication schemes, public-key systems are not suitable owing to their high resource requirements. Key pre-distribution was introduced in [3] to solve this problem. Our scheme achieves identical connectivity compared to the r...

Journal: :isecure, the isc international journal of information security 0
p. rastegari department of electrical and computer engineering, isfahan university of technology, isfahan, iran m. berenjkoub department of electrical and computer engineering, isfahan university of technology, isfahan, iran

certificateless public key cryptography (cl-pkc) is a useful method in order to solve the problems of traditional public key infrastructure (i. e. large amount of computation, storage and communication cost for managing certificates) and id-based public key cryptography (i. e. key escrow problem), simultaneously. a signcryption scheme is an important primitive in cryptographic protocols which p...

Journal: :Journal of Computer Science 2006

2016
Nazmul Islam M. A. Moyeen

The ample use of Wireless Sensor Network demands highly effective security mechanism for its sound operation in any hostile environment. The security of encrypted information greatly dependents on the rigidity of underlying Key Management techniques. Hence, key management becomes the most significant issue in case of security of Wireless Sensor Networks. The purpose of this paper is to assess m...

Journal: :IMA J. Math. Control & Information 2015
Efraim Laksman Håkan Lennerstad Magnus Nilsson

This paper generalizes previous optimal upper bounds on the minimum Euclidean distance for phase shift keying (PSK) block codes, that are explicit in three parameters: alphabet size, block length and code size. The bounds are primarily generalized from codes over symmetric PSK to codes over asymmetric PSK and also to general alphabet size. Furthermore, block codes are optimized in the presence ...

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

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