| 2008 |
|---|
| 140 | EE | Goichiro Hanaoka,
Kaoru Kurosawa:
Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption.
ASIACRYPT 2008: 308-325 |
| 139 | EE | Kouichi Itoh,
Noboru Kunihiro,
Kaoru Kurosawa:
Small Secret Key Attack on a Variant of RSA (Due to Takagi).
CT-RSA 2008: 387-406 |
| 138 | EE | Kaoru Kurosawa,
Kazuhiro Suzuki:
Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme.
EUROCRYPT 2008: 324-340 |
| 137 | EE | Kaoru Kurosawa,
Jun Furukawa:
Universally Composable Undeniable Signature.
ICALP (2) 2008: 524-535 |
| 136 | EE | Kaoru Kurosawa,
Takeshi Koshiba:
Simple Direct Reduction of String (1, 2)-OT to Rabin's OT without Privacy Amplification.
ICITS 2008: 199-209 |
| 135 | EE | Jun Furukawa,
Frederik Armknecht,
Kaoru Kurosawa:
A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort.
SCN 2008: 392-408 |
| 134 | EE | Kaoru Kurosawa,
Wataru Kishimoto,
Takeshi Koshiba:
A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions.
IEEE Transactions on Information Theory 54(6): 2566-2571 (2008) |
| 133 | EE | Tetsu Iwata,
Tohru Yagi,
Kaoru Kurosawa:
Security of the Five-Round Kasumi Type Permutation.
IEICE Transactions 91-A(1): 30-38 (2008) |
| 132 | EE | Kazuhiro Suzuki,
Dongvu Tonien,
Kaoru Kurosawa,
Koji Toyota:
Birthday Paradox for Multi-Collisions.
IEICE Transactions 91-A(1): 39-45 (2008) |
| 131 | EE | Noboru Kunihiro,
Kaoru Kurosawa:
Deterministic Polynomial Time Equivalence between Factoring and Key-Recovery Attack on Takagi's RSA.
IEICE Transactions 91-A(9): 2356-2364 (2008) |
| 130 | EE | Kaoru Kurosawa,
Swee-Huay Heng:
The power of identification schemes.
IJACT 1(1): 60-69 (2008) |
| 129 | EE | Masayuki Abe,
Rosario Gennaro,
Kaoru Kurosawa:
Tag-KEM/DEM: A New Framework for Hybrid Encryption.
J. Cryptology 21(1): 97-130 (2008) |
| 2007 |
|---|
| 128 | | Kaoru Kurosawa:
Advances in Cryptology - ASIACRYPT 2007, 13th International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia, December 2-6, 2007, Proceedings
Springer 2007 |
| 127 | EE | Yvo Desmedt,
Kaoru Kurosawa:
A Generalization and a Variant of Two Threshold Cryptosystems Based on Factoring.
ISC 2007: 351-361 |
| 126 | EE | Kazuhiro Suzuki,
Kaoru Kurosawa:
How to Find Many Collisions of 3-Pass HAVAL.
IWSEC 2007: 428-443 |
| 125 | EE | Noboru Kunihiro,
Kaoru Kurosawa:
Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi's RSA.
Public Key Cryptography 2007: 412-425 |
| 124 | EE | Tetsu Iwata,
Kaoru Kurosawa:
How to Construct Super-Pseudorandom Permutations with Short Keys.
IEICE Transactions 90-A(1): 2-13 (2007) |
| 2006 |
|---|
| 123 | | Moti Yung,
Kaoru Kurosawa,
Reihaneh Safavi-Naini:
Proceedings of the Sixth ACM Workshop on Digital Rights Management, Alexandria, VA, USA, October 30, 2006
ACM 2006 |
| 122 | EE | Masayuki Abe,
Yang Cui,
Hideki Imai,
Kaoru Kurosawa:
Tag-KEM from Set Partial Domain One-Way Permutations.
ACISP 2006: 360-370 |
| 121 | EE | Kaoru Kurosawa,
Tsuyoshi Takagi:
New Approach for Selectively Convertible Undeniable Signature Schemes.
ASIACRYPT 2006: 428-443 |
| 120 | EE | Jun Furukawa,
Kaoru Kurosawa,
Hideki Imai:
An Efficient Compiler from Sigma-Protocol to 2-Move Deniable Zero-Knowledge.
ICALP (2) 2006: 46-57 |
| 119 | EE | Kazuhiro Suzuki,
Dongvu Tonien,
Kaoru Kurosawa,
Koji Toyota:
Birthday Paradox for Multi-collisions.
ICISC 2006: 29-40 |
| 118 | EE | Tri Van Le,
Kaoru Kurosawa:
Bandwidth Optimal Steganography Secure Against Adaptive Chosen Stegotext Attacks.
Information Hiding 2006: 297-313 |
| 117 | EE | Kaoru Kurosawa,
Katja Schmidt-Samoa:
New Online/Offline Signature Schemes Without Random Oracles.
Public Key Cryptography 2006: 330-346 |
| 116 | EE | Kaoru Kurosawa,
Swee-Huay Heng:
The Power of Identification Schemes.
Public Key Cryptography 2006: 364-377 |
| 115 | EE | Kaoru Kurosawa,
Swee-Huay Heng:
Relations Among Security Notions for Undeniable Signature Schemes.
SCN 2006: 34-48 |
| 114 | EE | Wakaha Ogata,
Kaoru Kurosawa,
Swee-Huay Heng:
The security of the FDH variant of Chaum's undeniable signature scheme.
IEEE Transactions on Information Theory 52(5): 2006-2017 (2006) |
| 113 | EE | Ryutaroh Matsumoto,
Kaoru Kurosawa,
Toshiya Itoh,
Toshimitsu Konno,
Tomohiko Uyematsu:
Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography.
IEEE Transactions on Information Theory 52(9): 4251-4256 (2006) |
| 112 | EE | Swee-Huay Heng,
Kaoru Kurosawa:
k-Resilient Identity-Based Encryption in the Standard Model.
IEICE Transactions 89-A(1): 39-46 (2006) |
| 111 | EE | Lan Nguyen,
Reihaneh Safavi-Naini,
Kaoru Kurosawa:
Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security.
Int. J. Inf. Sec. 5(4): 241-255 (2006) |
| 110 | EE | Wakaha Ogata,
Kaoru Kurosawa,
Douglas R. Stinson:
Optimum Secret Sharing Scheme Secure against Cheating.
SIAM J. Discrete Math. 20(1): 79-95 (2006) |
| 2005 |
|---|
| 109 | EE | Masayuki Abe,
Rosario Gennaro,
Kaoru Kurosawa,
Victor Shoup:
Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM.
EUROCRYPT 2005: 128-146 |
| 108 | EE | Kaoru Kurosawa,
Swee-Huay Heng:
3-Move Undeniable Signature Scheme.
EUROCRYPT 2005: 181-197 |
| 107 | EE | Tetsu Iwata,
Kaoru Kurosawa:
How to Enhance the Security of the 3GPP Confidentiality and Integrity Algorithms.
FSE 2005: 268-283 |
| 106 | EE | Kaoru Kurosawa,
Swee-Huay Heng:
Identity-Based Identification Without Random Oracles.
ICCSA (2) 2005: 603-613 |
| 105 | EE | Yvo Desmedt,
Kaoru Kurosawa:
Electronic Voting: Starting Over?
ISC 2005: 329-343 |
| 104 | EE | Wakaha Ogata,
Kaoru Kurosawa,
Swee-Huay Heng:
The Security of the FDH Variant of Chaum's Undeniable Signature Scheme.
Public Key Cryptography 2005: 328-345 |
| 103 | EE | Ryutaroh Matsumoto,
Kaoru Kurosawa,
Toshiya Itoh,
Toshimitsu Konno,
Tomohiko Uyematsu:
Primal-dual distance bounds of linear codes with application to cryptography
CoRR abs/cs/0506087: (2005) |
| 102 | EE | Yasuhiro Ohtaki,
Masaru Kamada,
Kaoru Kurosawa:
A Scheme for Partial Disclosure of Transaction Log.
IEICE Transactions 88-A(1): 222-229 (2005) |
| 101 | EE | Tetsu Iwata,
Kaoru Kurosawa:
On the Security of a MAC by Mitchell.
IEICE Transactions 88-A(1): 25-32 (2005) |
| 100 | EE | Kaoru Kurosawa,
Tetsu Iwata,
Quang Viet Duong:
How to Improve Interpolation Attack.
IEICE Transactions 88-A(1): 9-15 (2005) |
| 99 | EE | Masaru Kamada,
Kaoru Kurosawa,
Yasuhiro Ohtaki,
Shusuke Okamoto:
A Network Game Based on Fair Random Numbers.
IEICE Transactions 88-D(5): 859-864 (2005) |
| 98 | EE | Lan Nguyen,
Reihaneh Safavi-Naini,
Kaoru Kurosawa:
A Provably Secure and Efficient Verifiable Shuffle based on a Variant of the Paillier Cryptosystem.
J. UCS 11(6): 986-1010 (2005) |
| 2004 |
|---|
| 97 | EE | Tetsu Iwata,
Kaoru Kurosawa:
How to Re-use Round Function in Super-Pseudorandom Permutation.
ACISP 2004: 224-235 |
| 96 | EE | Kaoru Kurosawa,
Toshihiko Matsuo:
How to Remove MAC from DHIES.
ACISP 2004: 236-247 |
| 95 | EE | Lan Nguyen,
Reihaneh Safavi-Naini,
Kaoru Kurosawa:
Verifiable Shuffles: A Formal Model and a Paillier-Based Efficient Construction with Provable Security.
ACNS 2004: 61-75 |
| 94 | EE | Kaoru Kurosawa,
Yvo Desmedt:
A New Paradigm of Hybrid Encryption Scheme.
CRYPTO 2004: 426-442 |
| 93 | EE | Quang Viet Duong,
Kaoru Kurosawa:
Almost Ideal Contrast Visual Cryptography with Reversing.
CT-RSA 2004: 353-365 |
| 92 | EE | Swee-Huay Heng,
Kaoru Kurosawa:
k-Resilient Identity-Based Encryption in the Standard Model.
CT-RSA 2004: 67-80 |
| 91 | EE | Takeshi Koshiba,
Kaoru Kurosawa:
Short Exponent Diffie-Hellman Problems.
Public Key Cryptography 2004: 173-186 |
| 90 | EE | Kaoru Kurosawa,
Swee-Huay Heng:
From Digital Signature to ID-based Identification/Signature.
Public Key Cryptography 2004: 248-261 |
| 89 | EE | Wakaha Ogata,
Kaoru Kurosawa,
Douglas R. Stinson,
Hajime Saido:
New combinatorial designs and their applications to authentication codes and secret sharing schemes.
Discrete Mathematics 279(1-3): 383-405 (2004) |
| 88 | | Kaoru Kurosawa,
Tetsu Iwata,
Takayuki Yoshiwara:
New covering radius of Reed-Muller codes for t-resilient functions.
IEEE Transactions on Information Theory 20(3): 468-475 (2004) |
| 87 | | Kaoru Kurosawa,
Ryutaroh Matsumoto:
Almost security of cryptographic Boolean functions.
IEEE Transactions on Information Theory 50(11): 2752-2761 (2004) |
| 86 | EE | Kaoru Kurosawa,
Quang Viet Duong:
How to Design Efficient Multiple-Use 1-out-n Oblivious Transfer.
IEICE Transactions 87-A(1): 141-146 (2004) |
| 85 | EE | Kaoru Kurosawa,
Tetsu Iwata:
TMAC: Two-Key CBC MAC.
IEICE Transactions 87-A(1): 46-52 (2004) |
| 84 | EE | Swee-Huay Heng,
Kaoru Kurosawa:
Square Hash with a Small Key Size.
IEICE Transactions 87-A(1): 54-59 (2004) |
| 83 | EE | Tetsu Iwata,
Kaoru Kurosawa:
On the Universal Hash Functions in Luby-Rackoff Cipher.
IEICE Transactions 87-A(1): 60-66 (2004) |
| 82 | EE | Toshihiko Matsuo,
Kaoru Kurosawa:
On Parallel Hash Functions Based on Block-Ciphers.
IEICE Transactions 87-A(1): 67-74 (2004) |
| 81 | EE | Wakaha Ogata,
Kaoru Kurosawa:
Oblivious keyword search.
J. Complexity 20(2-3): 356-371 (2004) |
| 2003 |
|---|
| 80 | EE | Tetsu Iwata,
Tohru Yagi,
Kaoru Kurosawa:
On the Pseudorandomness of KASUMI Type Permutations.
ACISP 2003: 130-141 |
| 79 | EE | Toshihiko Matsuo,
Kaoru Kurosawa:
On Parallel Hash Functions Based on Block-Cipher.
ACISP 2003: 510-521 |
| 78 | EE | Swee-Huay Heng,
Kaoru Kurosawa:
Square Hash with a Small Key Size.
ACISP 2003: 522-531 |
| 77 | EE | Kaoru Kurosawa,
Tsuyoshi Takagi:
Some RSA-Based Encryption Schemes with Tight Security Reduction.
ASIACRYPT 2003: 19-36 |
| 76 | EE | Kaoru Kurosawa,
Katja Schmidt-Samoa,
Tsuyoshi Takagi:
A Complete and Explicit Security Reduction Algorithm for RSA-Based Cryptosystems.
ASIACRYPT 2003: 474-491 |
| 75 | EE | Kaoru Kurosawa,
Tetsu Iwata:
TMAC: Two-Key CBC MAC.
CT-RSA 2003: 33-49 |
| 74 | EE | Tetsu Iwata,
Kaoru Kurosawa:
OMAC: One-Key CBC MAC.
FSE 2003: 129-153 |
| 73 | EE | Tetsu Iwata,
Kaoru Kurosawa:
On the Security of a New Variant of OMAC.
ICISC 2003: 67-78 |
| 72 | EE | Tetsu Iwata,
Kaoru Kurosawa:
On the Correctness of Security Proofs for the 3GPP Confidentiality and Integrity Algorithms.
IMA Int. Conf. 2003: 306-318 |
| 71 | EE | Tetsu Iwata,
Kaoru Kurosawa:
Stronger Security Bounds for OMAC, TMAC, and XCBC.
INDOCRYPT 2003: 402-415 |
| 70 | EE | Yvo Desmedt,
Kaoru Kurosawa,
Tri Van Le:
Error Correcting and Complexity Aspects of Linear Secret Sharing Schemes.
ISC 2003: 396-407 |
| 69 | EE | Tetsu Iwata,
Tomonobu Yoshino,
Kaoru Kurosawa:
Non-cryptographic primitive for pseudorandom permutation.
Theor. Comput. Sci. 306(1-3): 139-154 (2003) |
| 2002 |
|---|
| 68 | EE | Wakaha Ogata,
Kaoru Kurosawa:
Bounds for Robust Metering Schemes and Their Relationship with A-code.
ASIACRYPT 2002: 64-80 |
| 67 | EE | Kaoru Kurosawa,
Wakaha Ogata:
Bit-Slice Auction Circuit.
ESORICS 2002: 24-38 |
| 66 | EE | Tetsu Iwata,
Tomonobu Yoshino,
Kaoru Kurosawa:
Non-cryptographic Primitive for Pseudorandom Permutation.
FSE 2002: 149-163 |
| 65 | EE | Tetsu Iwata,
Kaoru Kurosawa:
On the Universal Hash Functionsin Luby-Rackoff Cipher.
ICISC 2002: 226-236 |
| 64 | EE | Kaoru Kurosawa,
Takuya Yoshida:
Linear Code Implies Public-Key Traitor Tracing.
Public Key Cryptography 2002: 172-187 |
| 63 | EE | Kaoru Kurosawa:
Multi-recipient Public-Key Encryption with Shortened Ciphertext.
Public Key Cryptography 2002: 48-63 |
| 62 | | Wataru Kishimoto,
Koji Okada,
Kaoru Kurosawa,
Wakaha Ogata:
On the bound for anonymous secret sharing schemes.
Discrete Applied Mathematics 121(1-3): 193-202 (2002) |
| 2001 |
|---|
| 61 | EE | Tetsu Iwata,
Tomonobu Yoshino,
Tomohiro Yuasa,
Kaoru Kurosawa:
Round Security and Super-Pseudorandomness of MISTY Type Structure.
FSE 2001: 233-247 |
| 60 | EE | Akihiro Yamamura,
Kaoru Kurosawa:
Generic Algorithms and Key Agreement Protocols Based on Group Actions.
ISAAC 2001: 208-218 |
| 59 | EE | Kaoru Kurosawa,
Wakaha Ogata,
Toshihiki Matsuo,
Shuichi Makishima:
IND-CCA Public Key Schemes Equivalent to Factoring n=pq.
Public Key Cryptography 2001: 36-47 |
| 58 | EE | Tetsu Iwata,
Takayuki Yoshiwara,
Kaoru Kurosawa:
New Covering Radius of Reed-Muller Codes for t-Resilient Functions.
Selected Areas in Cryptography 2001: 75-86 |
| 57 | | Satoshi Obana,
Kaoru Kurosawa:
Bounds and Combinatorial Structure of Multi-Receiver-Codes.
Des. Codes Cryptography 22(1): 47-63 (2001) |
| 56 | | Kaoru Kurosawa,
Satoshi Obana:
Combinatorial Bounds on Authentication Codes with Arbitration.
Des. Codes Cryptography 22(3): 265-281 (2001) |
| 55 | EE | Kaoru Kurosawa,
Thomas Johansson,
Douglas R. Stinson:
Almost k-Wise Independent Sample Spaces and Their Cryptologic Applications.
J. Cryptology 14(4): 231-253 (2001) |
| 2000 |
|---|
| 54 | EE | Masashi Mitomo,
Kaoru Kurosawa:
Attack for Flash MIX.
ASIACRYPT 2000: 192-204 |
| 53 | EE | Wakaha Ogata,
Kaoru Kurosawa:
Provably Secure Metering Scheme.
ASIACRYPT 2000: 388-398 |
| 52 | EE | Yvo Desmedt,
Kaoru Kurosawa:
How to Break a Practical MIX and Design a New One.
EUROCRYPT 2000: 557-572 |
| 51 | EE | Tetsu Iwata,
Kaoru Kurosawa:
On the Pseudorandomness of the AES Finalists - RC6 and Serpent.
FSE 2000: 231-243 |
| 50 | EE | Kaoru Kurosawa,
Tetsu Iwata,
Quang Viet Duong:
Root Finding Interpolation Attack.
Selected Areas in Cryptography 2000: 303-314 |
| 49 | | Satoshi Obana,
Kaoru Kurosawa:
Combinatorial Classification of Optimal Authentication Codes with Arbitration.
Des. Codes Cryptography 20(3): 281-305 (2000) |
| 48 | | Kaoru Kurosawa,
Fumio Sato,
Takahiro Sakata,
Wataru Kishimoto:
A relationship between linear complexity and kapa-error linear complexity.
IEEE Transactions on Information Theory 46(2): 694-698 (2000) |
| 47 | | Koji Okada,
Kaoru Kurosawa:
MDS secret-sharing scheme secure against cheaters.
IEEE Transactions on Information Theory 46(3): 1078-1081 (2000) |
| 1999 |
|---|
| 46 | | Takashi Satoh,
Tetsu Iwata,
Kaoru Kurosawa:
On Cryptographically Secure Vectorial Boolean Functions.
ASIACRYPT 1999: 20-28 |
| 45 | | Tetsu Iwata,
Kaoru Kurosawa:
Probabilistic Higher Order Differential Attack and Higher Order Bent Functions.
ASIACRYPT 1999: 62-74 |
| 44 | | Kaoru Kurosawa,
Wakaha Ogata:
Efficient Rabin-type Digital Signature Scheme.
Des. Codes Cryptography 16(1): 53-64 (1999) |
| 43 | | Kaoru Kurosawa,
Takuya Yoshida:
Strongly universal hashing and identification codes via channels.
IEEE Transactions on Information Theory 45(6): 2091-2095 (1999) |
| 42 | EE | Carlo Blundo,
Alfredo De Santis,
Kaoru Kurosawa,
Wakaha Ogata:
On a Fallacious Bound for Authentication Codes.
J. Cryptology 12(3): 155-159 (1999) |
| 1998 |
|---|
| 41 | EE | Yvo Desmedt,
Brian King,
Wataru Kishimoto,
Kaoru Kurosawa:
A Comment on the Efficiency of Secret Sharing Scheme over Any Finite Abelian Group.
ACISP 1998: 391-402 |
| 40 | EE | Kaoru Kurosawa,
Takuya Yoshida,
Yvo Desmedt,
Mike Burmester:
Some Bounds and a Construction for Secure Broadcast Encryption.
ASIACRYPT 1998: 420-433 |
| 39 | EE | Kaoru Kurosawa,
Yvo Desmedt:
Optimum Traitor Tracing and Asymmetric Schemes.
EUROCRYPT 1998: 145-157 |
| 38 | | Kaoru Kurosawa,
Koji Okada,
Hajime Saido,
Douglas R. Stinson:
New Combinatorial Bounds for Authentication Codes and Key Predistribution Schemes.
Des. Codes Cryptography 15(1): 87-100 (1998) |
| 37 | EE | Wakaha Ogata,
Kaoru Kurosawa:
Some Basic Properties of General Nonperfect Secret Sharing Schemes.
J. UCS 4(8): 690-704 (1998) |
| 1997 |
|---|
| 36 | | Kaoru Kurosawa,
Satoshi Obana:
Characterisation of (k, n) Multi-receiver Authentication.
ACISP 1997: 204-215 |
| 35 | EE | Kaoru Kurosawa,
Thomas Johansson,
Douglas R. Stinson:
Almost k-wise Independent Sample Spaces and Their Cryptologic Applications.
EUROCRYPT 1997: 409-421 |
| 34 | EE | Kaoru Kurosawa,
Takashi Satoh:
Design of SAC/PC(l) of Order k Boolean Functions and Three Other Cryptographic Criteria.
EUROCRYPT 1997: 434-449 |
| 33 | | Satoshi Obana,
Kaoru Kurosawa:
A2-code = Affine resolvable = BIBD.
ICICS 1997: 118-129 |
| 32 | | Wakaha Ogata,
Kaoru Kurosawa,
Kazue Sako,
Kazunori Takatani:
Fault tolerant anonymous channel.
ICICS 1997: 440-444 |
| 31 | EE | Kaoru Kurosawa,
Takashi Satoh,
K. Yamamoto:
Highly Nonlinear t-resilient Functions.
J. UCS 3(6): 721-729 (1997) |
| 1996 |
|---|
| 30 | | Kaoru Kurosawa,
Takashi Satoh:
Generalization of Higher Order SAC to Vector Output Boolean Functions.
ASIACRYPT 1996: 218-231 |
| 29 | EE | Wakaha Ogata,
Kaoru Kurosawa:
Optimum Secret Sharing Scheme Secure against Cheating.
EUROCRYPT 1996: 200-211 |
| 28 | EE | Wakaha Ogata,
Keiichi Sakano,
Kaoru Kurosawa:
Multisymbol Majority Vote and Hard Core.
Inf. Process. Lett. 58(6): 285-292 (1996) |
| 27 | EE | Satoshi Obana,
Kaoru Kurosawa:
Veto is Impossible in Secret Sharing Schemes.
Inf. Process. Lett. 58(6): 293-295 (1996) |
| 26 | EE | Kaoru Kurosawa,
Koji Okada:
Combinatorial Lower Bounds for Secret Sharing Schemes.
Inf. Process. Lett. 60(6): 301-304 (1996) |
| 1995 |
|---|
| 25 | | Kaoru Kurosawa,
Sanpei Kageyama:
New Bound for Afine Resolvable Designs and Its Application to Authentication Codes.
COCOON 1995: 292-302 |
| 24 | EE | Kaoru Kurosawa,
Satoshi Obana,
Wakaha Ogata:
t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes.
CRYPTO 1995: 410-423 |
| 23 | EE | Kaoru Kurosawa,
Satoshi Obana:
Combinatorial Bounds for Authentication Codes with Arbitration.
EUROCRYPT 1995: 289-300 |
| 22 | | Kaoru Kurosawa,
Naonori Yamashita:
Power Complementary and Linear Phase Filter Banks.
ISCAS 1995: 760-763 |
| 21 | EE | Kaoru Kurosawa,
Koji Okada,
Shigeo Tsujii:
Low Exponent Attack Against Elliptic Curve RSA.
Inf. Process. Lett. 53(2): 77-83 (1995) |
| 1994 |
|---|
| 20 | | Koji Okada,
Kaoru Kurosawa:
Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes.
ASIACRYPT 1994: 33-41 |
| 19 | | Kaoru Kurosawa,
Koji Okada,
Keiichi Sakano:
Security of the Center in Key Distribution Schemes.
ASIACRYPT 1994: 333-341 |
| 18 | | Kaoru Kurosawa,
Koji Okada,
Shigeo Tsujii:
Low Exponent Attack against Elliptic Curve RSA.
ASIACRYPT 1994: 376-383 |
| 17 | | Kaoru Kurosawa,
Koji Okada:
Combinatorial Interpretation of Secret Sharing Schemes.
ASIACRYPT 1994: 55-64 |
| 16 | EE | Kaoru Kurosawa:
New Bound on Authentication Code with Arbitration.
CRYPTO 1994: 140-149 |
| 15 | | Kaoru Kurosawa,
Isao Yamada,
Naonori Yamashita,
Toshiriro Komou:
Optimum Highpass Filter in Linear Phase Perfect Reconstruction QMF Bank.
ISCAS 1994: 25-28 |
| 14 | | Kaoru Kurosawa,
Isao Yamada,
Masayuki Ihara:
A Necessary Condition for Linear Phase in Two Dimensional Perfect Reconstruction QMF Banks.
ISCAS 1994: 29-32 |
| 1993 |
|---|
| 13 | EE | Kaoru Kurosawa,
Koji Okada,
Keiichi Sakano,
Wakaha Ogata,
Shigeo Tsujii:
Nonperfect Secret Sharing Schemes and Matroids.
EUROCRYPT 1993: 126-141 |
| 12 | EE | Choonsik Park,
Kazutomo Itoh,
Kaoru Kurosawa:
Efficient Anonymous Channel and All/Nothing Election Scheme.
EUROCRYPT 1993: 248-259 |
| 11 | EE | Choonsik Park,
Kaoru Kurosawa,
Tatsuaki Okamoto,
Shigeo Tsujii:
On Key Distribution and Authentication in Mobile Radio Networks.
EUROCRYPT 1993: 461-465 |
| 10 | | Kaoru Kurosawa,
Kouichi Kawabe,
Shigeo Tsujii:
Stability and zeros of a complex polynomial.
ISCAS 1993: 2279-2282 |
| 9 | | Kaoru Kurosawa,
Isao Yamada,
Tetsunari Yokokawa,
Shigeo Tsujii:
A fast stability test for multidimensional systems.
ISCAS 1993: 579-582 |
| 1992 |
|---|
| 8 | | Takashi Satoh,
Kaoru Kurosawa,
Shigeo Tsujii:
Privacy for Multi-Party Protocols.
AUSCRYPT 1992: 252-260 |
| 7 | | Wakaha Ogata,
Kaoru Kurosawa,
Shigeo Tsujii:
Nonperfect Secret Sharing Schemes.
AUSCRYPT 1992: 56-66 |
| 6 | | Kaoru Kurosawa,
Osamu Watanabe:
Computational and Statistical Indistinguishabilities.
ISAAC 1992: 430-438 |
| 1991 |
|---|
| 5 | | Wakaha Ogata,
Kaoru Kurosawa:
On Claw Free Families.
ASIACRYPT 1991: 111-123 |
| 4 | | Takeshi Saito,
Kaoru Kurosawa,
Kouichi Sakurai:
4 Move Perfect ZKIP of Knowledge with No Assumption.
ASIACRYPT 1991: 321-330 |
| 1990 |
|---|
| 3 | EE | Kaoru Kurosawa,
Shigeo Tsujii:
Multi-Language Zero Knowledge Interactive Proof Systems.
CRYPTO 1990: 339-352 |
| 2 | EE | Kaoru Kurosawa,
Yutaka Katayama,
Wakaha Ogata,
Shigeo Tsujii:
General Public Key Residue Cryptosystems and Mental Poker Protocols.
EUROCRYPT 1990: 374-388 |
| 1986 |
|---|
| 1 | | Kaoru Kurosawa,
Shigeo Tsujii:
An Efficient Method to Find Invalid Loops in a Communication Protocol and Its Application to HDLC.
ICC 1986: 563-567 |
