Results 1  10
of
5,407
Security and Composition of Multiparty Cryptographic Protocols
 JOURNAL OF CRYPTOLOGY
, 1998
"... We present general definitions of security for multiparty cryptographic protocols, with focus on the task of evaluating a probabilistic function of the parties' inputs. We show that, with respect to these definitions, security is preserved under a natural composition operation. The definiti ..."
Abstract

Cited by 465 (19 self)
 Add to MetaCart
We present general definitions of security for multiparty cryptographic protocols, with focus on the task of evaluating a probabilistic function of the parties' inputs. We show that, with respect to these definitions, security is preserved under a natural composition operation
Opponent: Eyal Buks
"... iii This work explores the effects of weak nonlinearity on harmonic oscillators. Two particular systems are studied experimentally: A superconducting resonator formed from a coplanar waveguide that oscillates at microwave frequencies, and the cantilever of an atomic force microscope (AFM) vibratin ..."
Abstract
 Add to MetaCart
iii This work explores the effects of weak nonlinearity on harmonic oscillators. Two particular systems are studied experimentally: A superconducting resonator formed from a coplanar waveguide that oscillates at microwave frequencies, and the cantilever of an atomic force microscope (AFM
Replication Is Not Needed: Single Database, ComputationallyPrivate Information Retrieval (Extended Abstract)
 IN PROC. OF THE 38TH ANNU. IEEE SYMP. ON FOUNDATIONS OF COMPUTER SCIENCE
, 1997
"... We establish the following, quite unexpected, result: replication of data for the computational Private Information Retrieval problem is not necessary. More specifically, based on the quadratic residuosity assumption, we present a single database, computationallyprivate informationretrieval scheme ..."
Abstract

Cited by 273 (18 self)
 Add to MetaCart
We establish the following, quite unexpected, result: replication of data for the computational Private Information Retrieval problem is not necessary. More specifically, based on the quadratic residuosity assumption, we present a single database, computationallyprivate information
Impact of human mobility on the design of opportunistic forwarding algorithms
 In Proc. IEEE Infocom
, 2006
"... Abstract — Studying transfer opportunities between wireless devices carried by humans, we observe that the distribution of the intercontact time, that is the time gap separating two contacts of the same pair of devices, exhibits a heavy tail such as one of a power law, over a large range of value. ..."
Abstract

Cited by 253 (15 self)
 Add to MetaCart
Abstract — Studying transfer opportunities between wireless devices carried by humans, we observe that the distribution of the intercontact time, that is the time gap separating two contacts of the same pair of devices, exhibits a heavy tail such as one of a power law, over a large range of value
Learning Rates for Qlearning Eyal EvenDar
"... In this paper we derive convergence rates for Qlearning. We show an interesting relationship between the convergence rate and the learning rate used in Qlearning. For a polynomial learning rate, one which is 1/tω at time t where ω ∈ (1/2,1), we show that the convergence rate is polynomial in 1/(1 ..."
Abstract
 Add to MetaCart
In this paper we derive convergence rates for Qlearning. We show an interesting relationship between the convergence rate and the learning rate used in Qlearning. For a polynomial learning rate, one which is 1/tω at time t where ω ∈ (1/2,1), we show that the convergence rate is polynomial in 1
Impact of human mobility on opportunistic forwarding algorithms
 IEEE Trans. Mob. Comp
, 2007
"... Abstract — We study data transfer opportunities between wireless devices carried by humans. We observe that the distribution of the intercontact time (the time gap separating two contacts between the same pair of devices) may be well approximated by a power law over the range [10 minutes; 1 day]. T ..."
Abstract

Cited by 222 (21 self)
 Add to MetaCart
Abstract — We study data transfer opportunities between wireless devices carried by humans. We observe that the distribution of the intercontact time (the time gap separating two contacts between the same pair of devices) may be well approximated by a power law over the range [10 minutes; 1 day
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
, 1998
"... We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vectors in some high dimensional Euclidean space, we want to construct a spaceefficient data structure that would allow us to ..."
Abstract

Cited by 220 (9 self)
 Add to MetaCart
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vectors in some high dimensional Euclidean space, we want to construct a spaceefficient data structure that would allow us
Learning Decision Trees using the Fourier Spectrum
, 1991
"... This work gives a polynomial time algorithm for learning decision trees with respect to the uniform distribution. (This algorithm uses membership queries.) The decision tree model that is considered is an extension of the traditional boolean decision tree model that allows linear operations in each ..."
Abstract

Cited by 212 (10 self)
 Add to MetaCart
node (i.e., summation of a subset of the input variables over GF (2)). This paper shows how to learn in polynomial time any function that can be approximated (in norm L 2 ) by a polynomially sparse function (i.e., a function with only polynomially many nonzero Fourier coefficients). The authors
Generalized Gray Codes for Local Rank Modulation Eyal En Gad
"... Abstract—We consider the local rankmodulation scheme in which a sliding window going over a sequence of realvalued variables induces a sequence of permutations. Local rankmodulation is a generalization of the rankmodulation scheme, whichhasbeenrecentlysuggestedas awayof storinginformation in flas ..."
Abstract
 Add to MetaCart
Abstract—We consider the local rankmodulation scheme in which a sliding window going over a sequence of realvalued variables induces a sequence of permutations. Local rankmodulation is a generalization of the rankmodulation scheme, whichhasbeenrecentlysuggestedas awayof storinginformation
AKIRA OKADA and EYAL WINTER A NONCOOPERATIVE AXIOMATIZATION OF THE CORE
"... ABSTRACT. We treat a class of multiperson bargaining mechanisms based on games in coalitional form. For this class of games we identify properties of noncooperative solution concepts, which are necessary and sufficient for the equilibrium outcomes to coincide with the core of the underlying coalit ..."
Abstract
 Add to MetaCart
ABSTRACT. We treat a class of multiperson bargaining mechanisms based on games in coalitional form. For this class of games we identify properties of noncooperative solution concepts, which are necessary and sufficient for the equilibrium outcomes to coincide with the core of the underlying
Results 1  10
of
5,407