Sciweavers

3504 search results - page 204 / 701
» Secure protocol composition
Sort
View
ISW
2005
Springer
15 years 12 months ago
Constant Round Dynamic Group Key Agreement
We present a fully symmetric constant round authenticated group key agreement protocol in dynamic scenario. Our proposed scheme achieves forward secrecy and is provably secure und...
Ratna Dutta, Rana Barua
CRYPTO
2008
Springer
76views Cryptology» more  CRYPTO 2008»
15 years 8 months ago
Scalable Multiparty Computation with Nearly Optimal Work and Resilience
We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmical...
Ivan Damgård, Yuval Ishai, Mikkel Krø...
IPL
2006
118views more  IPL 2006»
15 years 6 months ago
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Stéphanie Delaune
JCP
2006
120views more  JCP 2006»
15 years 6 months ago
Password-authenticated Key Exchange using Efficient MACs
Abstract-- This paper is concerned with passwordauthenticated key agreement protocols. Designing such protocols represents an interesting challenge since there is no standard way o...
Maurizio Adriano Strangio
FASE
2005
Springer
15 years 12 months 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