Results 1  10
of
26,333
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
Verifiable Distributed Oblivious Transfer and Mobile Agent Security
 In Proceedings of the 2003 Joint Workshop on Foundations of Mobile Computing (DIALMPOMC’03), ACM
, 2003
"... The mobile agent is a fundamental building block of the mobile computing paradigm. In mobile agent security, oblivious transfer (OT) from a trusted party can be used to protect the agent's privacy and the hosts' privacy. In this paper, we introduce a new cryptographic primitive called Veri ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
Verifiable Distributed Oblivious Transfer (VDOT), which allows us to replace a single trusted party with a group of threshold trusted servers. The design of VDOT uses two novel techniques, consistency verification of encrypted secret shares and consistency verification through rerandomization. VDOT
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
Oblivious Collaboration
, 2011
"... Communication is a crucial ingredient in every kind of collaborative work. But what is the least possible amount of communication required for a given task? We formalize this question by introducing a new framework for distributed computation, called oblivious protocols. We investigate the power of ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Communication is a crucial ingredient in every kind of collaborative work. But what is the least possible amount of communication required for a given task? We formalize this question by introducing a new framework for distributed computation, called oblivious protocols. We investigate the power
Private and Oblivious Set and Multiset Operations ∗
"... Privacypreserving set operations and set intersection in particular are a popular research topic. Despite a large body of literature, the great majority of the available solutions are twoparty protocols and are not composable. In this work we design a comprehensive suite of secure multiparty prot ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Privacypreserving set operations and set intersection in particular are a popular research topic. Despite a large body of literature, the great majority of the available solutions are twoparty protocols and are not composable. In this work we design a comprehensive suite of secure multiparty protocols for set and multiset operations that are composable, do not assume any knowledge of the sets by the parties carrying out the secure computation, and can be used for secure outsourcing. All of our protocols have communication and computation complexity of O(m log m) for sets or multisets of size m, which compares favorably with prior work. Furthermore, we are not aware of any results that realize composable operations. Our protocols are secure in the information theoretic sense and are designed to minimize the round complexity.
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
) for verifiable delegation of polynomial evaluations, using algebraic PRFs. We use this tool, that is useful to achieve verifiability in the outsourced setting, in order to achieve privacy in the standard twoparty setting. Our results imply new simple and efficient oblivious polynomial evaluation (OPE) protocols
Twoparty oblivious circuit evaluation
"... Keywords Multiparty computation, oblivious transfer, circuit evaluation, protocol, bit commitment. Abstract A TwoParty Oblivious Circuit Evaluation (2POCE) Protocol is a way for a party Alice owns a secret x and another party Bob owns a secret y to compute the value of an agreed upon function f(x ..."
Abstract
 Add to MetaCart
Keywords Multiparty computation, oblivious transfer, circuit evaluation, protocol, bit commitment. Abstract A TwoParty Oblivious Circuit Evaluation (2POCE) Protocol is a way for a party Alice owns a secret x and another party Bob owns a secret y to compute the value of an agreed upon function f
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
On Security of Sublinear Oblivious Transfer
, 2006
"... We study the maximal security attainable by adaptive moutofn oblivious transfer protocols with sublinear communication. It is known how to construct such protocols that are private, but not known how to construct such protocols that are (fully) secure. We define the intermediate notion of cohe ..."
Abstract
 Add to MetaCart
We study the maximal security attainable by adaptive moutofn oblivious transfer protocols with sublinear communication. It is known how to construct such protocols that are private, but not known how to construct such protocols that are (fully) secure. We define the intermediate notion
Results 1  10
of
26,333