Sciweavers

14 search results - page 3 / 3
» On the Necessary and Sufficient Assumptions for UC Computati...
Sort
View
CRYPTO
2006
Springer
111views Cryptology» more  CRYPTO 2006»
13 years 9 months ago
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
We address the message authentication problem in two seemingly different communication models. In the first model, the sender and receiver are connected by an insecure channel and...
Moni Naor, Gil Segev, Adam Smith
TCC
2009
Springer
142views Cryptology» more  TCC 2009»
14 years 6 months ago
Chosen-Ciphertext Security via Correlated Products
We initiate the study of one-wayness under correlated products. We are interested in identifying necessary and sufficient conditions for a function f and a distribution on inputs ...
Alon Rosen, Gil Segev
DC
2010
13 years 5 months ago
Refined quorum systems
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform f...
Rachid Guerraoui, Marko Vukolic
AISS
2010
146views more  AISS 2010»
13 years 24 days ago
Zatara, the Plug-in-able Eventually Consistent Distributed Database
With the proliferation of the computer Cloud, new software delivery methods were created. In order to build software to fit into one of these models, a scalable, easy to deploy st...
Bogdan Carstoiu, Dorin Carstoiu