Sciweavers

199 search results - page 8 / 40
» Higher-Order Critical Pairs
Sort
View
IJNSEC
2006
113views more  IJNSEC 2006»
13 years 7 months ago
An Identity-based Mediated Signature Scheme from Bilinear Pairing
It has always been a critical issue to find efficient methods for fast revocation of a user's identity in identity (ID)based cryptosystems. Unfortunately, none of the previou...
Xiangguo Cheng, Lifeng Guo, Xinmei Wang
ADHOCNOW
2006
Springer
14 years 1 months ago
Improved Pairing Protocol for Bluetooth
Abstract. The Bluetooth wireless technology realizes a low-cost shortrange wireless voice- and data-connection through radio propagation. Bluetooth also has a security architecture...
Dave Singelée, Bart Preneel
TALG
2008
131views more  TALG 2008»
13 years 7 months ago
Kinetic and dynamic data structures for closest pair and all nearest neighbors
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
KBSE
2010
IEEE
13 years 6 months ago
An automated approach for finding variable-constant pairing bugs
Named constants are used heavily in operating systems code, both as internal flags and in interactions with devices. Decision making within an operating system thus critically de...
Julia L. Lawall, David Lo
SOUPS
2009
ACM
14 years 2 months ago
Usability and security of out-of-band channels in secure device pairing protocols
Initiating and bootstrapping secure, yet low-cost, ad-hoc transactions is an important challenge that needs to be overcome if the promise of mobile and pervasive computing is to b...
Ronald Kainda, Ivan Flechais, A. W. Roscoe