Sciweavers

460 search results - page 36 / 92
» Heuristic Methods for Security Protocols
Sort
View
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
14 years 6 days ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
ATVA
2008
Springer
115views Hardware» more  ATVA 2008»
13 years 9 months ago
Authentication Revisited: Flaw or Not, the Recursive Authentication Protocol
Authentication and secrecy have been widely investigated in security protocols. They are closely related to each other and variants of definitions have been proposed, which focus o...
Guoqiang Li, Mizuhito Ogawa
ICICS
1997
Springer
13 years 12 months ago
Enforcing traceability in software
Traceability is a property of a communications protocol that ensures that the origin and/or destination of messages can be identified. The aims of this paper are twofold. Firstly t...
Colin Boyd
ACSAC
2005
IEEE
14 years 1 months ago
Verify Results of Network Intrusion Alerts Using Lightweight Protocol Analysis
We propose a method to verify the result of attacks detected by signature-based network intrusion detection systems using lightweight protocol analysis. The observation is that ne...
Jingmin Zhou, Adam J. Carlson, Matt Bishop
ICDCS
1998
IEEE
13 years 12 months ago
CLIQUES: A New Approach to Group Key Agreement
This paper considers the problem of key agreement in a group setting with highly-dynamic group member population. A protocol suite, called CLIQUES, is developed by extending the w...
Michael Steiner, Gene Tsudik, Michael Waidner