Krawczyk, H. personal communication. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Complexity of Decision versus Search - Bellare, Goldwasser (1994) (21 citations) (Correct)
....above. Blum and Kannan [BK] introduced the notion of program checkers (see Section 5 for full definitions) Negative results in this domain begin with Yao [Ya] who presented a language in deterministic space 2 log log n that does not have a checker. Beigel and Feigenbaum [BF] and Krawczyk [Kr] improved this to deterministic space n log . The question of whether there are languages of reasonable complexity that are not checkable was answered by [BF] under an assumption: they showed there was one such in NP provided non deterministic triple exponential time is not contained in ....
H. Krawczyk. Personal communication.
On the Security of Two MAC Algorithms - Preneel, van Oorschot (1995) (18 citations) (Correct)
.... working group for authentication of IP datagrams, namely RFC 1828 [16] specifies a variant of this using MD5 and a single key K: MAC(x) h(KkpkxkK) Here p denotes some padding bits chosen such that Kkp fills the first block, and allows for a security proof assuming pseudorandomness of MD5 [11]. RFC 1828 allows a variable length key, and mandates support for bitlengths up to 128 bits. Yet another variant of the envelope method was proposed by Kaliski and Robshaw [10] MAC(x) h(K 1 kh(K 2 kx) An important consideration motivating use of these envelope MACs is that they require ....
H. Krawczyk, personal communication.
The Complexity of Decision versus Search - Bellare, Goldwasser (1994) (21 citations) (Correct)
....above. Blum and Kannan [BK] introduced the notion of program checkers (see Section 5 for full definitions) Negative results in this domain begin with Yao [Ya] who presented a language in deterministic space 2 n log log n that does not have a checker. Beigel and Feigenbaum [BF] and Krawczyk [Kr] improved this to deterministic space n log n . The question of whether there are languages of reasonable complexity that are not checkable was answered by [BF] under an assumption: they showed there was one such in NP provided non deterministic triple exponential time is not contained in ....
H. Krawczyk. Personal communication.
The Secure HyperText Transfer Protocol - Rescorla, Schiffman (1999) (44 citations) (Correct)
No context found.
Krawczyk, H. personal communication.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC