Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
IPL
2007
100views more  IPL 2007»
11 years 6 months ago
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility
We study the Kolmogorov complexity of a Binary Insertion Tree, and present a succinct encoding scheme for Binary Insertion Trees produced from incompressible permutations. Based o...
Brendan Lucier, Tao Jiang, Ming Li
PERCOM
2008
ACM
11 years 6 months ago
Randomized Bit Encoding for Stronger Backward Channel Protection in RFID Systems
In this paper, we introduce a randomized bit encoding scheme that can strengthen the privacy protection on RFID tags. This scheme is used together with the backward channel protec...
Tong-Lee Lim, Tieyan Li, Sze-Ling Yeo
CORR
2010
Springer
182views Education» more  CORR 2010»
11 years 6 months ago
Index coding via linear programming
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
Anna Blasiak, Robert D. Kleinberg, Eyal Lubetzky
PKC
2005
Springer
110views Cryptology» more  PKC 2005»
11 years 12 months ago
From Fixed-Length to Arbitrary-Length RSA Encoding Schemes Revisited
To sign with RSA, one usually encodes the message m as ยต(m) and then raises the result to the private exponent modulo N. In Asiacrypt 2000, Coron et al. showed how to build a secu...
Julien Cathalo, Jean-Sébastien Coron, David...
books