Sciweavers

1199 search results - page 212 / 240
» Parameterized Proof Complexity
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...
JAR
2008
107views more  JAR 2008»
13 years 7 months ago
Differential Dynamic Logic for Hybrid Systems
Hybrid systems are models for complex physical systems and are defined as dynamical systems with interacting discrete transitions and continuous evolutions along differential equat...
André Platzer
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 ...
SOCO
2008
Springer
13 years 7 months ago
Interface Composition for Web Service Intermediaries
Abstract. The use of XML as a format for message exchange makes Web services well suited for composition of heterogeneous components. However, since clients must manage differences...
Sara Forghanizadeh, Eric Wohlstadter
IPL
2007
111views more  IPL 2007»
13 years 7 months ago
Powering requires threshold depth 3
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
Alexander A. Sherstov