Sciweavers

5843 search results - page 1091 / 1169
» Software Security in Practice
Sort
View
ANCS
2009
ACM
13 years 6 months ago
SPC-FA: synergic parallel compact finite automaton to accelerate multi-string matching with low memory
Deterministic Finite Automaton (DFA) is well-known for its constant matching speed in worst case, and widely used in multistring matching, which is a critical technique in high pe...
Junchen Jiang, Yi Tang, Bin Liu, Xiaofei Wang, Yan...
IGARSS
2009
13 years 6 months ago
Affine Compensation of Illumination in Hyperspectral Remote Sensing Images
A problem when working with optical satellite or airborne images is the need to compensate for changes in the illumination conditions at the time of acquisition. This is particula...
Pedro Latorre Carmona, Jose Moreno, Filiberto Pla,...
PKC
2011
Springer
185views Cryptology» more  PKC 2011»
12 years 12 months ago
Signatures on Randomizable Ciphertexts
xtended abstract which appears in the 2011 International Conference on Theory and Practice in Public Key Cryptography PKC 2011 (6–9 march 2011, Taormina, Italy) D. Catalano, N. F...
Olivier Blazy, Georg Fuchsbauer, David Pointcheval...
TCC
2012
Springer
240views Cryptology» more  TCC 2012»
12 years 4 months ago
Computing on Authenticated Data
In tandem with recent progress on computing on encrypted data via fully homomorphic encryption, we present a framework for computing on authenticated data via the notion of slight...
Jae Hyun Ahn, Dan Boneh, Jan Camenisch, Susan Hohe...
PKC
2012
Springer
255views Cryptology» more  PKC 2012»
11 years 11 months ago
Better Bootstrapping in Fully Homomorphic Encryption
Gentry’s bootstrapping technique is currently the only known method of obtaining a “pure” fully homomorphic encryption (FHE) schemes, and it may offers performance advantage...
Craig Gentry, Shai Halevi, Nigel P. Smart
« Prev « First page 1091 / 1169 Last » Next »