Sciweavers

77 search results - page 9 / 16
» Public-Key Cryptosystems from Lattice Reduction Problems
Sort
View
EUROCRYPT
2010
Springer
14 years 8 days ago
A Simple BGN-Type Cryptosystem from LWE
We construct a simple public-key encryption scheme that supports polynomially many additions and one multiplication, similar to the cryptosystem of Boneh, Goh, and Nissim (BGN). S...
Craig Gentry, Shai Halevi, Vinod Vaikuntanathan
AMC
2005
218views more  AMC 2005»
13 years 7 months ago
Cryptanalysis of Lee-Hwang-Li's key authentication scheme
Abstract. Key authentication is very important in secret communications and data security. Recently, Lee, Hwang and Li proposed a new public key authentication scheme for cryptosys...
Fangguo Zhang, Kwangjo Kim
CTRSA
2011
Springer
243views Cryptology» more  CTRSA 2011»
12 years 11 months ago
Better Key Sizes (and Attacks) for LWE-Based Encryption
We analyze the concrete security and key sizes of theoretically sound lattice-based encryption schemes based on the “learning with errors” (LWE) problem. Our main contribution...
Richard Lindner, Chris Peikert
FOCS
2004
IEEE
13 years 11 months ago
Worst-Case to Average-Case Reductions Based on Gaussian Measures
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
Daniele Micciancio, Oded Regev
IJNSEC
2007
118views more  IJNSEC 2007»
13 years 7 months ago
Code-based Ring Signature Scheme
McEliece is one of the oldest known public key cryptosystems, however it was not quite as successful as RSA. One main reason is that it is widely believed that code-based cryptosy...
Dong Zheng, Xiangxue Li, Kefei Chen