Sciweavers

2237 search results - page 237 / 448
» On the Security of Random Sources
Sort
View
ACL
2010
15 years 5 months ago
Intelligent Selection of Language Model Training Data
We address the problem of selecting nondomain-specific language model training data to build auxiliary language models for use in tasks such as machine translation. Our approach i...
Robert C. Moore, William Lewis
ICASSP
2011
IEEE
14 years 11 months ago
Quantizer design with mismatched side information at the decoder
Quantizer design for lossy compression with mismatched side information (SI) at the decoder is investigated. The statistical dependency between the source and SI is assumed to be ...
Sepideh Shamaei, Mehrdad Valipour
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 7 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs
P2P
2006
IEEE
16 years 1 months ago
Route Fingerprinting in Anonymous Communications
Peer discovery and route set-up are an integral part of the processes by which anonymizing peer-to-peer systems are made secure. When systems are large, and individual nodes only ...
George Danezis, Richard Clayton
EUROCRYPT
1999
Springer
15 years 11 months ago
Lower Bounds for Oblivious Transfer Reductions
We prove the first general and non-trivial lower bound for the number of times a 1-out-of-n Oblivious Transfer of strings of length should be invoked so as to obtain, by an inform...
Yevgeniy Dodis, Silvio Micali