198 search results - page 19 / 40 » Weak Probabilistic Anonymity |
SIAMREV
2011
14 years 8 days ago
2011
This paper deals with efficient numerical representation and manipulation of differential and integral operators as symbols in phase-space, i.e., functions of space x and frequen...
FOSSACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We study the interaction between non-deterministic and probabilistic behaviour in systems with continuous state spaces, arbitrary probability distributions and uncountabl...
DSS
2008
14 years 9 months ago
2008
Intelligent software agents are promising in improving the effectiveness of e-marketplaces for e-commerce. Although a large amount of research has been conducted to develop negoti...
ACNS
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we present techniques by which each mix in a mix network can be paid for its services by message senders, in a way that ensures fairness and without sacrificing anon...
STOC
1999
ACM
15 years 1 months ago
1999
ACM
Oblivious polynomial evaluation is a protocol involving two parties, a sender whose input is a polynomial P, and a receiver whose input is a value α. At the end of the protocol t...