437 search results - page 26 / 88 » Randomized Lattice Decoding |
STOC
2005
ACM
16 years 1 days ago
2005
ACM
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
103
click to vote
COMBINATORICS
2000
14 years 11 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
AML
2006
14 years 11 months ago
2006
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
158
click to vote
PKC
2011
Springer
14 years 2 months ago
2011
Springer
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
GLOBECOM
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract—This paper studies large randomly spread directsequence code-division multiple-access system operating over a block fading multipath channel. Channel knowledge is obtain...