Sciweavers

413 search results - page 19 / 83
» Abstract Argumentation Scheme Frameworks
Sort
View
SP
2009
IEEE
114views Security Privacy» more  SP 2009»
15 years 4 months ago
Formally Certifying the Security of Digital Signature Schemes
We present two machine-checked proofs of the existential unforgeability under adaptive chosen-message attacks of the Full Domain Hash signature scheme. These proofs formalize the ...
Santiago Zanella Béguelin, Gilles Barthe, B...
COMMA
2008
14 years 11 months ago
Basic influence diagrams and the liberal stable semantics
Abstract. This paper is concerned with the general problem of constructing decision tables and more specifically, with the identification of all possible outcomes of decisions. We ...
Paul-Amaury Matt, Francesca Toni
COMMA
2006
14 years 11 months ago
Semi-Stable Semantics
In this paper, we examine an argument-based semantics called semi-stable semantics. Semi-stable semantics is quite close to traditional stable semantics in the sense that every st...
Martin Caminada
ESORICS
2009
Springer
15 years 10 months ago
Formal Indistinguishability Extended to the Random Oracle Model
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
Cristian Ene, Yassine Lakhnech, Van Chan Ngo
78
Voted
APPROX
2008
Springer
107views Algorithms» more  APPROX 2008»
14 years 11 months ago
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined in
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
Shashi Mittal, Andreas S. Schulz