Sciweavers

137 search results - page 23 / 28
» Automated Reasoning for Security Protocol Analysis
Sort
View
FASE
2005
Springer
14 years 29 days ago
Modelling Parametric Contracts and the State Space of Composite Components by Graph Grammars
Modeling the dependencies between provided and required services within a software component is necessary for several reasons, such as automated component adaptation and architectu...
Ralf Reussner, Jens Happe, Annegret Habel
ICLP
2007
Springer
14 years 1 months ago
Universal Timed Concurrent Constraint Programming
Abstract In this doctoral work we aim at developing a rich timed concurrent constraint (tcc) based language with strong ties to logic. The new calculus called Universal Timed Concu...
Carlos Olarte, Catuscia Palamidessi, Frank Valenci...
PODC
2010
ACM
13 years 11 months ago
Brief announcement: anonymity and trust in distributed systems
In this paper, we present a framework for achieving anonymity and trust, two seemingly contradictory properties, in distributed systems. Our approach builds on webs of trust, a we...
Michael Backes, Stefan Lorenz, Matteo Maffei, Kim ...
SP
2008
IEEE
103views Security Privacy» more  SP 2008»
14 years 1 months ago
Preserving Caller Anonymity in Voice-over-IP Networks
— Applications such as VoIP need to provide anonymity to clients while maintaining low latency to satisfy quality of service (QoS) requirements. Existing solutions for providing ...
Mudhakar Srivatsa, Ling Liu, Arun Iyengar
JOC
2011
104views more  JOC 2011»
12 years 10 months ago
Short Undeniable Signatures Based on Group Homomorphisms
This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully s...
Jean Monnerat, Serge Vaudenay