2237 search results - page 222 / 448 » On the Security of Random Sources |
198
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
— We demonstrate a decoding scheme for nested lattice codes which is able to decode a list of a particular size which contains the transmitted codeword with high probability. Thi...
195
click to vote
TAL
2010
Springer
15 years 5 months ago
2010
Springer
The lack of large-scale, freely available and durable lexical resources, and the consequences for NLP, is widely acknowledged but the attempts to cope with usual bottlenecks preven...
210
click to vote
EUROCRYPT
2005
Springer
16 years 20 days ago
2005
Springer
We prove, under the strong RSA assumption, that the group of invertible integers modulo the product of two safe primes is pseudo-free. More specifically, no polynomial time algor...
162
click to vote
FOCS
2003
IEEE
16 years 13 days ago
2003
IEEE
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is contained in NP/poly and the polynomial hierarchy co...
174
click to vote
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
We present session-key generation protocols in a model where the legitimate parties share only a human-memorizable password. The security guarantee holds with respect to probabilis...