Sciweavers

3504 search results - page 387 / 701
» Secure protocol composition
Sort
View
CSFW
2007
IEEE
16 years 1 months ago
Computationally Sound Mechanized Proofs of Correspondence Assertions
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
Bruno Blanchet
ACNS
2007
Springer
129views Cryptology» more  ACNS 2007»
16 years 26 days ago
Gradually Convertible Undeniable Signatures
In 1990, Boyar, Chaum, Damg˚ard and Pedersen introduced convertible undeniable signatures which limit the self-authenticating property of digital signatures but can be converted b...
Laila El Aimani, Damien Vergnaud
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
16 years 25 days 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
P2P
2006
IEEE
119views Communications» more  P2P 2006»
16 years 20 days ago
Defense against Intrusion in a Live Streaming Multicast System
Application-level multicast systems are vulnerable to attacks that impede nodes from receiving desired data. Live streaming protocols are especially susceptible to packet loss ind...
Maya Haridasan, Robbert van Renesse
FC
2005
Springer
88views Cryptology» more  FC 2005»
16 years 6 days ago
Small Coalitions Cannot Manipulate Voting
We demonstrate how to make voting protocols resistant against manipulation by computationally bounded malicious voters, by extending the previous results of Conitzer and Sandholm i...
Edith Elkind, Helger Lipmaa