Sciweavers

598 search results - page 44 / 120
» Predicting Lattice Reduction
Sort
View
IJNSEC
2006
69views more  IJNSEC 2006»
15 years 4 months ago
Active Trial-and-error Attack on SASC Protocols
SASC (Server-Aided Secret Computation) protocols enable a client (a smart card) to borrow computing power from a server (e.g., an untrustworthy auxiliary device like an ATM) witho...
Heeyoul Kim, Younho Lee, Seong-Min Hong, Hyunsoo Y...
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
15 years 4 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof
CTRSA
2011
Springer
243views Cryptology» more  CTRSA 2011»
14 years 7 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
162
Voted
BMCBI
2011
14 years 7 months ago
Biomarker Discovery and Redundancy Reduction towards Classification using a Multi-factorial MALDI-TOF MS T2DM Mouse Model Datase
Background: Diabetes like many diseases and biological processes is not mono-causal. On the one hand multifactorial studies with complex experimental design are required for its c...
Chris Bauer, Frank Kleinjung, Celia J. Smith, Mark...
BMCBI
2011
14 years 7 months ago
A Beta-Mixture Model for Dimensionality Reduction, Sample Classification and Analysis
Background: Patterns of genome-wide methylation vary between tissue types. For example, cancer tissue shows markedly different patterns from those of normal tissue. In this paper ...
Kirsti Laurila, Bodil Oster, Claus L. Andersen, Ph...