227 search results - page 27 / 46 » On the Reachability Problem in Cryptographic Protocols |
142
click to vote
OTM
2007
Springer
15 years 10 months ago
2007
Springer
In recent years, existing computing schemes and paradigms have evolved towards more flexible, ad-hoc scalable frameworks. Nowadays, exchanging interactions between entities often ...
143
click to vote
SIGCOMM
2009
ACM
15 years 10 months ago
2009
ACM
Network protocol designers, both at the physical and network level, have long considered interference and simultaneous transmission in wireless protocols as a problem to be avoide...
121
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
We propose a protocol for a local search and a genetic algorithm for the distributed traveling salesman problem (TSP). In the distributed TSP, information regarding the cost funct...
147
click to vote
EUROCRYPT
2010
Springer
15 years 9 months ago
2010
Springer
A broadcast protocol allows a sender to distribute a message through a point-to-point network to a set of parties, such that (i) all parties receive the same message, even if the s...
140
click to vote
ICISC
2007
15 years 5 months ago
2007
Pairing based cryptography is a new public key cryptographic scheme. An elliptic curve suitable for pairing based cryptography is called a “pairing-friendly” elliptic curve. Af...