Sciweavers

102 search results - page 12 / 21
» Bounded Query Functions with Limited Output Bits
Sort
View
DC
2008
13 years 7 months ago
Approximate distributed top- k queries
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
Boaz Patt-Shamir, Allon Shafrir
EUROCRYPT
2001
Springer
14 years 16 hour ago
On Perfect and Adaptive Security in Exposure-Resilient Cryptography
Abstract. We consider the question of adaptive security for two related cryptographic primitives: all-or-nothing transforms and exposureresilient functions. Both are concerned with...
Yevgeniy Dodis, Amit Sahai, Adam Smith
ASIACRYPT
2001
Springer
14 years 1 days ago
Practical Construction and Analysis of Pseudo-Randomness Primitives
Abstract. We give a careful, fixed-size parameter analysis of a standard [1,4] way to form a pseudorandom generator by iterating a one-way function and then pseudo-random function...
Johan Håstad, Mats Näslund
ALT
2010
Springer
13 years 9 months ago
Online Multiple Kernel Learning: Algorithms and Mistake Bounds
Online learning and kernel learning are two active research topics in machine learning. Although each of them has been studied extensively, there is a limited effort in addressing ...
Rong Jin, Steven C. H. Hoi, Tianbao Yang
CRYPTO
2008
Springer
98views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
One-Time Programs
Abstract. In this work, we introduce one-time programs, a new computational paradigm geared towards security applications. A one-time program can be executed on a single input, who...
Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothbl...