Sciweavers

3898 search results - page 252 / 780
» On the Bit Extraction Problem
Sort
View
137
Voted
ASIACRYPT
2010
Springer
15 years 1 months ago
Faster Fully Homomorphic Encryption
Abstract. We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardn...
Damien Stehlé, Ron Steinfeld
ICMS
2010
15 years 1 months ago
Efficient Evaluation of Large Polynomials
Abstract. Minimizing the evaluation cost of a polynomial expression is a fundamental problem in computer science. We propose tools that, for a polynomial P given as the sum of its ...
Charles E. Leiserson, Liyun Li, Marc Moreno Maza, ...
INDOCRYPT
2010
Springer
15 years 1 months ago
Partial Key Exposure Attack on RSA - Improvements for Limited Lattice Dimensions
Abstract. Consider the RSA public key cryptosystem with the parameters N = pq, q < p < 2q, public encryption exponent e and private decryption exponent d. In this paper, cryp...
Santanu Sarkar, Sourav Sengupta, Subhamoy Maitra
129
Voted
ICIP
2009
IEEE
15 years 1 months ago
Component-based image coding using non-local means filtering and an autoregressive texture model
While noise is usually regarded as a problem of the image formation process, we observe that it is also frequently part of natural texture. In this paper, we present a concept for...
Johannes Ballé, Bastian Jurczyk, Aleksandar...
TIT
2010
110views Education» more  TIT 2010»
14 years 10 months ago
On network interference management
We study two building-block models of interference-limited wireless networks, motivated by the problem of joint Peer-to-Peer and Wide Area Network design. In the first case, a sin...
Aleksandar Jovicic, Hua Wang, Pramod Viswanath