Sciweavers

227 search results - page 27 / 46
» On the Reachability Problem in Cryptographic Protocols
Sort
View
OTM
2007
Springer
14 years 1 months ago
A Multi-party Rational Exchange Protocol
In recent years, existing computing schemes and paradigms have evolved towards more flexible, ad-hoc scalable frameworks. Nowadays, exchanging interactions between entities often ...
Almudena Alcaide, Juan M. Estévez-Tapiador,...
SIGCOMM
2009
ACM
14 years 2 months ago
SMACK: a SMart ACKnowledgment scheme for broadcast messages in wireless networks
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...
Aveek Dutta, Dola Saha, Dirk Grunwald, Douglas C. ...
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
14 years 1 months ago
A genetic algorithm for privacy preserving combinatorial optimization
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...
Jun Sakuma, Shigenobu Kobayashi
EUROCRYPT
2010
Springer
14 years 10 days ago
Adaptively Secure Broadcast
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...
Martin Hirt, Vassilis Zikas
ICISC
2007
100views Cryptology» more  ICISC 2007»
13 years 9 months ago
Pairing-Friendly Elliptic Curves with Small Security Loss by Cheon's Algorithm
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...
Aya Comuta, Mitsuru Kawazoe, Tetsuya Takahashi