Sciweavers

4 search results - page 1 / 1
» A Stateful Implementation of a Random Function Supporting Pa...
Sort
View
APPROX
2004
Springer
88views Algorithms» more  APPROX 2004»
15 years 3 months ago
A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes
Abstract. Motivated by an open problem recently suggested by Goldreich et al., we study truthful implementations of a random binary function supporting compound XOR queries over su...
Andrej Bogdanov, Hoeteck Wee
191
Voted
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
15 years 11 months ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002
82
Voted
ICWN
2004
14 years 11 months ago
Searching in Variably Connected P2P Networks
Peer-to-Peer networks are gaining popularity through file-sharing communities. Most P2P networks demand a certain stability from it's nodes in order to function satisfactory. ...
Njål T. Borch, Lars Kristian Vognild
EUROCRYPT
2010
Springer
15 years 3 months ago
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...
Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tr...