1818 search results - page 201 / 364 » Granularity-Adaptive Proof Presentation |
105
Voted
CRYPTO
2007
Springer
15 years 9 months ago
2007
Springer
At Crypto ’06, Bellare presented new security proofs for HMAC and NMAC, under the assumption that the underlying compression function is a pseudo-random function family. Converse...
102
Voted
TAMC
2007
Springer
15 years 9 months ago
2007
Springer
We say that A ≤LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real γ, oracle B can also find patterns on ...
131
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
124
Voted
IMTCI
2004
Springer
15 years 9 months ago
2004
Springer
The paper presents two new methods for providing mobile agents with privacy and anynomity. The proposed schemes are based on different cryptographic primitives: a secret-sharing s...
151
Voted
RTSS
2003
IEEE
15 years 9 months ago
2003
IEEE
Schedulability tests are presented for preemptive earliest-deadline-first and deadline-monotonic scheduling of periodic or sporadic real-time tasks on a singlequeue Ñ-server sys...