Sciweavers

325 search results - page 34 / 65
» Proofs of Restricted Shuffles
Sort
View
SP
2000
IEEE
14 years 2 months ago
A Practically Implementable and Tractable Delegation Logic
We address the goal of making Delegation Logic (DL) into a practically implementable and tractable trustmanagement system. DL [22] is a logic-based knowledge representation (i.e.,...
Ninghui Li, Benjamin N. Grosof, Joan Feigenbaum
CSFW
1999
IEEE
14 years 2 months ago
A Meta-Notation for Protocol Analysis
Most formal approaches to security protocol analysis are based on a set of assumptions commonly referred to as the "Dolev-Yao model." In this paper, we use a multiset re...
Iliano Cervesato, Nancy A. Durgin, Patrick Lincoln...
BIRTHDAY
2006
Springer
14 years 1 months ago
Best-First Rippling
Rippling is a form of rewriting that guides search by only performing steps that reduce the syntactic differences between formulae. Termination is normally ensured by a measure th...
Moa Johansson, Alan Bundy, Lucas Dixon
FSE
2006
Springer
116views Cryptology» more  FSE 2006»
14 years 1 months ago
On Feistel Structures Using a Diffusion Switching Mechanism
We study a recently proposed design approach of Feistel structure which employs diffusion matrices in a switching way. At ASIACRYPT 2004, Shirai and Preneel have proved that large ...
Taizo Shirai, Kyoji Shibutani
JAIR
2007
146views more  JAIR 2007»
13 years 9 months ago
Reasoning with Very Expressive Fuzzy Description Logics
It is widely recognized today that the management of imprecision and vagueness will yield more intelligent and realistic knowledge-based applications. Description Logics (DLs) are...
Giorgos Stoilos, Giorgos B. Stamou, Jeff Z. Pan, V...