4377 search results - page 198 / 876 » Mass problems and randomness |
211
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
In this paper, we formally prove that padding the plaintext with a random bit-string provides the semantic security against chosen plaintext attack (IND-CPA) for the McEliece (and ...
143
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
169
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
231
click to vote
IVIC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Due to privacy concern on the widespread use of biometric authentication systems, biometric template protection has gained great attention in the biometric research recen...
174
click to vote
SECON
2007
IEEE
16 years 26 days ago
2007
IEEE
— In this paper we study two-hop cooperative diversity relaying in random wireless networks. In contrast to most work on cooperative diversity relaying where the relay node posit...