Sciweavers

1066 search results - page 2 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
IACR
2011
127views more  IACR 2011»
12 years 3 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
FOSSACS
2007
Springer
13 years 7 months ago
The Complexity of Generalized Satisfiability for Linear Temporal Logic
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
Michael Bauland, Thomas Schneider 0002, Henning Sc...
FSS
2008
124views more  FSS 2008»
13 years 3 months ago
Exact calculations of extended logical operations on fuzzy truth values
In this paper we propose computationally simple, pointwise formulas for extended t-norms and t-conorms on fuzzy truth values. The complex convolutions of the extended operations a...
Zsolt Gera, József Dombi
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
13 years 5 months ago
Practical Private Computation and Zero-Knowledge Tools for Privacy-Preserving Distributed Data Mining
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
Yitao Duan, John F. Canny
PQCRYPTO
2010
187views Cryptology» more  PQCRYPTO 2010»
13 years 7 months ago
Information-Set Decoding for Linear Codes over Fq
The best known non-structural attacks against code-based cryptosystems are based on information-set decoding. Stern’s algorithm and its improvements are well optimized and the co...
Christiane Peters