Sciweavers

140 search results - page 22 / 28
» Public Key Cryptosystems Based on Chaotic-Chebyshev Polynomi...
Sort
View
IJNSEC
2007
128views more  IJNSEC 2007»
14 years 10 months ago
LFSR-based Signatures with Message Recovery
In order to reduce key sizes and bandwidth, several LFSRbased (linear feedback shift register) public key cryptosystems and signature schemes have been proposed. Digital signature...
Xiangxue Li, Dong Zheng, Kefei Chen
CRYPTO
2011
Springer
245views Cryptology» more  CRYPTO 2011»
13 years 9 months ago
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security (quantumly) reduces to the worst-case hardness of problems ...
Zvika Brakerski, Vinod Vaikuntanathan
CCGRID
2005
IEEE
15 years 3 months ago
Secret sequence comparison on public grid computing resources
Once a new gene has been sequenced, it must be verified whether or not it is similar to previously sequenced genes. In many cases, the organization that sequenced a potentially n...
Ken-ichi Kurata, Hiroshi Nakamura, Vincent Breton
STOC
2003
ACM
116views Algorithms» more  STOC 2003»
15 years 3 months ago
New lattice based cryptographic constructions
We introduce the use of Fourier analysis on lattices as an integral part of a lattice based construction. The tools we develop provide an elegant description of certain Gaussian d...
Oded Regev
EUROCRYPT
2011
Springer
14 years 1 months ago
Homomorphic Signatures for Polynomial Functions
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an...
Dan Boneh, David Mandell Freeman