Sciweavers

1777 search results - page 28 / 356
» Programming Cryptographic Protocols
Sort
View
CJ
2002
70views more  CJ 2002»
13 years 8 months ago
Formal Methods for Assuring Security of Protocols
l examination of the underlying assumptions, abstractions, and possible actions. Consequently, assuring that a system behaves securely is virtually impossible without the use of ri...
Susan Older, Shiu-Kai Chin
CN
2006
117views more  CN 2006»
13 years 8 months ago
Using equivalence-checking to verify robustness to denial of service
In this paper, we introduce a new security property which intends to capture the ability of a cryptographic protocol being resistant to denial of service. This property, called im...
Stéphane Lafrance
CRYPTO
2007
Springer
110views Cryptology» more  CRYPTO 2007»
14 years 2 months ago
Cryptography in the Multi-string Model
The common random string model introduced by Blum, Feldman and Micali permits the construction of cryptographic protocols that are provably impossible to realize in the standard m...
Jens Groth, Rafail Ostrovsky
SCN
2008
Springer
131views Communications» more  SCN 2008»
13 years 8 months ago
CLL: A Cryptographic Link Layer for Local Area Networks
Abstract. Ethernet and IP form the basis of the vast majority of LAN installations. But these protocols do not provide comprehensive security mechanisms, and thus give way for a pl...
Yves Igor Jerschow, Christian Lochert, Björn ...
ASIACRYPT
2005
Springer
14 years 2 months ago
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
Martin Hirt, Jesper Buus Nielsen