588 search results - page 25 / 118 » Reducibility and Completeness in Private Computations |
SAC
2005
ACM
14 years 1 months ago
2005
ACM
Machine learning techniques are widely used in negotiation systems. To get more accurate and satisfactory learning results, negotiation parties have the desire to employ learning ...
WCNC
2008
IEEE
14 years 1 months ago
2008
IEEE
—Popularity of group-oriented applications motivates research on security and privacy protection for group communications. A number of group key agreement protocols exploiting ID...
STACS
2001
Springer
13 years 12 months ago
2001
Springer
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
The access control provided by a physical lock is based on the assumption that the information content of the corresponding key is private -- that duplication should require eithe...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...