Sciweavers

437 search results - page 18 / 88
» Randomized Lattice Decoding
Sort
View
TCOM
2010
112views more  TCOM 2010»
14 years 11 months ago
On further reduction of complexity in tree pruning based sphere search
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
Byonghyo Shim, Insung Kang
EUROCRYPT
2012
Springer
13 years 3 months ago
Lattice Signatures without Trapdoors
We provide an alternative method for constructing lattice-based digital signatures which does not use the “hash-and-sign” methodology of Gentry, Peikert, and Vaikuntanathan (ST...
Vadim Lyubashevsky
COLING
2010
14 years 8 months ago
Joint Tokenization and Translation
As tokenization is usually ambiguous for many natural languages such as Chinese and Korean, tokenization errors might potentially introduce translation mistakes for translation sy...
Xinyan Xiao, Yang Liu, Young-Sook Hwang, Qun Liu, ...
98
Voted
DCG
1999
81views more  DCG 1999»
15 years 19 days ago
Properties of Random Triangulations and Trees
Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural "geometric" features of a triangulation Tn, fo...
Luc Devroye, Philippe Flajolet, Ferran Hurtado, Ma...
ASIACRYPT
2010
Springer
14 years 11 months ago
A Group Signature Scheme from Lattice Assumptions
Group signature schemes allow users to sign messages on behalf of a group while (1) maintaining anonymity (within that group) with respect to an observer, yet (2) ensuring traceab...
S. Dov Gordon, Jonathan Katz, Vinod Vaikuntanathan