256 search results - page 38 / 52 » Recursive Lattice Reduction |
IJNSEC
2006
13 years 7 months ago
2006
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...
AAECC
2005
Springer
13 years 7 months ago
2005
Springer
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...
CTRSA
2011
Springer
12 years 11 months ago
2011
Springer
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...
CCA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
IUI
2012
ACM
12 years 3 months ago
2012
ACM
The next big step in embedded, mobile speech recognition will be to allow completely free input as it is needed for messaging like SMS or email. However, unconstrained dictation r...