1173 search results - page 133 / 235 » On the Compositionality of Round Abstraction |
118
Voted
SEC
2001
15 years 2 months ago
2001
Abstract Traditionally, research in secure group key agreement focuses on minimizing the computational overhead for cryptographic operations, and minimizing the communication overh...
111
click to vote
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
This paper presents an argumentative version of the well known alternating offers negotiation protocol. The negotichanism is based on an abstract preference based argumentation fr...
102
Voted
SIAMCOMP
2008
15 years 18 days ago
2008
Abstract. The Perceptron algorithm, despite its simplicity, often performs well in online classification tasks. The Perceptron becomes especially effective when it is used in conju...
98
Voted
JCP
2007
15 years 17 days ago
2007
Abstract— Converting a secure group key agreement protocol into password-based setting is not a trivial task. The security of a password-based scheme hinges on preventing diction...
128
click to vote
TON
2008
15 years 17 days ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...