Sciweavers

Share
CORR
2011
Springer
176views Education» more  CORR 2011»
8 years 1 months ago
Decoding by Embedding: Correct Decoding Radius and DMT Optimality
—In lattice-coded multiple-input multiple-output (MIMO) systems, optimal decoding amounts to solving the closest vector problem (CVP). Embedding is a powerful technique for the a...
Cong Ling, Shuiyin Liu, Laura Luzzi, Damien Stehl&...
IJACT
2008
158views more  IJACT 2008»
8 years 6 months ago
Efficient lattice-based signature scheme
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...
Thomas Plantard, Willy Susilo, Khin Than Win, Qion...
IMA
1999
Springer
108views Cryptology» more  IMA 1999»
8 years 10 months ago
Tensor-Based Trapdoors for CVP and Their Application to Public Key Cryptography
We propose two trapdoors for the Closest-Vector-Problem in lattices (CVP) related to the lattice tensor product. Using these trapdoors we set up a lattice-based cryptosystem which ...
Roger Fischlin, Jean-Pierre Seifert
STACS
2004
Springer
8 years 11 months ago
Lattices with Many Cycles Are Dense
Abstract We give a method for approximating any n-dimensional lattice with a lattice Λ whose factor group Zn /Λ has n − 1 cycles of equal length with arbitrary precision. We al...
Mårten Trolin
ACISP
2004
Springer
8 years 12 months ago
Weak Property of Malleability in NTRUSign
A new type of signature scheme, called NTRUSign, based on solving the approximately closest vector problem in a NTRU lattice was proposed at CT-RSA’03. However no security proof ...
SungJun Min, Go Yamamoto, Kwangjo Kim
FOCS
2005
IEEE
9 years 2 days ago
Hardness of Approximating the Closest Vector Problem with Pre-Processing
d Abstract] Mikhail Alekhnovich ∗ Subhash A. Khot † Guy Kindler ‡ Nisheeth K. Vishnoi § We show that, unless NP⊆DTIME(2poly log(n) ), the closest vector problem with pre-...
Mikhail Alekhnovich, Subhash Khot, Guy Kindler, Ni...
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
9 years 6 months ago
Lattice problems and norm embeddings
We present reductions from lattice problems in the 2 norm to the corresponding problems in other norms such as 1, (and in fact in any other p norm where 1 p ). We consider latt...
Oded Regev, Ricky Rosen
books