Sciweavers

82 search results - page 11 / 17
» Deciding knowledge properties of security protocols
Sort
View
IACR
2011
97views more  IACR 2011»
12 years 9 months ago
Two-Output Secure Computation with Malicious Adversaries
We present a method to compile Yao’s two-player garbled circuit protocol into one that is secure against malicious adversaries that relies on witness indistinguishability. Our ap...
Abhi Shelat, Chih-Hao Shen
IFIP
2010
Springer
13 years 4 months ago
Efficient Decision Procedures for Message Deducibility and Static Equivalence
Abstract. We consider two standard notions in formal security protocol analysis: message deducibility and static equivalence under equational theories. We present polynomial-time a...
Bruno Conchinha, David A. Basin, Carlos Caleiro
ICICS
2004
Springer
14 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
CISC
2009
Springer
148views Cryptology» more  CISC 2009»
13 years 7 months ago
Using Strategy Objectives for Network Security Analysis
The anticipation game framework is an extension of attack graphs based on game theory. It is used to anticipate and analyze intruder and administrator concurrent interactions with ...
Elie Bursztein, John C. Mitchell
ASIAN
2006
Springer
133views Algorithms» more  ASIAN 2006»
14 years 1 months ago
Normal Proofs in Intruder Theories
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...
Vincent Bernat, Hubert Comon-Lundh