Sciweavers

1210 search results - page 59 / 242
» Secure Logic Synthesis
Sort
View
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 10 months ago
Modeling Adversaries in a Logic for Security Protocol Analysis
Logics for security protocol analysis require the formalization of an adversary model that specifies the capabilities of adversaries. A common model is the Dolev-Yao model, which c...
Joseph Y. Halpern, Riccardo Pucella
ENTCS
2010
99views more  ENTCS 2010»
13 years 10 months ago
Describing Secure Interfaces with Interface Automata
Interface automata are a model that allows for the representation of stateful interfaces. In this paper we introduce a variant of interface automata, which we call interface struc...
Matias Lee, Pedro R. D'Argenio
DEON
2008
Springer
13 years 11 months ago
Trust and Norms in the Context of Computer Security: A Logical Formalization
Abstract. In this paper we present a logical model of trust in which trust is conceived as an expectation of the truster about some properties of the trustee. A general typology of...
Emiliano Lorini, Robert Demolombe
SIGECOM
2003
ACM
115views ECommerce» more  SIGECOM 2003»
14 years 3 months ago
Betting boolean-style: a framework for trading in securities based on logical formulas
We develop a framework for trading in compound securities: financial instruments that pay off contingent on the outcomes of arbitrary statements in propositional logic. Buying o...
Lance Fortnow, Joe Kilian, David M. Pennock, Micha...
CCIA
2009
Springer
13 years 11 months ago
Secure and Optimal Base Contraction in Graded Lukasiewicz Logics
Abstract. The operation of base contraction was successfully characterized for a very general class of logics using the notion of remainder sets. Although, in the general case, thi...
Pere Pardo, Pilar Dellunde, Lluis Godo