Sciweavers

2043 search results - page 97 / 409
» Reasoning About Security Models
Sort
View
CHARME
2003
Springer
110views Hardware» more  CHARME 2003»
14 years 2 months ago
Exact and Efficient Verification of Parameterized Cache Coherence Protocols
Abstract. We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. F...
E. Allen Emerson, Vineet Kahlon
CTRSA
2001
Springer
129views Cryptology» more  CTRSA 2001»
14 years 3 months ago
Formal Security Proofs for a Signature Scheme with Partial Message Recovery
The Pintsov-Vanstone signature scheme with partial message recovery (PVSSR) is a variant of the Schnorr and Nyberg-Rueppel signature schemes. It produces very short signatures on ...
Daniel R. L. Brown, Donald Byron Johnson
SP
1997
IEEE
106views Security Privacy» more  SP 1997»
14 years 2 months ago
Secure Software Architectures
The computer industry is increasingly dependent on open architectural standards for their competitive success. This paper describes a new approach to secure system design in which...
Mark Moriconi, Xiaolei Qian, Robert A. Riemenschne...
ATAL
2006
Springer
14 years 2 months ago
Evaluating a computational model of social causality and responsibility
Intelligent agents are typically situated in a social environment and must reason about social cause and effect. Such reasoning is qualitatively different from physical causal rea...
Wenji Mao, Jonathan Gratch
CSE
2009
IEEE
14 years 1 months ago
Adapting Privacy-Preserving Computation to the Service Provider Model
There are many applications for Secure Multi-Party Computation (SMC), but practical adoption is still an issue. One reason is that the business model of the application does not m...
Florian Kerschbaum