9 search results - page 2 / 2 » Lattice-Based Cryptography |
TCC
2010
Springer
14 years 2 months ago
2010
Springer
We present a variant of Regev’s cryptosystem first presented in [Reg05], but with a new choice of parameters. By a recent classical reduction by Peikert we prove the scheme sema...
ASIACRYPT
2010
Springer
13 years 3 months ago
2010
Springer
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
CRYPTO
2009
Springer
14 years 2 days ago
2009
Springer
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
PKC
2007
Springer
13 years 11 months ago
2007
Springer
At PKC 2003 Paeng, Jung, and Ha proposed a lattice based public key cryptosystem(PJH). It is originated from GGH, and designed as a hybrid of GGH and NTRUEncrypt in order to reduce...