Sciweavers

4212 search results - page 78 / 843
» On Compressible Pairings and Their Computation
Sort
View
CANS
2008
Springer
86views Cryptology» more  CANS 2008»
15 years 2 months ago
Chosen-Ciphertext Secure Proxy Re-encryption without Pairings
Proxy re-encryption (PRE), introduced by Blaze, Bleumer and Strauss, allows a semi-trusted proxy to convert a ciphertext originally intended for Alice into an encryption of the sa...
Robert H. Deng, Jian Weng, Shengli Liu, Kefei Chen
INFOCOM
2012
IEEE
13 years 3 months ago
Jointly optimal bit loading, channel pairing and power allocation for multi-channel relaying
Abstract—We aim to enhance the end-to-end rate of a general dual-hop relay network with multiple channels and finite modulation formats, by jointly optimizing channel pairing, p...
Mahdi Hajiaghayi, Min Dong, Ben Liang
96
Voted
IWOCA
2009
Springer
104views Algorithms» more  IWOCA 2009»
15 years 7 months ago
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
Evaggelos Lappas, Stavros D. Nikolopoulos, Leonida...
107
Voted
FROCOS
2007
Springer
15 years 6 months ago
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
Abstract. Innermost context-sensitive rewriting has been proved useful for modeling computations of programs of algebraic languages like Maude, OBJ, etc. Furthermore, innermost ter...
Beatriz Alarcón, Salvador Lucas
107
Voted
ADHOCNOW
2006
Springer
15 years 6 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