Sciweavers

597 search results - page 33 / 120
» Homomorphisms of random paths
Sort
View
ACNS
2004
Springer
131views Cryptology» more  ACNS 2004»
15 years 1 months ago
Evaluating Security of Voting Schemes in the Universal Composability Framework
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...
Jens Groth
EUROCRYPT
2004
Springer
15 years 1 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
ASIACRYPT
2008
Springer
14 years 11 months ago
Compact Proofs of Retrievability
In a proof-of-retrievability system, a data storage center must prove to a verifier that he is actually storing all of a client's data. The central challenge is to build syst...
Hovav Shacham, Brent Waters
88
Voted
JCP
2007
148views more  JCP 2007»
14 years 9 months ago
P3ARM-t: Privacy-Preserving Protocol for Association Rule Mining with t Collusion Resistance
— The ability to mine large volumes of distributed datasets enables more precise decision making. However, privacy concerns should be carefully addressed when mining datasets dis...
Iman Saleh, Mohamed Eltoweissy
INFOCOM
2010
IEEE
14 years 8 months ago
RIPPLE Authentication for Network Coding
Abstract—By allowing routers to randomly mix the information content in packets before forwarding them, network coding can maximize network throughput in a distributed manner wit...
Yaping Li, Hongyi Yao, Minghua Chen, Sidharth Jagg...