Sciweavers

2601 search results - page 413 / 521
» Secure Rewarding Schemes
Sort
View
PAISI
2010
Springer
15 years 1 months ago
Efficient Privacy Preserving K-Means Clustering
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...
Maneesh Upmanyu, Anoop M. Namboodiri, Kannan Srina...
CCS
2011
ACM
14 years 3 months ago
Proofs of ownership in remote storage systems
Cloud storage systems are becoming increasingly popular. A promising technology that keeps their cost down is deduplication, which stores only a single copy of repeating data. Cli...
Shai Halevi, Danny Harnik, Benny Pinkas, Alexandra...
IACR
2011
135views more  IACR 2011»
14 years 2 months ago
An Improved Internet Voting Protocol
Norway is going to experience an Internet voting scheme in September 2011 for local governmental elections, targeting a comprehensive Internet voting system in 2017 for national el...
Mehmet Sabir Kiraz, Süleyman Kardas, Muhammed...
PKC
2009
Springer
172views Cryptology» more  PKC 2009»
16 years 3 months ago
CCA-Secure Proxy Re-encryption without Pairings
ded abstract of this paper appears in PKC 2009, S. Jarecki, G. Tsudik (Eds.), volume 5443 of LNCS, pp. 357-376, Sringer-Verlag, 2009. CCA-Secure Proxy Re-Encryption without Pairing...
Jun Shao, Zhenfu Cao
NDSS
2007
IEEE
15 years 9 months ago
Attribute-Based Publishing with Hidden Credentials and Hidden Policies
With Hidden Credentials Alice can send policyencrypted data to Bob in such a way that he can decrypt the data only with the right combination of credentials. Alice gains no knowle...
Apu Kapadia, Patrick P. Tsang, Sean W. Smith