Sciweavers

5488 search results - page 249 / 1098
» On the Secure Implementation of Security Protocols
Sort
View
CSFW
1999
IEEE
15 years 11 months ago
Mixed Strand Spaces
Strand space analysis [13, 12] is a method for stating and proving correctness properties for cryptographic protocols. In this paper we apply the same method to the related proble...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...
ISW
2005
Springer
16 years 3 days 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
FOSSACS
2009
Springer
16 years 1 months ago
Cryptographic Protocol Composition via the Authentication Tests
Although cryptographic protocols are typically analyzed in isolation, they are used in combinations. If a protocol was analyzed alone and shown to meet some security goals, will it...
Joshua D. Guttman