Sciweavers

1066 search results - page 3 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
EUROCRYPT
2004
Springer
13 years 8 months ago
Efficient Private Matching and Set Intersection
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
Michael J. Freedman, Kobbi Nissim, Benny Pinkas
WETICE
2003
IEEE
13 years 10 months ago
Design and Implementation of Virtual Private Services
Large scale distributed applications such as electronic commerce and online marketplaces combine network access with multiple storage and computational elements. The distributed r...
Sotiris Ioannidis, Steven M. Bellovin, John Ioanni...
IJNSEC
2007
139views more  IJNSEC 2007»
13 years 4 months ago
Virtual Private Services: Coordinated Policy Enforcement for Distributed Applications
Large scale distributed applications combine network access with multiple storage and computational elements. The distributed responsibility for resource control creates new secur...
Sotiris Ioannidis, Steven M. Bellovin, John Ioanni...
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
13 years 8 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
ISW
2010
Springer
13 years 2 months ago
Efficient Computationally Private Information Retrieval from Anonymity or Trapdoor Groups
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...
Jonathan T. Trostle, Andy Parrish