721 search results - page 22 / 145 » Almost universal graphs |
103
click to vote
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
115
click to vote
IPL
2006
15 years 22 days ago
2006
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
155
Voted
FOCS
2003
IEEE
15 years 6 months ago
2003
IEEE
Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting i...
88
Voted
DAGSTUHL
2007
15 years 2 months ago
2007
The parallel universes idea is an attempt to integrate several aspects of learning which share some common aspects. This is an interesting idea: if successful, insights could cross...
148
click to vote
EUROCRYPT
2010
Springer
15 years 5 months ago
2010
Springer
This paper revisits the construction of Universal One-Way Hash Functions (UOWHFs) from any one-way function due to Rompel (STOC 1990). We give a simpler construction of UOWHFs, whi...