Sciweavers

3145 search results - page 49 / 629
» Key Improvements to XTR
Sort
View
TIT
2002
86views more  TIT 2002»
14 years 9 months ago
A low-rate bound on the reliability of a quantum discrete memoryless channel
We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel (DMC) to its quantum counterpart. The key observation that...
Alexander Barg
PKC
2009
Springer
116views Cryptology» more  PKC 2009»
15 years 10 months ago
Improving the Boneh-Franklin Traitor Tracing Scheme
Abstract. Traitor tracing schemes are cryptographically secure broadcast methods that allow identification of conspirators: if a pirate key is generated by k traitors out of a stat...
Pascal Junod, Alexandre Karlov, Arjen K. Lenstra
SASN
2006
ACM
15 years 3 months ago
Diversify sensor nodes to improve resilience against node compromise
A great challenge in securing sensor networks is that sensor nodes can be physically compromised. Once a node is compromised, attackers can retrieve secret information (e.g. keys)...
Abdulrahman Alarifi, Wenliang Du
GLOBECOM
2009
IEEE
15 years 4 months ago
Building Femtocell More Secure with Improved Proxy Signature
—Demand for the femtocell is largely credited to the surge in a more always best connected communication conscious public. 3GPP define new architecture and security requirement f...
Chan-Kyu Han, Hyoung-Kee Choi, In-Hwan Kim
IMC
2005
ACM
15 years 3 months ago
Improving Sketch Reconstruction Accuracy Using Linear Least Squares Method
Sketch is a sublinear space data structure that allows one to approximately reconstruct the value associated with any given key in an input data stream. It is the basis for answer...
Gene Moo Lee, Huiya Liu, Young Yoon, Yin Zhang