T. Iwata and K. Kurosawa. Personal communications, January 2002. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Conventional Authenticated-Encryption Mode - Bellare, Rogaway, Wagner (2003) (6 citations) (Correct)
....to the OMAC algorithm as it was originally presented, changing one of its two constants. Speci cally, the constant 4 at line 40 was the constant 1=2 (the multiplicative inverse of 2) in the original de nition of OMAC [9] The OMAC authors indicate that they will promulgate this modi cation [10], which slightly simpli es implementations. 3 EAX Goals We wanted a block cipher based, nonce using AEAD scheme. It should provide both privacy, in the sense of indistinguishability from random bits, and integrity, in the sense of an adversary s inability to produce a new but valid (nonce, ....
T. Iwata and K. Kurosawa. Personal communications, January 2002.
Some Recent Research Aspects of Threshold Cryptography - Desmedt (1997) (18 citations) (Correct)
....been followed: the one is guaranteed to work, while the other one is likely to work. In the last approach it is possible that although a certain set of participants has a cardinality larger or equal to t, they will not be able to perform the threshold computation in (5) We refer the reader to [20, 1, 6, 49]. 4.4 Generalizations g is not homomorphic What if the function g is not homomorphic This problem in its generality corresponds with the mental games problem [43, 4, 13] In its generality no practical solution has been proposed to address this problem. For some algorithms, such as DSS, a ....
....here, but that more randomness is required. A generalization The 2 out of l previous scheme is based on dlog 2 (l)e independent 2 out of 2 sharing schemes. The scheme in [6] satisfies a similar property. This scheme inspired Kurosawa and Stinson and they gave a generalization we now discuss [49]. Let A and A 0 be finite sets, B a subset of A, l = jAj and l 0 = jA 0 j and F be a set of functions from A to A 0 . We assume that l 0 l. A function f from A to A 0 is a perfect hash for B if f restricted to B is one to one. F is a Perfect Hash Family (l; l 0 ; t) if for all ....
K. Kurosawa and D. Stinson, June 1996. Personal communication.
Equitable Key Escrow with Limited Time-Span (or, How to .. - Burmester, Desmedt.. (1998) (3 citations) (Correct)
....[28] 29] 30] Here we present a k out of l (k l) scheme which is based on perfect hash families. To illustrate our technique we first describe a simple 2out of l secret sharing scheme [26] Then we show how to get a k out of l scheme with k 2, using the KurosawaStinson interpretation [27], 30] of the scheme in [29] Let K( Delta) be an Abelian group and a 2 K the secret. We number the participants i from 0 to l Gamma 1 and represent i in binary, i.e. i corresponds to the bits (i 1 ; i dlog 2 (l)e ) For the shares, we choose dlog 2 (l)e independent uniformly random ....
K. Kurosawa, D. Stinson, Personal communication, June 1996.
The EAX Mode of Operation - Bellare, Rogaway, Wagner. (2004) (1 citation) (Correct)
No context found.
T. Iwata and K. Kurosawa. Personal communications, January 2002.
The EAX Mode of Operation (A Two-Pass.. - Bellare, Rogaway, Wagner (2004) (1 citation) (Correct)
No context found.
T. Iwata and K. Kurosawa. Personal communications, January 2002.
A Conventional Authenticated-Encryption Mode - Bellare, Rogaway, Wagner (2003) (6 citations) (Correct)
No context found.
T. Iwata and K. Kurosawa. Personal communications, January 2002.
The EAX Mode of Operation (A Two-Pass.. - Bellare, Rogaway, Wagner (2004) (1 citation) (Correct)
No context found.
T. Iwata and K. Kurosawa. Personal communications, January 2002.
Quantum Secret Sharing for General Access Structures - Smith (2000) (Correct)
No context found.
D. Stinson. Personal communication. May 1999. 6
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