Sciweavers

7329 search results - page 1 / 1466
» Network Extractor Protocols
Sort
View
179
Voted
FOCS
2008
IEEE
16 years 2 months ago
Network Extractor Protocols
We design efficient protocols for processors to extract private randomness over a network with Byzantine faults, when each processor has access to an independent weakly-random n-...
Yael Tauman Kalai, Xin Li, Anup Rao, David Zuckerm...
197
Voted
FOCS
2009
IEEE
16 years 2 months ago
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
Yael Tauman Kalai, Xin Li, Anup Rao
238
Voted
CORR
2011
Springer
143views Education» more  CORR 2011»
14 years 11 months ago
Non-malleable extractors via character sums
In studying how to communicate over a public channel with an active adversary, Dodis and Wichs introduced the notion of a non-malleable extractor. A non-malleable extractor dramat...
Trevor D. Wooley, David Zuckerman
IJCNN
2006
IEEE
16 years 1 months ago
Support Vector Machines to Weight Voters in a Voting System of Entity Extractors
—Support Vector Machines are used to combine the outputs of multiple entity extractors, thus creating a composite entity extraction system. The composite system has a significant...
Deborah Duong, James Venuto, Ben Goertzel, Ryan Ri...
237
Voted
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 8 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