Sciweavers

719 search results - page 103 / 144
» Proving Security Protocols Correct
Sort
View
WDAG
2007
Springer
128views Algorithms» more  WDAG 2007»
15 years 3 months ago
From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors
Abstract. This paper studies the impact of omission failures on asynchronous distributed systems with crash-stop failures. We provide two different transformations for algorithms,...
Carole Delporte-Gallet, Hugues Fauconnier, Felix C...
EUROCRYPT
2010
Springer
15 years 2 months ago
Bounded Key-Dependent Message Security
We construct the first public-key encryption scheme that is proven secure (in the standard model, under standard assumptions) even when the attacker gets access to encryptions of ...
Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval...
EEE
2005
IEEE
15 years 3 months ago
Who Counts Your Votes?
Open and fair elections are paramount to modern democracy. Although some people claim that the penciland-paper systems used in countries such as Canada and UK are still the best m...
Halina Kaminski, Lila Kari, Mark Perry
ICICS
2004
Springer
15 years 3 months ago
Robust Metering Schemes for General Access Structures
In order to decide on advertisement fees for web servers, Naor and Pinkas introduced (threshold) metering schemes secure against coalitions of corrupt servers and clients. They sho...
Ventzislav Nikov, Svetla Nikova, Bart Preneel
65
Voted
ICALP
2010
Springer
15 years 2 months ago
Compositional Closure for Bayes Risk in Probabilistic Noninterference
We give a quantitative sequential model for noninterference security with probability (but not demonic choice), and a novel refinement order that we prove to be the greatest compo...
Annabelle McIver, Larissa Meinicke, Carroll Morgan