Sciweavers

1585 search results - page 169 / 317
» Automatically optimizing secure computation
Sort
View
CRYPTO
1995
Springer
111views Cryptology» more  CRYPTO 1995»
13 years 11 months ago
Fast Key Exchange with Elliptic Curve Systems
The Diffie-Hellman key exchange algorithm can be implemented using the group of points on an elliptic curve over the field F2n. A software version of this using n = 155 can be o...
Richard Schroeppel, Hilarie K. Orman, Sean W. O'Ma...
WISEC
2010
ACM
14 years 3 months ago
On the tradeoff between trust and privacy in wireless ad hoc networks
As privacy moves to the center of attention in networked systems, and the need for trust remains a necessity, an important question arises: How do we reconcile the two seemingly c...
Maxim Raya, Reza Shokri, Jean-Pierre Hubaux
ICAC
2009
IEEE
14 years 2 months ago
Threat-model-driven runtime adaptation and evaluation of intrusion detection system
We present a mechanism for autonomous self-adaptation of a network-based intrusion detection system (IDS). The system is composed of a set of cooperating agents, each of which is ...
Martin Rehák, Eugen Staab, Volker Fusenig, ...
AGENTS
2001
Springer
14 years 21 days ago
An auction-based method for decentralized train scheduling
We present a computational study of an auction-based method for decentralized train scheduling. The method is well suited to the natural information and control structure of moder...
David C. Parkes, Lyle H. Ungar
SEC
2001
13 years 9 months ago
Communication-Efficient Group Key Agreement
Abstract Traditionally, research in secure group key agreement focuses on minimizing the computational overhead for cryptographic operations, and minimizing the communication overh...
Yongdae Kim, Adrian Perrig, Gene Tsudik