Sciweavers

35419 search results - page 199 / 7084
» How are we doing
Sort
View
WPES
2006
ACM
15 years 10 months ago
Private social network analysis: how to assemble pieces of a graph privately
Connections in distributed systems, such as social networks, online communities or peer-to-peer networks, form complex graphs. These graphs are of interest to scientists in field...
Keith B. Frikken, Philippe Golle
CIG
2005
IEEE
15 years 10 months ago
How to Protect Peer-to-Peer Online Games from Cheats
Abstract- Recently, P2P (peer-to-peer) online game systems have attracted a great deal of public attention. They work without central servers, thus, the maintenance and organizatio...
Haruhiro Yoshimoto, Rie Shigetomi, Hideki Imai
EUROCRYPT
2005
Springer
15 years 10 months ago
How to Break MD5 and Other Hash Functions
Abstract. MD5 is one of the most widely used cryptographic hash functions nowadays. It was designed in 1992 as an improvement of MD4, and its security was widely studied since then...
Xiaoyun Wang, Hongbo Yu
ACNS
2003
Springer
130views Cryptology» more  ACNS 2003»
15 years 9 months ago
Generalized Key-Evolving Signature Schemes or How to Foil an Armed Adversary
Key exposures, known or inconspicuous, are a real security threat. Recovery mechanisms from such exposures are required. For digital signatures such a recovery should ideally —an...
Gene Itkis, Peng Xie
ATAL
2003
Springer
15 years 9 months ago
How to calm hyperactive agents
System performance in multi-agent resource allocation systems can often improve if individual agents reduce their activity. Agents in such systems need a way to modulate their ind...
H. Van Dyke Parunak, Sven Brueckner, Robert S. Mat...