Sciweavers

161 search results - page 5 / 33
» Combining Algorithms for Deciding Knowledge in Security Prot...
Sort
View
CSFW
1999
IEEE
14 years 26 days ago
I/O Automaton Models and Proofs for Shared-Key Communication Systems
The combination of two security protocols, a simple shared-key communication protocol and the Di e-Hellman key distribution protocol, is modeled formally and proved correct. The m...
Nancy A. Lynch
ICCAD
2006
IEEE
125views Hardware» more  ICCAD 2006»
14 years 5 months ago
Leveraging protocol knowledge in slack matching
Stalls, due to mis-matches in communication rates, are a major performance obstacle in pipelined circuits. If the rate of data production is faster than the rate of consumption, t...
Girish Venkataramani, Seth Copen Goldstein
TCC
2007
Springer
116views Cryptology» more  TCC 2007»
14 years 2 months ago
Long-Term Security and Universal Composability
Abstract. Algorithmic progress and future technology threaten today’s cryptographic protocols. Long-term secure protocols should not even in future reveal more information to aâ€...
Jörn Müller-Quade, Dominique Unruh
IJWIS
2007
153views more  IJWIS 2007»
13 years 8 months ago
A security framework for agent-based systems
Purpose – This paper aims to address some security issues in open systems such as service-oriented applications and grid computing. It proposes a security framework for these sy...
Jamal Bentahar, Francesca Toni, John-Jules Ch. Mey...
SEMWEB
2004
Springer
14 years 1 months ago
Query Answering for OWL-DL with Rules
Both OWL-DL and function-free Horn rules3 are decidable logics with interesting, yet orthogonal expressive power: from the rules perspective, OWL-DL is restricted to tree-like rule...
Boris Motik, Ulrike Sattler, Rudi Studer