Sciweavers

515 search results - page 36 / 103
» context 2011
Sort
View
IACR
2011
141views more  IACR 2011»
13 years 11 months ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger
IACR
2011
90views more  IACR 2011»
13 years 11 months ago
On the Security of the Winternitz One-Time Signature Scheme
Abstract. We show that the Winternitz one-time signature scheme is existentially unforgeable under adaptive chosen message attacks when instantiated with a family of pseudo random ...
Johannes Buchmann, Erik Dahmen, Sarah Ereth, Andre...
IACR
2011
129views more  IACR 2011»
13 years 11 months ago
Bounded Vector Signatures and their Applications
Although malleability is undesirable in traditional digital signatures, schemes with limited malleability properties enable interesting functionalities that may be impossible to o...
Lei Wei, Scott E. Coull, Michael K. Reiter
CHI
2011
ACM
14 years 3 months ago
In the shadow of misperception: assistive technology use and social interactions
Few research studies focus on how the use of assistive technologies is affected by social interaction among people. We present an interview study of 20 individuals to determine ho...
Kristen Shinohara, Jacob O. Wobbrock
ICASSP
2011
IEEE
14 years 3 months ago
Exploiting sparseness of backing-off language models for efficient look-ahead in LVCSR
In this paper, we propose a new method for computing and applying language model look-ahead in a dynamic network decoder, exploiting the sparseness of backing-off n-gram language ...
David Nolden, Hermann Ney, Ralf Schlüter