Sciweavers

1066 search results - page 8 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
CPM
2008
Springer
112views Combinatorics» more  CPM 2008»
14 years 11 months ago
Computing Inverse ST in Linear Complexity
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
Ge Nong, Sen Zhang, Wai Hong Chan
INFOCOM
2011
IEEE
14 years 1 months ago
Secure and practical outsourcing of linear programming in cloud computing
—Cloud Computing has great potential of providing robust computational power to the society at reduced cost. It enables customers with limited computational resources to outsourc...
Cong Wang, Kui Ren, Jia Wang
MFCS
2007
Springer
15 years 3 months ago
Nearly Private Information Retrieval
A private information retrieval scheme is a protocol whereby a client obtains a record from a database without the database operators learning anything about which record the clien...
Amit Chakrabarti, Anna Shubina
ICALP
2005
Springer
15 years 3 months ago
Single-Database Private Information Retrieval with Constant Communication Rate
We present a single-database private information retrieval (PIR) scheme with communication complexity O(k+d), where k ≥ log n is a security parameter that depends on the database...
Craig Gentry, Zulfikar Ramzan
DEBS
2009
ACM
15 years 4 months ago
PrivateFlow: decentralised information flow control in event based middleware
Complex middleware frameworks are made out of interacting components which may include bugs. These frameworks are often extended to provide additional features by thirdparty exten...
Ioannis Papagiannis, Matteo Migliavacca, Peter R. ...