Results 1  10
of
353,817
Oblivious Polynomial Evaluation
 SIAM J. Comput
, 2006
"... Oblivious polynomial evaluation is a protocol involving two parties, a sender whose input is a polynomial P, and a receiver whose input is a value α. At the end of the protocol the receiver learns P (α) and the sender learns nothing. We describe efficient constructions for this protocol, which are b ..."
Abstract

Cited by 26 (2 self)
 Add to MetaCart
Oblivious polynomial evaluation is a protocol involving two parties, a sender whose input is a polynomial P, and a receiver whose input is a value α. At the end of the protocol the receiver learns P (α) and the sender learns nothing. We describe efficient constructions for this protocol, which
Oblivious polynomial evaluation and oblivious neural learning
 Theoretical Computer Science
, 2001
"... Abstract. We study the problem of Oblivious Polynomial Evaluation (OPE). There are two parties, Alice who has a polynomial P, and Bob who has an input x. The goal is for Bob to compute P (x) in such way that Alice learns nothing about x and Bob learns only what can be inferred from P (x). Previously ..."
Abstract

Cited by 31 (0 self)
 Add to MetaCart
Abstract. We study the problem of Oblivious Polynomial Evaluation (OPE). There are two parties, Alice who has a polynomial P, and Bob who has an input x. The goal is for Bob to compute P (x) in such way that Alice learns nothing about x and Bob learns only what can be inferred from P (x
Efficient Oblivious Polynomial Evaluation with SimulationBased Security
, 2009
"... The study of secure multiparty computation has yielded powerful feasibility results showing that any efficient functionality can be securely computed in the presence of malicious adversaries. Despite this, there are few problems of specific interest for which we have highly efficient protocols that ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
construct highly efficient protocols for the wellstudied problem of oblivious polynomial evaluation. Our protocol is secure under standard cryptographic assumptions for the settings of malicious adversaries, and readily transform to protocols that are secure under universal composability
A Novel Unconditionally Secure Oblivious Polynomial Evaluation Protocol
 Proceedings of the 2009 International Workshop on Information Security and Application (IWISA 2009), Academy Publisher
, 2009
"... Abstract—Oblivious polynomial evaluation is a protocol involving two parties, a sender whose input is a polynomial P, and a receiver whose input is a value x. At the end of the protocol, the receiver learns P (x) and nothing more about P, while the sender remains oblivious of both x and P (x). It is ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract—Oblivious polynomial evaluation is a protocol involving two parties, a sender whose input is a polynomial P, and a receiver whose input is a value x. At the end of the protocol, the receiver learns P (x) and nothing more about P, while the sender remains oblivious of both x and P (x
InformationTheoretically Secure Oblivious Polynomial Evaluation in the CommodityBased Model
"... Abstract. Oblivious polynomial evaluation (OPE) consists of a twoparty protocol where a sender inputs a polynomial p(x), and a receiver inputs a single value x0. At the end of the protocol, the sender learns nothing and the receiver learns p(x0). This paper deals with the problem of oblivious polyn ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Oblivious polynomial evaluation (OPE) consists of a twoparty protocol where a sender inputs a polynomial p(x), and a receiver inputs a single value x0. At the end of the protocol, the sender learns nothing and the receiver learns p(x0). This paper deals with the problem of oblivious
Sequentially Composable Information Theoretically Secure Oblivious Polynomial Evaluation
"... Abstract. Oblivious polynomial evaluation (OPE) consists of a twoparty protocol where a sender inputs a polynomial P, and a receiver inputs a single value i. At the end of the protocol, the sender learns nothing and the receiver learns P (i). This paper deals with the problem of oblivious polynomial ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Oblivious polynomial evaluation (OPE) consists of a twoparty protocol where a sender inputs a polynomial P, and a receiver inputs a single value i. At the end of the protocol, the sender learns nothing and the receiver learns P (i). This paper deals with the problem of oblivious
Oblivious Polynomial Evaluation and Secure SetIntersection from Algebraic PRFs
"... In this paper we study the two fundamental functionalities oblivious polynomial evaluation in the exponent and setintersection, and introduce a new technique for designing efficient secure protocols for these problems (and others). Our starting point is the [BGV11] technique (CRYPTO 2011) for verif ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper we study the two fundamental functionalities oblivious polynomial evaluation in the exponent and setintersection, and introduce a new technique for designing efficient secure protocols for these problems (and others). Our starting point is the [BGV11] technique (CRYPTO 2011
Software Protection and Simulation on Oblivious RAMs
, 1993
"... Software protection is one of the most important issues concerning computer practice. There exist many heuristics and adhoc methods for protection, but the problem as a whole has not received the theoretical treatment it deserves. In this paper we provide theoretical treatment of software protectio ..."
Abstract

Cited by 317 (15 self)
 Add to MetaCart
protection. We reduce the problem of software protection to the problem of efficient simulation on oblivious RAM. A machine is oblivious if the sequence in which it accesses memory locations is equivalent for any two inputs with the same running time. For example, an oblivious Turing Machine is one
A PERFORMANCE EVALUATION OF LOCAL DESCRIPTORS
, 2005
"... In this paper we compare the performance of descriptors computed for local interest regions, as for example extracted by the HarrisAffine detector [32]. Many different descriptors have been proposed in the literature. However, it is unclear which descriptors are more appropriate and how their perfo ..."
Abstract

Cited by 1752 (53 self)
 Add to MetaCart
their performance depends on the interest region detector. The descriptors should be distinctive and at the same time robust to changes in viewing conditions as well as to errors of the detector. Our evaluation uses as criterion recall with respect to precision and is carried out for different image transformations
Results 1  10
of
353,817