1818 search results - page 201 / 364 » Granularity-Adaptive Proof Presentation |
147
click to vote
CRYPTO
2007
Springer
16 years 19 days 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...
147
click to vote
TAMC
2007
Springer
16 years 17 days 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 ...
169
click to vote
COMPGEOM
2004
ACM
15 years 12 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...
167
click to vote
IMTCI
2004
Springer
15 years 11 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...
187
click to vote
RTSS
2003
IEEE
15 years 11 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...