Sciweavers

250 search results - page 27 / 50
» A Round and Communication Efficient Secure Ranking Protocol
Sort
View
STOC
2007
ACM
102views Algorithms» more  STOC 2007»
14 years 8 months ago
Zero-knowledge from secure multiparty computation
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...
CRYPTO
1994
Springer
98views Cryptology» more  CRYPTO 1994»
14 years 5 hour ago
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S...
Ronald Cramer, Ivan Damgård, Berry Schoenmak...
ITIIS
2008
153views more  ITIIS 2008»
13 years 8 months ago
Two-level Key Pool Design-based Random Key Pre-distribution in Wireless Sensor Networks
In this paper, the random key pre-distribution scheme introduced in ACM CCS'02 by Eschenauer and Gligor is reexamined, and a generalized form of key establishment is introduc...
Abedelaziz Mohaisen, DaeHun Nyang, Tamer AbuHmed
DASFAA
2003
IEEE
139views Database» more  DASFAA 2003»
14 years 1 months ago
Securing Your Data in Agent-Based P2P Systems
Peer-to-peer (P2P) technology can be naturally integrated with mobile agent technology in Internet applications, taking advantage of the autonomy, mobility, and efficiency of mobi...
Xiaolin Pang, Barbara Catania, Kian-Lee Tan
PAISI
2010
Springer
13 years 5 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...