Sciweavers

124 search results - page 16 / 25
» Randomly supported independence and resistance
Sort
View
FOCS
2007
IEEE
14 years 1 months ago
Covert Multi-Party Computation
In STOC’05, Ahn, Hopper and Langford introduced the notion of covert computation. A covert computation protocol is one in which parties can run a protocol without knowing if oth...
Nishanth Chandran, Vipul Goyal, Rafail Ostrovsky, ...
STOC
2003
ACM
124views Algorithms» more  STOC 2003»
14 years 7 months ago
Extractors: optimal up to constant factors
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...
Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wi...
SIAMCOMP
2002
138views more  SIAMCOMP 2002»
13 years 7 months ago
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
Hsien-Kuei Hwang, Ralph Neininger
WWW
2008
ACM
14 years 8 months ago
Mining, indexing, and searching for textual chemical molecule information on the web
Current search engines do not support user searches for chemical entities (chemical names and formulae) beyond simple keyword searches. Usually a chemical molecule can be represen...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
CISC
2007
Springer
152views Cryptology» more  CISC 2007»
14 years 1 months ago
Orthogonality between Key Privacy and Data Privacy, Revisited
Abstract. Key privacy is a notion regarding the privacy of the owner of a public key, which has important applications in building (receiver) anonymous channels, or privacy-enhance...
Rui Zhang 0002, Goichiro Hanaoka, Hideki Imai