Sciweavers

211 search results - page 21 / 43
» A Message Recognition Protocol Based on Standard Assumptions
Sort
View
PODC
2006
ACM
14 years 1 months ago
Self-stabilizing byzantine agreement
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
Ariel Daliot, Danny Dolev
CN
2006
66views more  CN 2006»
13 years 8 months ago
Secure acknowledgment aggregation and multisignatures with limited robustness
In certain reliable group-oriented and multicast applications, a source needs to securely verify whether all (and if not all, which) intended receivers have received a message. How...
Claude Castelluccia, Stanislaw Jarecki, Jihye Kim,...
WONS
2005
IEEE
14 years 1 months ago
Frequency Allocation for WLANs Using Graph Colouring Techniques
At present, no standard frequency allocation mechanism exists for Wireless LAN access points. In this article, we introduce a number of techniques based on graph colouring algorit...
Janne Riihijärvi, Marina Petrova, Petri M&aum...
CRYPTO
2000
Springer
122views Cryptology» more  CRYPTO 2000»
13 years 11 months ago
Efficient Non-malleable Commitment Schemes
We present efficient non-malleable commitment schemes based on standard assumptions such as RSA and Discrete-Log, and under the condition that the network provides publicly availab...
Marc Fischlin, Roger Fischlin
HICSS
2005
IEEE
158views Biometrics» more  HICSS 2005»
14 years 1 months ago
Social Networks in Peer-to-Peer Systems
The Gnutella protocol requires peers to broadcast messages to their neighbours when they search files. The message passing generates a lot of traffic in the network, which degrade...
Yamini Upadrashta, Julita Vassileva, Winfried K. G...