Sciweavers

16616 search results - page 425 / 3324
» Extending Extended Vacuity
Sort
View
IACR
2011
112views more  IACR 2011»
14 years 7 months ago
Improved Generic Algorithms for Hard Knapsacks
At Eurocrypt 2010, Howgrave-Graham and Joux described an algorithm for solving hard knapsacks of density close to 1 in time ˜O(20.337n ) and memory ˜O(20.256n ), thereby improvin...
Anja Becker, Jean-Sébastien Coron, Antoine ...
IACR
2011
98views more  IACR 2011»
14 years 7 months ago
New Receipt-Free E-Voting Scheme and Self-Proving Mix Net as New Paradigm
The contribution of this paper is twofold. First we present a new simple electronic voting scheme having standard re-encryption mix net back-end, which allows to cast a ballot and ...
Aram Jivanyan, Gurgen Khachatryan
IACR
2011
124views more  IACR 2011»
14 years 7 months ago
Generic Fully Simulatable Adaptive Oblivious Transfer
We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable security, from various well-known assumptions such as DDH, d-Linear, QR, DCR, and LWE. To t...
Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong
ICC
2011
IEEE
177views Communications» more  ICC 2011»
14 years 7 months ago
High-Throughput Routing with Superposition Coding and Successive Interference Cancellation
—Network coding aware routing protocols have been an interesting research topic in recent years. In this paper, we explore similar routing gains with physical layer coding techni...
Xueyuan Su, Sammy Chan
ICDAR
2011
IEEE
14 years 7 months ago
Offline Writer Identification Using K-Adjacent Segments
— This paper presents a method for performing offline writer identification by using K-adjacent segment (KAS) features in a bag-of-features framework to model a user’s handwrit...
Rajiv Jain, David S. Doermann