Sciweavers

612 search results - page 59 / 123
» Hardness assumptions in the foundations of theoretical compu...
Sort
View
CRYPTO
1997
Springer
128views Cryptology» more  CRYPTO 1997»
13 years 12 months ago
Collision-Resistant Hashing: Towards Making UOWHFs Practical
ded abstract of this paper appears in Advances in Cryptology { Crypto 97 Proceedings, Lecture Notes in Computer Science Vol. 1294, B. Kaliski ed., Springer-Verlag, 1997. This is th...
Mihir Bellare, Phillip Rogaway
SIGCOMM
2003
ACM
14 years 1 months ago
A comparison of hard-state and soft-state signaling protocols
One of the key infrastructure components in all telecommunication networks, ranging from the telephone network, to VC-oriented data networks, to the Internet, is its signaling sys...
Ping Ji, Zihui Ge, James F. Kurose, Donald F. Tows...
IMSCCS
2006
IEEE
14 years 1 months ago
Intelligent Decision Making for Agreement-based Grid Resource Management
Agreement-based resource management is becoming the foundation of grid system. Since the grid resource management encompasses a wide range of different scenarios, the decision mak...
Rui Liu, Weimin Zheng, Yongwei Wu
IH
2001
Springer
14 years 8 days ago
Real World Patterns of Failure in Anonymity Systems
Abstract. We present attacks on the anonymity and pseudonymity provided by a “lonely hearts” dating service and by the HushMail encrypted email system. We move on to discuss so...
Richard Clayton, George Danezis, Markus G. Kuhn
JOC
2002
76views more  JOC 2002»
13 years 7 months ago
A Note on Negligible Functions
In theoretical cryptography, one formalizes the notion of an adversary's success probability being "too small to matter" by asking that it be a negligible function ...
Mihir Bellare