977 search results - page 1 / 196 » Secure Computation with Fixed-Point Numbers |
122
click to vote
FC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Secure computation is a promising approach to business problems in which several parties want to run a joint application and cannot reveal their inputs. Secure computatio...
133
click to vote
ESORICS
2010
Springer
15 years 3 months ago
2010
Springer
Collaborative optimization problems can often be modeled as a linear program whose objective function and constraints combine data from several parties. However, important applicat...
182
Voted
FOSAD
2009
Springer
15 years 10 months ago
2009
Springer
We introduce the Open-source Fixed-point Model Checker OFMC for symbolic security protocol analysis, which extends the Onthe-fly Model Checker (the previous OFMC). The native inpu...
118
click to vote
DLT
2008
15 years 4 months ago
2008
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
169
click to vote
SAS
1994
Springer
15 years 7 months ago
1994
Springer
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...