165 search results - page 14 / 33 » Cryptographic Complexity Classes and Computational Intractab... |
106
click to vote
KSEM
2009
Springer
15 years 6 months ago
2009
Springer
Measuring the inconsistency degree of an inconsistent knowledge base is an important problem as it provides context information for facilitating inconsistency handling. Many method...
ICLP
1999
Springer
15 years 4 months ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
122
click to vote
IACR
2011
13 years 11 months ago
2011
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...
CRYPTO
2006
Springer
15 years 3 months ago
2006
Springer
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
112
click to vote
GRC
2008
IEEE
15 years 23 days ago
2008
IEEE
—Secure multiparty computation is a very important research topic in cryptography. A secure multi-party computation involves N untrusful parties. It takes input xi from the ith p...