- OMAC (Short slides) January 16, 2004
- Almost k-wise Independent Sample Spaces and Their Cryptologic Applications
- Computational and Statistical Indistinguishabilities \Lambda Kaoru KUROSAWA
- DESIGN CODES AND CRYPTOGRAPHY, , 1--25 () fl Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- Combinatorial lower bounds for Secret Sharing Schemes
- IEICE TRANS. FUNDAMENTALS, VOL.E82--??, NO.1 JANUARY 1999 On the Randomness of Chambers and Gollmann
- IEICE TRANS. , VOL. E90, NO. 1 JANUARY 1998 PAPER Special Section on Cryptography and Information Security
- A 2 code = Affine Resolvable + BIBD Satoshi OBANA and Kaoru KUROSAWA
- OMAC (Long slides) January 16, 2004
- A New Paradigm of Hybrid Encryption Scheme Kaoru Kurosawa1
- New Covering Radius of Reed-Muller Codes for -Resilient Functions
- Nonperfect Secret Sharing Schemes and Matroids
- Fault Tolerant Anonymous Channel Wakaha OGATA 1 , Kaoru KUROSAWA 2 ,
- Low exponent attack against elliptic curve RSA Kaoru KUROSAWA y Koji OKADA y Shigeo TSUJII z
- Probabilistic Higher Order Differential Attack Higher Order Bent Functions
- Veto is Impossible in Secret Sharing Satoshi OBANA and Kaoru KUROSAWA
- On the Pseudorandomness of the AES Finalists ---RC6 and Serpent
- k-Resilient Identity-Based Encryption in the Standard Model
- Provably Secure Metering Scheme Wakaha Ogata and Kaoru Kurosawa
- IEICE TRANS. FUNDAMENTALS, VOL. , NO. PAPER Special Issue on Cryptography and Information Security
- New Bound on Authentication Code with Arbitration
- A comment on the efficiency of secret sharing scheme over any finite Abelian group ?
- IdentityBased Identification Without Random Kaoru Kurosawa 1 and SweeHuay Heng 2
- IEICE TRANS. , VOL. E82--A, NO. 1 JANUARY 1999 PAPER Special Section on Cryptography and Information Security
- Highly Nonlinear tResilient Functions Kaoru Kurosawa
- Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes
- Multisymbol Majority Vote and Hard Core Wakaha OGATA 1 , Keiichi SAKANO 2 and Kaoru KUROSAWA 3
- Optimum Traitor Tracing and Asymmetric Schemes ?
- A relationship between linear complexity and kerror linear complexity
- IEICE TRANS. FUNDAMENTALS, VOL. , NO. PAPER Special Issue on Cryptography and Information Security
- INDCCA Public Key Schemes Equivalent to
- Characterization of (k; n) MultiReceiver Authentication
- fl Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Efficient Rabintype Digital Signature Scheme
- Attack for Flash MIX Masashi Mitomo ? and Kaoru Kurosawa
- PUBLIC KEY CRYPTOSYSTEM USING A RECIPROCAL NUMBER WITH THE SAME
- How to break a practical MIX and design a new one
- Combinatorial Bounds for Authentication Codes with Arbitration
- ISIT2000, Sorrento, Italy, June 25--30, 2000 Inherently Large Traceability of Broadcast Encryption Scheme
- ISIT 1997, Ulm, Germany, June 29 --July 4 MDS Secret Sharing Schemes Secure against Cheaters
- Designs, Codes and Cryptography, , 1--17 () fl Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- New Combinatorial Designs and their Applications to Authentication Codes
- Combinatorial Bounds and Design of Broadcast Authentication
- Design of SAC/PC(l) of order k Boolean functions and three other cryptographic criteria
- On the randomness of a [d; k] selfdecimation stream key generator
- MDS Secret Sharing Scheme Secure against Koji OKADA Kaoru KUROSAWA
- ISIT 2002, Lausanne, Switzerland, June 30 July 5, 2002 On Perfect Traitor Tracing
- 4move perfect ZKIP for some promise problems Kaoru KUROSAWA Wakaha OGATA Shigeo TSUJII
- On claw free families Wakaha OGATA Kaoru KUROSAWA
- , , 1--14 () fl Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- Balanced Boolean functions satisfying PC(2) and very large degree
- Some Bounds and a Construction for Secure Broadcast Encryption
- Inclusion relations of Boolean functions satisfying PC(l) of order k Tetsu IWATA and Kaoru KUROSAWA
- DESIGN CODES AND CRYPTOGRAPHY, , 1--21 () fl Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- Almost Security of Cryptographic Boolean Kaoru Kurosawa1
- Unconditionally Secure Entity Authentication Kaoru KUROSAWA
- Security of the Center in Key Distribution Kaoru KUROSAWA 1 , Koji OKADA 1 , Keiichi SAKANO 2
- tCheater Identifiable (k; n) Threshold Secret Sharing Schemes
- Strongly universal hashing and Identification codes via channels
- ISIT 1998, Cambridge, MA, USA, August 16 --August 21 Unconditionally Secure Entity Authentication
- Root Finding Interpolation Attack Kaoru Kurosawa, Tetsu Iwata, and Viet Duong Quang
- Some Basic Properties of General Nonperfect Secret Sharing Schemes
- IEICE TRANS. FUNDAMENTALS, VOL. E00--A, NO. 1 JANUARY 1997 PAPER Special Section on Cryptography and Information Security
- On a Fallacious Bound for Authentication Codes Carlo Blundo 1; \Lambda
- Combinatorial Bounds of Authentication Codes with Arbitration
- Almost kwise Independent Sample Spaces and Their Cryptologic Applications
- Some new results on nonperfect secret sharing schemes Wakaha OGATA 1 Kaoru KUROSAWA 2
- New ElGamal Type Threshold Digital Signature Choonsik PARK y and Kaoru KUROSAWA z
- On Cryptographically Secure Vectorial Boolean Functions
- A Note on Authentication Codes Carlo Blundo 1; \Lambda
