4377 search results - page 532 / 876 » Mass problems and randomness |
162
click to vote
PKC
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. In this paper, we examine issues related to the construction of identity-based threshold decryption schemes and argue that it is important in practice to design an identi...
180
click to vote
VMCAI
2004
Springer
16 years 4 days ago
2004
Springer
In this paper we deal with the problem of applying model checking to real programs. We verify a program without constructing the whole transition system using a technique based on...
147
click to vote
ICDM
2003
IEEE
16 years 2 days ago
2003
IEEE
In knowledge discovery applications, where new features are to be added, an acquisition policy can help select the features to be acquired based on their relevance and the cost of...
199
click to vote
PODC
2003
ACM
16 years 1 days ago
2003
ACM
This paper presents an efficient asynchronous protocol to compute RSA inverses with respect to a public RSA modulus N whose factorization is secret and shared among a group of pa...
155
click to vote
CSCLP
2003
Springer
16 years 19 hour ago
2003
Springer
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...