Sciweavers

489 search results - page 38 / 98
» Communication Complexity of Permutation-Invariant Functions
Sort
View
STOC
2007
ACM
102views Algorithms» more  STOC 2007»
15 years 11 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...
GIL
2008
15 years 1 days ago
Adoption of Supply Chain Management in German Agrifood Networks
: Supply chain management has emerged as cross functional, cross company concept to improve coordination of entire value chains through coordinated actions of all companies. It has...
Melanie Fritz, Eva Schneemann, Gerhard Schiefer
FOCS
2007
IEEE
15 years 5 months ago
Intrusion-Resilient Secret Sharing
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
Stefan Dziembowski, Krzysztof Pietrzak
FAST
2007
15 years 1 days ago
Proportional-Share Scheduling for Distributed Storage Systems
Fully distributed storage systems have gained popularity in the past few years because of their ability to use cheap commodity hardware and their high scalability. While there are...
Yin Wang, Arif Merchant
PVLDB
2010
152views more  PVLDB 2010»
14 years 9 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...