Sciweavers

62 search results - page 2 / 13
» Non-Local Box Complexity and Secure Function Evaluation
Sort
View
ISSAC
2007
Springer
153views Mathematics» more  ISSAC 2007»
13 years 11 months ago
On exact and approximate interpolation of sparse rational functions
The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation alg...
Erich Kaltofen, Zhengfeng Yang
ACNS
2004
Springer
131views Cryptology» more  ACNS 2004»
13 years 8 months ago
Evaluating Security of Voting Schemes in the Universal Composability Framework
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...
Jens Groth
RC
2007
113views more  RC 2007»
13 years 4 months ago
A Search Algorithm for Calculating Validated Reliability Bounds
The search algorithm presented allows the CDF of a dependent variable to be bounded with 100%confidence,andallowsforaguaranteedevaluationof theerror involved.Thesereliabilitybound...
Fulvio Tonon
CCS
2007
ACM
13 years 11 months ago
An algorithm for the appraisal of assurance indicators for complex business processes
In order to provide certified security services we must provide indicators that can measure the level of assurance that a complex business process can offer. Unfortunately the fo...
Fabio Massacci, Artsiom Yautsiukhin
ACNS
2010
Springer
134views Cryptology» more  ACNS 2010»
13 years 6 months ago
Efficient and Secure Evaluation of Multivariate Polynomials and Applications
In this work, we design two-party and multiparty protocols for evaluating multivariate polynomials at participants' inputs with security against a malicious adversary who may ...
Matthew K. Franklin, Payman Mohassel