Sciweavers

4761 search results - page 418 / 953
» Performance of Protocols
Sort
View
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
16 years 7 months ago
Covert two-party computation
We introduce the novel concept of covert two-party computation. Whereas ordinary secure two-party computation only guarantees that no more knowledge is leaked about the inputs of t...
Luis von Ahn, Nicholas J. Hopper, John Langford
TLDI
2009
ACM
155views Formal Methods» more  TLDI 2009»
16 years 3 months ago
Opis: reliable distributed systems in OCaml
The importance of distributed systems is growing as computing devices become ubiquitous and bandwidth becomes plentiful. Concurrency and distribution pose algorithmic and implemen...
Pierre-Évariste Dagand, Dejan Kostic, Vikto...
CRYPTO
2009
Springer
145views Cryptology» more  CRYPTO 2009»
16 years 1 months ago
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject o...
Joël Alwen, Yevgeniy Dodis, Daniel Wichs
OPODIS
2007
15 years 8 months ago
The Cost of Monotonicity in Distributed Graph Searching
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
David Ilcinkas, Nicolas Nisse, David Soguet
ECCC
2010
98views more  ECCC 2010»
15 years 5 months ago
Verifying Computations with Streaming Interactive Proofs
Applications based on outsourcing computation require guarantees to the data owner that the desired computation has been performed correctly by the service provider. Methods based...
Graham Cormode, Justin Thaler, Ke Yi