A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Oblivious evaluation of multivariate polynomials
2013
Journal of Mathematical Cryptology
Preserved Fulltext
One of the fundamental problems of multi-party computation is Oblivious Polynomial Evaluation. ...
In addition, we discuss several applications that may be solved efficiently using oblivious multivariate polynomial evaluation, such as private linear algebraic computations and private support vector ...
In Section 2.3 we define the problem of Oblivious Multivariate Polynomial Evaluation (OMPE). ...
doi:10.1515/jmc-2012-0007
fatcat:a5p3t53tfrf77kuzirdqdmcxdy
Oblivious Polynomial Evaluation and Oblivious Neural Learning
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Unlike that of [15] , slight modifications to our protocols immediately give protocols to handle multi-variate polynomials and polynomials over floating-point numbers. ...
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 variation for multi-variate polynomials can be handled similarly. ...
doi:10.1007/3-540-45682-1_22
fatcat:cfxijlfvtrhzhfpeqngcck7xfu
Oblivious polynomial evaluation and oblivious neural learning
2005
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
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. ...
Our protocols can also be easily modified to handle multivariate polynomials and polynomials over floating-point numbers. ...
The variation for multi-variate polynomials can be handled similarly. ...
doi:10.1016/j.tcs.2005.03.049
fatcat:d332dk36jfgctkaihbkht54liy
Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs
[article]
2013
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
We study the problem of obtaining deterministic black-box polynomial identity testing algorithms (PIT) for algebraic branching programs (ABPs) that are read-once and oblivious. ...
The main result of this work gives the first quasi-polynomial sized hitting sets for size S circuits from this class, when the order of the variables is known. ...
Let C be the set of D-variate polynomials computable by width r, depth D, individual degree < n read-once oblivious ABPs. ...
arXiv:1209.2408v2
fatcat:piahhxizsjh3dcbpkx6fqztpdq
CHOPtrey: contextual online polynomial extrapolation for enhanced multi-core co-simulation of complex systems
2017
Simulation (San Diego, Calif.)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
It is obtained by past-weighted extrapolation based on Causal Hopping Oblivious Polynomials (CHOPoly). ...
The growing complexity of Cyber-Physical Systems (CPS), together with increasingly available parallelism provided by multi-core chips, fosters the parallelization of simulation. ...
The resulting Causal Hopping Oblivious Polynomials (CHOPoly) are described next, evaluated on the case study described in Section 6 and tested in Section 7. ...
doi:10.1177/0037549716684026
fatcat:l5rmozhsqbbd3poofsgyfiylnu
Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs
2013
2013 IEEE 54th Annual Symposium on Foundations of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
The main result in this paper is a quasi-polynomial time PIT algorithm in the black-box model for read-once oblivious algebraic branching programs. ...
We study the problem of obtaining efficient, deterministic, black-box polynomial identity testing algorithms (PIT) for read-once oblivious algebraic branching programs (ABPs). ...
Let C be the set of D-variate polynomials computable by width r, depth D, individual degree < n read-once oblivious ABPs. ...
doi:10.1109/focs.2013.34
dblp:conf/focs/ForbesS13
fatcat:m6tsod2pnjcatlahg5zzke2b4a
Hybrid Approach for Secure Mobile Agent Computations
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We review and analyze methods proposed for securing agent operations in the face of passive and active adversaries by means of secure multi-party computations. ...
We have reviewed the state of the art in such integration approaches and posed variations of hybrid approaches that utilize fully trusted or semi-trusted execution environments for secure multi-agent computations ...
Secure computation is referred to synonymously as secure multi-party computation (SMC), secure function evaluation (SFE) or secure circuit evaluation. ...
doi:10.1007/11801412_5
fatcat:carpt5cu6zd4hegny7zurmx6pi
Scalable Multi-party Private Set-Intersection
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Two common approaches are known to concretely solve this problem securely in the plain model for two parties: (1) oblivious polynomial evaluation (OPE) and (2) committed oblivious PRF evaluation. ...
pseudorandom function (PRF) evaluation [FIPR05], only minor progress has been achieved for concrete multi-party functions. 2PC private set-intersection. ...
More concretely, the [FNP04] protocol is based on oblivious polynomial evaluation. ...
doi:10.1007/978-3-662-54365-8_8
fatcat:rjljgwcivfbe5lcvov374exfpu
Kulfi: Robust Traffic Engineering Using Semi-Oblivious Routing
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This paper explores a different approach based on semi-oblivious routing, a natural extension of oblivious routing in which the system computes a diverse set of paths independent of demands, but also dynamically ...
Semi-oblivious routing has a number of important advantages over competing approaches including low overhead, nearly optimal performance, and built-in protection against unexpected bursts of traffic and ...
We present SOTE, a new approach to traffic engineering that enriches oblivious routing with dynamic rate adaptation ( §3). 3. ...
arXiv:1603.01203v1
fatcat:njc34qvppzgcrpsewfnjavo4g4
Robust Routing and Scheduling in Wireless Mesh Networks
2007
2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
As long as the traffic variation is within the estimation range, the routing and scheduling do not need to be recomputed and redistributed. ...
In a follow-up work [12] , the authors show how to compute the oblivious ratio in polynomial time. ...
PERFORMANCE EVALUATION
A. Simulation Setup We use Qualnet [19] for performance evaluation. ...
doi:10.1109/sahcn.2007.4292859
dblp:conf/secon/WangLK07
fatcat:ixeezo4seba6jpvwdo7vwe4fo4
Making intra-domain routing robust to changing and uncertain traffic demands
2003
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications - SIGCOMM '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
Since traffic demand values are dynamic and illusive, is it possible to obtain a routing that is "robust" to variations in demands? ...
We first show that the ratio is at least 2 − 2/n: From symmetry (see Lemma 6.1) and flow conservation considerations, there is an optimal oblivious routing of the following form: for some xi ≥ 0, ...
We then summarize a recent result [3] which established that an optimal oblivious routing (and the oblivious ratio) of a network can be computed in polynomial time in the size of the network. ...
doi:10.1145/863989.863991
fatcat:dy4v3rjj2jghxl4njs3h37x4zq
Can We Access a Database Both Locally and Privately?
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This primitive, that we call an oblivious locally decodable code (OLDC), is independently motivated by applications such as searchable symmetric encryption. ...
We consider an (m, d)-Reed-Muller code over F, namely the code defined by m-variate polynomials of degree ≤ d over F. ...
The choice of parameter evaluation points t 1 , . . . , t dλ determines a corresponding list of Lagrange polynomial interpolation coefficients c 0 , . . . , c dλ ∈ F. ...
doi:10.1007/978-3-319-70503-3_22
fatcat:wmlspzu6hbfu7fppwkhy3osjma
Optimizing Deadline-Driven Bulk Data Transfers in Overlay Networks
2009
2009 Proceedings of 18th International Conference on Computer Communications and Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
We additionally explore alternative approaches based on heuristic routing strategies, both oblivious and time-domain optimized. ...
Evaluation shows that our approach finds optimal solutions, based on estimations of job arrival times, deadlines and transfer volumes. ...
[6] have proposed a polynomial-time oblivious algorithm that achieves poly-logarithmic competitivity. ...
doi:10.1109/icccn.2009.5235267
dblp:conf/icccn/AgapiSPPK09
fatcat:djkow742vvdmjoug6mu5anyrqi
Oblivious transfer based on single-qubit rotations
2017
Journal of Physics A: Mathematical and Theoretical
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We present a bit-string quantum oblivious transfer protocol based on single-qubit rotations. ...
We also present a single-bit oblivious transfer based on the proposed bit-string protocol. The protocol can be implemented with current technology based on optics. ...
Later, Even, Goldreich and Lempel presented a variation of this scheme called 1-outof-2 oblivious transfer [EGL85] . ...
doi:10.1088/1751-8121/aa6a69
fatcat:lyn2lj6pqzfjtfp5yzccxjcmbu
Making intra-domain routing robust to changing and uncertain traffic demands
2003
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications - SIGCOMM '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
Since traffic demand values are dynamic and illusive, is it possible to obtain a routing that is "robust" to variations in demands? ...
We then summarize a recent result [3] which established that an optimal oblivious routing (and the oblivious ratio) of a network can be computed in polynomial time in the size of the network. ...
Räcke's existential bound triggered the development of a polynomial time construction of an optimal oblivious routing [3] for any network (symmetric or not). ...
doi:10.1145/863955.863991
dblp:conf/sigcomm/ApplegateC03
fatcat:sruktxo2bbgvvmzyghklu4xkeq
« Previous
Showing results 1 — 15 out of 1,516 results