1066 search results - page 16 / 214 » Computing Private Set Operations with Linear Complexities |
COCO
2008
Springer
14 years 11 months ago
2008
Springer
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
VLDB
2005
ACM
15 years 3 months ago
2005
ACM
When a private relational table is published using views, secrecy or privacy may be violated. This paper uses a formally-defined notion of k-anonymity to measure disclosure by vi...
SIBGRAPI
2006
IEEE
15 years 3 months ago
2006
IEEE
Statistical discrimination methods are suitable not only for classification but also for characterisation of differences between a reference group of patterns and the population u...
CIE
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
CRYPTO
2008
Springer
14 years 11 months ago
2008
Springer
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...