Sciweavers

793 search results - page 140 / 159
» Argumentation and standards of proof
Sort
View
IJISEC
2006
113views more  IJISEC 2006»
13 years 7 months ago
Escrow-free encryption supporting cryptographic workflow
Since Boneh and Franklin published their seminal paper on identity based encryption (IBE) using the Weil pairing , there has been a great deal of interest in cryptographic primitiv...
Sattam S. Al-Riyami, John Malone-Lee, Nigel P. Sma...
ENTCS
2007
129views more  ENTCS 2007»
13 years 7 months ago
Protocol Composition Logic (PCL)
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a pro...
Anupam Datta, Ante Derek, John C. Mitchell, Arnab ...
JSYML
2006
91views more  JSYML 2006»
13 years 7 months ago
On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories
Modifying the methods of Z. Adamowicz's paper Herbrand consistency and bounded arithmetic (Fund. Math. 171 (2002)), we show that there exists a number n such that m Sm (the u...
Leszek Aleksander Kolodziejczyk
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
13 years 7 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl
TFS
2008
93views more  TFS 2008»
13 years 7 months ago
Using Fuzzy Logic to Design Separation Function in Flocking Algorithms
Abstract--Flocking algorithms essentially consist of three components: alignment, cohesion, and separation. To track a desired trajectory, the flock center should move along the de...
Dongbing Gu, Huosheng Hu