Sciweavers

278 search results - page 35 / 56
» Variants of Spreading Messages
Sort
View
ICFEM
2004
Springer
14 years 1 months ago
A General Model for Reachability Testing of Concurrent Programs
Reachability testing is a technique for testing concurrent programs. Reachability testing derives test sequences on-the-fly as the testing process progresses, and can be used to sy...
Richard H. Carver, Yu Lei
CRYPTO
2000
Springer
184views Cryptology» more  CRYPTO 2000»
13 years 12 months ago
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
A group signature scheme allows a group member to sign messages anonymously on behalf of the group. However, in the case of a dispute, the identity of a signature’s originator ca...
Giuseppe Ateniese, Jan Camenisch, Marc Joye, Gene ...
OPODIS
2008
13 years 9 months ago
With Finite Memory Consensus Is Easier Than Reliable Broadcast
We consider asynchronous distributed systems with message losses and process crashes. We study the impact of finite process memory on the solution to consensus, repeated consensus ...
Carole Delporte-Gallet, Stéphane Devismes, ...
JAR
2006
97views more  JAR 2006»
13 years 7 months ago
Decidability Issues for Extended Ping-Pong Protocols
We use some recent techniques from process algebra to draw several conclusions about the well studied class of ping-pong protocols introduced by Dolev and Yao. In particular we sho...
Hans Hüttel, Jirí Srba
COMPSEC
2004
99views more  COMPSEC 2004»
13 years 7 months ago
An improvement of nonrepudiable threshold proxy signature scheme with known signers
In a (t, n) threshold proxy signature scheme, which is a variant of the proxy signature scheme, the proxy signature key is shared among a group of n proxy signers delegated by the ...
Shiang-Feng Tzeng, Min-Shiang Hwang, Cheng-Ying Ya...