Kaoru Kurosawa

Kaoru Kurosawa, Goichiro Hanaoka (Eds.): Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26 - March 1, 2013. Proceedings. Lecture Notes in Computer Science 7778, Springer 2013, isbn 978-3-642-36361-0

Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong: UC-Secure Multi-Session OT Using Tamper-Proof Hardware. IACR Cryptology ePrint Archive 2013: 77 (2013)

Kaoru Kurosawa, Takuma Ueda: How to Factor N_1 and N_2 When p_1=p_2 mod 2^t. IACR Cryptology ePrint Archive 2013: 249 (2013)

Kaoru Kurosawa: Round-efficient perfectly secure message transmission scheme against general adversary. Des. Codes Cryptography 63(2): 199-207 (2012)

Le Trieu Phong, Kaoru Kurosawa, Wakaha Ogata: Undeniable and Unpretendable Signatures. IEICE Transactions 95-A(1): 138-150 (2012)

Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong: Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions. ACISP 2012: 235-246

Kaoru Kurosawa, Yasuhiro Ohtaki: UC-Secure Searchable Symmetric Encryption. Financial Cryptography 2012: 285-298

Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong: Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions. IACR Cryptology ePrint Archive 2012: 213 (2012)

Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong: New Leakage Resilient CCA-Secure Public Key Encryption. IACR Cryptology ePrint Archive 2012: 453 (2012)

Yusuke Sakai, Goichiro Hanaoka, Kaoru Kurosawa, Kazuo Ohta: How to Shorten a Ciphertext of Reproducible Key Encapsulation Mechanisms in the Random Oracle Model. IEICE Transactions 94-A(6): 1293-1305 (2011)

Kaoru Kurosawa: General Error Decodable Secret Sharing Scheme and Its Application. IEEE Transactions on Information Theory 57(9): 6304-6309 (2011)

Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong: Generic Fully Simulatable Adaptive Oblivious Transfer. ACNS 2011: 274-291

Ashish Choudhury, Kaoru Kurosawa, Arpita Patra: Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary. ACNS 2011: 292-308

Ashish Choudhury, Kaoru Kurosawa, Arpita Patra: The Round Complexity of Perfectly Secure General VSS. ICITS 2011: 143-162

Kaoru Kurosawa: Hybrid Encryption. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 570-572

Ashish Choudhury, Kaoru Kurosawa, Arpita Patra: Simple and Efficient Single Round Almost Perfectly Secure Message Transmission Tolerating Generalized Adversary. IACR Cryptology ePrint Archive 2011: 27 (2011)

Ashish Choudhury, Kaoru Kurosawa, Arpita Patra: Non-Applicability of Pseudobasis for Designing Perfectly Secure Message Transmission Protocols Against Non-Threshold Adversary. IACR Cryptology ePrint Archive 2011: 54 (2011)

Ashish Choudhury, Kaoru Kurosawa, Arpita Patra: Does Pseudo-basis Extend to General Adversary? IACR Cryptology ePrint Archive 2011: 82 (2011)

Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong: Generic Fully Simulatable Adaptive Oblivious Transfer. IACR Cryptology ePrint Archive 2011: 382 (2011)

Kaoru Kurosawa, Le Trieu Phong: Maximum Leakage Resilient IBE and IPE. IACR Cryptology ePrint Archive 2011: 628 (2011)

Le Trieu Phong, Kaoru Kurosawa, Wakaha Ogata: New RSA-Based (Selectively) Convertible Undeniable Signature Schemes. IEICE Transactions 93-A(1): 63-75 (2010)

Goichiro Hanaoka, Kaoru Kurosawa: Between Hashed DH and Computational DH: Compact Encryption from Weaker Assumption. IEICE Transactions 93-A(11): 1994-2006 (2010)

Yvo Desmedt, Rosario Gennaro, Kaoru Kurosawa, Victor Shoup: A New and Improved Paradigm for Hybrid Encryption Secure Against Chosen-Ciphertext Attack. J. Cryptology 23(1): 91-120 (2010)

Kaoru Kurosawa: Power of a public random permutation and its application to authenticated encryption. IEEE Transactions on Information Theory 56(10): 5366-5374 (2010)

Kaoru Kurosawa: Cryptography for Unconditionally Secure Message Transmission in Networks (Invited Talk). CANS 2010: 43

Yusuke Sakai, Goichiro Hanaoka, Kaoru Kurosawa, Kazuo Ohta: A Generic Method for Reducing Ciphertext Length of Reproducible KEMs in the RO Model. IWSEC 2010: 55-69

Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong: Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption. SCN 2010: 172-181

Le Trieu Phong, Kaoru Kurosawa, Wakaha Ogata: Provably Secure Convertible Undeniable Signatures with Unambiguity. SCN 2010: 291-308

Kaoru Kurosawa (Ed.): Information Theoretic Security, 4th International Conference, ICITS 2009, Shizuoka, Japan, December 3-6, 2009. Revised Selected Papers. Lecture Notes in Computer Science 5973, Springer 2010, isbn 978-3-642-14495-0

Swee-Huay Heng, Kaoru Kurosawa (Eds.): Provable Security - 4th International Conference, ProvSec 2010, Malacca, Malaysia, October 13-15, 2010. Proceedings. Lecture Notes in Computer Science 6402, Springer 2010, isbn 978-3-642-16279-4

Goichiro Hanaoka, Kaoru Kurosawa: Between Hashed DH and Computational DH: Compact Encryption from Weaker Assumption. IACR Cryptology ePrint Archive 2010: 35 (2010)

Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong: Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption. IACR Cryptology ePrint Archive 2010: 327 (2010)

Kaoru Kurosawa: Round-Efficient Perfectly Secure Message Transmission Scheme Against General Adversary. IACR Cryptology ePrint Archive 2010: 450 (2010)

Ashish Choudhury, Kaoru Kurosawa, Arpita Patra: The Round Complexity of General VSS. IACR Cryptology ePrint Archive 2010: 609 (2010)

Kouichi Itoh, Noboru Kunihiro, Kaoru Kurosawa: Small Secret Key Attack on a Takagi's Variant of RSA. IEICE Transactions 92-A(1): 33-41 (2009)

Masayuki Abe, Yang Cui, Hideki Imai, Kaoru Kurosawa: Tag-KEM from Set Partial Domain One-Way Permutations. IEICE Transactions 92-A(1): 42-52 (2009)

Kaoru Kurosawa, Kazuhiro Suzuki: Almost Secure (1-Round, n-Channel) Message Transmission Scheme. IEICE Transactions 92-A(1): 105-112 (2009)

Kaoru Kurosawa, Tsuyoshi Takagi: One-wayness equivalent to general factoring. IEEE Transactions on Information Theory 55(9): 4249-4262 (2009)

Kaoru Kurosawa, Kazuhiro Suzuki: Truly efficient 2-round perfectly secure message transmission scheme. IEEE Transactions on Information Theory 55(11): 5223-5232 (2009)

Le Trieu Phong, Kaoru Kurosawa, Wakaha Ogata: New RSA-Based (Selectively) Convertible Undeniable Signature Schemes. AFRICACRYPT 2009: 116-134

Kaoru Kurosawa, Ryo Nojima: Simple Adaptive Oblivious Transfer without Random Oracle. ASIACRYPT 2009: 334-346

Kaoru Kurosawa: General Error Decodable Secret Sharing Scheme and Its Application. IACR Cryptology ePrint Archive 2009: 263 (2009)

Kaoru Kurosawa, Ryo Nojima: Simple Adaptive Oblivious Transfer Without Random Oracle. IACR Cryptology ePrint Archive 2009: 327 (2009)

Le Trieu Phong, Kaoru Kurosawa, Wakaha Ogata: Provably Secure Convertible Undeniable Signatures with Unambiguity. IACR Cryptology ePrint Archive 2009: 394 (2009)

Tetsu Iwata, Tohru Yagi, Kaoru Kurosawa: Security of the Five-Round Kasumi Type Permutation. IEICE Transactions 91-A(1): 30-38 (2008)

Kazuhiro Suzuki, Dongvu Tonien, Kaoru Kurosawa, Koji Toyota: Birthday Paradox for Multi-Collisions. IEICE Transactions 91-A(1): 39-45 (2008)

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)

Kaoru Kurosawa, Swee-Huay Heng: The power of identification schemes. IJACT 1(1): 60-69 (2008)

Masayuki Abe, Rosario Gennaro, Kaoru Kurosawa: Tag-KEM/DEM: A New Framework for Hybrid Encryption. J. Cryptology 21(1): 97-130 (2008)

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)

Goichiro Hanaoka, Kaoru Kurosawa: Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption. ASIACRYPT 2008: 308-325

Kouichi Itoh, Noboru Kunihiro, Kaoru Kurosawa: Small Secret Key Attack on a Variant of RSA (Due to Takagi). CT-RSA 2008: 387-406

Kaoru Kurosawa, Kazuhiro Suzuki: Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme. EUROCRYPT 2008: 324-340

Kaoru Kurosawa, Jun Furukawa: Universally Composable Undeniable Signature. ICALP (2) 2008: 524-535

Kaoru Kurosawa, Takeshi Koshiba: Simple Direct Reduction of String (1, 2)-OT to Rabin's OT without Privacy Amplification. ICITS 2008: 199-209

Jun Furukawa, Frederik Armknecht, Kaoru Kurosawa: A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort. SCN 2008: 392-408

Kaoru Kurosawa, Jun Furukawa: Universally Composable Undeniable Signature. IACR Cryptology ePrint Archive 2008: 94 (2008)

Goichiro Hanaoka, Kaoru Kurosawa: Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption. IACR Cryptology ePrint Archive 2008: 211 (2008)

Kaoru Kurosawa, Kazuhiro Suzuki: Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme. IACR Cryptology ePrint Archive 2008: 421 (2008)

Tetsu Iwata, Kaoru Kurosawa: How to Construct Super-Pseudorandom Permutations with Short Keys. IEICE Transactions 90-A(1): 2-13 (2007)

Yvo Desmedt, Kaoru Kurosawa: A Generalization and a Variant of Two Threshold Cryptosystems Based on Factoring. ISC 2007: 351-361

Kazuhiro Suzuki, Kaoru Kurosawa: How to Find Many Collisions of 3-Pass HAVAL. IWSEC 2007: 428-443

Noboru Kunihiro, Kaoru Kurosawa: Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi's RSA. Public Key Cryptography 2007: 412-425

Kaoru Kurosawa (Ed.): 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. Lecture Notes in Computer Science 4833, Springer 2007, isbn 978-3-540-76899-9

Kaoru Kurosawa, Takeshi Koshiba: Direct Reduction of String (1, 2)-OT to Rabin's OT. IACR Cryptology ePrint Archive 2007: 46 (2007)

Kaoru Kurosawa, Wataru Kishimoto, Takeshi Koshiba: How to Derive Lower Bound on Oblivious Transfer Reduction. IACR Cryptology ePrint Archive 2007: 65 (2007)

Kaoru Kurosawa, Kazuhiro Suzuki: Almost Secure (1-Round, n-Channel) Message Transmission Scheme. IACR Cryptology ePrint Archive 2007: 76 (2007)

Kazuhiro Suzuki, Kaoru Kurosawa: How To Find Many Collisions of 3-Pass HAVAL. IACR Cryptology ePrint Archive 2007: 79 (2007)

Swee-Huay Heng, Kaoru Kurosawa: k-Resilient Identity-Based Encryption in the Standard Model. IEICE Transactions 89-A(1): 39-46 (2006)

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)

Wakaha Ogata, Kaoru Kurosawa, Douglas R. Stinson: Optimum Secret Sharing Scheme Secure against Cheating. SIAM J. Discrete Math. 20(1): 79-95 (2006)

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)

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)

Masayuki Abe, Yang Cui, Hideki Imai, Kaoru Kurosawa: Tag-KEM from Set Partial Domain One-Way Permutations. ACISP 2006: 360-370

Kaoru Kurosawa, Tsuyoshi Takagi: New Approach for Selectively Convertible Undeniable Signature Schemes. ASIACRYPT 2006: 428-443

Jun Furukawa, Kaoru Kurosawa, Hideki Imai: An Efficient Compiler from Sigma-Protocol to 2-Move Deniable Zero-Knowledge. ICALP (2) 2006: 46-57

Kazuhiro Suzuki, Dongvu Tonien, Kaoru Kurosawa, Koji Toyota: Birthday Paradox for Multi-collisions. ICISC 2006: 29-40

Tri Van Le, Kaoru Kurosawa: Bandwidth Optimal Steganography Secure Against Adaptive Chosen Stegotext Attacks. Information Hiding 2006: 297-313

Kaoru Kurosawa, Katja Schmidt-Samoa: New Online/Offline Signature Schemes Without Random Oracles. Public Key Cryptography 2006: 330-346

Kaoru Kurosawa, Swee-Huay Heng: The Power of Identification Schemes. Public Key Cryptography 2006: 364-377

Kaoru Kurosawa, Swee-Huay Heng: Relations Among Security Notions for Undeniable Signature Schemes. SCN 2006: 34-48

Moti Yung, Kaoru Kurosawa, Reihaneh Safavi-Naini (Eds.): Proceedings of the Sixth ACM Workshop on Digital Rights Management, Alexandria, VA, USA, October 30, 2006. ACM 2006, isbn 1-59593-555-X

Kaoru Kurosawa, Tetsu Iwata, Quang Viet Duong: How to Improve Interpolation Attack. IEICE Transactions 88-A(1): 9-15 (2005)

Tetsu Iwata, Kaoru Kurosawa: On the Security of a MAC by Mitchell. IEICE Transactions 88-A(1): 25-32 (2005)

Yasuhiro Ohtaki, Masaru Kamada, Kaoru Kurosawa: A Scheme for Partial Disclosure of Transaction Log. IEICE Transactions 88-A(1): 222-229 (2005)

Masaru Kamada, Kaoru Kurosawa, Yasuhiro Ohtaki, Shusuke Okamoto: A Network Game Based on Fair Random Numbers. IEICE Transactions 88-D(5): 859-864 (2005)

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)

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

Kaoru Kurosawa, Swee-Huay Heng: 3-Move Undeniable Signature Scheme. EUROCRYPT 2005: 181-197

Tetsu Iwata, Kaoru Kurosawa: How to Enhance the Security of the 3GPP Confidentiality and Integrity Algorithms. FSE 2005: 268-283

Kaoru Kurosawa, Swee-Huay Heng: Identity-Based Identification Without Random Oracles. ICCSA (2) 2005: 603-613

Yvo Desmedt, Kaoru Kurosawa: Electronic Voting: Starting Over? ISC 2005: 329-343

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

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)

Masayuki Abe, Rosario Gennaro, Kaoru Kurosawa: Tag-KEM/DEM: A New Framework for Hybrid Encryption. IACR Cryptology ePrint Archive 2005: 27 (2005)

Lan Nguyen, Reihaneh Safavi-Naini, Kaoru Kurosawa: A Provably Secure and Efficient Verifiable Shuffle based on a Variant of the Paillier Cryptosystem. IACR Cryptology ePrint Archive 2005: 162 (2005)

Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu: Primal-Dual Distance Bounds of Linear Codes with Application to Cryptography. IACR Cryptology ePrint Archive 2005: 194 (2005)

Lan Nguyen, Reihaneh Safavi-Naini, Kaoru Kurosawa: Verifiable Shuffles: A Formal Model and a Paillier-based 3-Round Construction with Provable Security. IACR Cryptology ePrint Archive 2005: 199 (2005)

Kaoru Kurosawa, Tsuyoshi Takagi: One-Wayness Equivalent to General Factoring. IACR Cryptology ePrint Archive 2005: 382 (2005)

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)

Kaoru Kurosawa, Tetsu Iwata: TMAC: Two-Key CBC MAC. IEICE Transactions 87-A(1): 46-52 (2004)

Swee-Huay Heng, Kaoru Kurosawa: Square Hash with a Small Key Size. IEICE Transactions 87-A(1): 54-59 (2004)

Tetsu Iwata, Kaoru Kurosawa: On the Universal Hash Functions in Luby-Rackoff Cipher. IEICE Transactions 87-A(1): 60-66 (2004)

Toshihiko Matsuo, Kaoru Kurosawa: On Parallel Hash Functions Based on Block-Ciphers. IEICE Transactions 87-A(1): 67-74 (2004)

Kaoru Kurosawa, Quang Viet Duong: How to Design Efficient Multiple-Use 1-out-n Oblivious Transfer. IEICE Transactions 87-A(1): 141-146 (2004)

Wakaha Ogata, Kaoru Kurosawa: Oblivious keyword search. J. Complexity 20(2-3): 356-371 (2004)

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)

Kaoru Kurosawa, Ryutaroh Matsumoto: Almost security of cryptographic Boolean functions. IEEE Transactions on Information Theory 50(11): 2752-2761 (2004)

Tetsu Iwata, Kaoru Kurosawa: How to Re-use Round Function in Super-Pseudorandom Permutation. ACISP 2004: 224-235

Kaoru Kurosawa, Toshihiko Matsuo: How to Remove MAC from DHIES. ACISP 2004: 236-247

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

Kaoru Kurosawa, Yvo Desmedt: A New Paradigm of Hybrid Encryption Scheme. CRYPTO 2004: 426-442

Swee-Huay Heng, Kaoru Kurosawa: k-Resilient Identity-Based Encryption in the Standard Model. CT-RSA 2004: 67-80

Quang Viet Duong, Kaoru Kurosawa: Almost Ideal Contrast Visual Cryptography with Reversing. CT-RSA 2004: 353-365

Takeshi Koshiba, Kaoru Kurosawa: Short Exponent Diffie-Hellman Problems. Public Key Cryptography 2004: 173-186

Kaoru Kurosawa, Swee-Huay Heng: From Digital Signature to ID-based Identification/Signature. Public Key Cryptography 2004: 248-261

Quang Viet Duong, Kaoru Kurosawa: Almost Ideal Contrast Visual Cryptography with Reversing. IACR Cryptology ePrint Archive 2004: 287 (2004)

Wakaha Ogata, Kaoru Kurosawa, Swee-Huay Heng: The Security of the FDH Variant of Chaum's Undeniable Signature Scheme. IACR Cryptology ePrint Archive 2004: 290 (2004)

Tetsu Iwata, Tomonobu Yoshino, Kaoru Kurosawa: Non-cryptographic primitive for pseudorandom permutation. Theor. Comput. Sci. 306(1-3): 139-154 (2003)

Tetsu Iwata, Tohru Yagi, Kaoru Kurosawa: On the Pseudorandomness of KASUMI Type Permutations. ACISP 2003: 130-141

Toshihiko Matsuo, Kaoru Kurosawa: On Parallel Hash Functions Based on Block-Cipher. ACISP 2003: 510-521

Swee-Huay Heng, Kaoru Kurosawa: Square Hash with a Small Key Size. ACISP 2003: 522-531

Kaoru Kurosawa, Tsuyoshi Takagi: Some RSA-Based Encryption Schemes with Tight Security Reduction. ASIACRYPT 2003: 19-36

Kaoru Kurosawa, Katja Schmidt-Samoa, Tsuyoshi Takagi: A Complete and Explicit Security Reduction Algorithm for RSA-Based Cryptosystems. ASIACRYPT 2003: 474-491

Kaoru Kurosawa, Tetsu Iwata: TMAC: Two-Key CBC MAC. CT-RSA 2003: 33-49

Tetsu Iwata, Kaoru Kurosawa: OMAC: One-Key CBC MAC. FSE 2003: 129-153

Tetsu Iwata, Kaoru Kurosawa: On the Security of a New Variant of OMAC. ICISC 2003: 67-78

Tetsu Iwata, Kaoru Kurosawa: On the Correctness of Security Proofs for the 3GPP Confidentiality and Integrity Algorithms. IMA Int. Conf. 2003: 306-318

Tetsu Iwata, Kaoru Kurosawa: Stronger Security Bounds for OMAC, TMAC, and XCBC. INDOCRYPT 2003: 402-415

Yvo Desmedt, Kaoru Kurosawa, Tri Van Le: Error Correcting and Complexity Aspects of Linear Secret Sharing Schemes. ISC 2003: 396-407

Kaoru Kurosawa: Almost Security of Cryptographic Boolean Functions. IACR Cryptology ePrint Archive 2003: 75 (2003)

Tetsu Iwata, Kaoru Kurosawa: Stronger Security Bounds for OMAC, TMAC and XCBC. IACR Cryptology ePrint Archive 2003: 82 (2003)

Tetsu Iwata, Tohru Yagi, Kaoru Kurosawa: On the Pseudorandomness of KASUMI Type Permutations. IACR Cryptology ePrint Archive 2003: 130 (2003)

Kaoru Kurosawa, Tsuyoshi Takagi: Some RSA-based Encryption Schemes with Tight Security Reduction. IACR Cryptology ePrint Archive 2003: 157 (2003)

Tri Van Le, Kaoru Kurosawa: Efficient Public Key Steganography Secure Against Adaptively Chosen Stegotext Attacks. IACR Cryptology ePrint Archive 2003: 244 (2003)

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)

Wakaha Ogata, Kaoru Kurosawa: Bounds for Robust Metering Schemes and Their Relationship with A-code. ASIACRYPT 2002: 64-80

Kaoru Kurosawa, Wakaha Ogata: Bit-Slice Auction Circuit. ESORICS 2002: 24-38

Tetsu Iwata, Tomonobu Yoshino, Kaoru Kurosawa: Non-cryptographic Primitive for Pseudorandom Permutation. FSE 2002: 149-163

Tetsu Iwata, Kaoru Kurosawa: On the Universal Hash Functionsin Luby-Rackoff Cipher. ICISC 2002: 226-236

Kaoru Kurosawa: Multi-recipient Public-Key Encryption with Shortened Ciphertext. Public Key Cryptography 2002: 48-63

Kaoru Kurosawa, Takuya Yoshida: Linear Code Implies Public-Key Traitor Tracing. Public Key Cryptography 2002: 172-187

Kaoru Kurosawa, Tetsu Iwata: TMAC: Two-Key CBC MAC. IACR Cryptology ePrint Archive 2002: 92 (2002)

Kaoru Kurosawa, Tetsu Iwata, Takayuki Yoshiwara: New covering radius of Reed-Muller codes for t-resilient functions. IACR Cryptology ePrint Archive 2002: 123 (2002)

Kaoru Kurosawa: Power of a Public Random Permutation and its Application to Authenticated-Encryption. IACR Cryptology ePrint Archive 2002: 127 (2002)

Tetsu Iwata, Kaoru Kurosawa: OMAC: One-Key CBC MAC. IACR Cryptology ePrint Archive 2002: 180 (2002)

Wakaha Ogata, Kaoru Kurosawa: Oblivious Keyword Search. IACR Cryptology ePrint Archive 2002: 182 (2002)

Kaoru Kurosawa, Wakaha Ogata: Bit-Slice Auction Circuit. IACR Cryptology ePrint Archive 2002: 189 (2002)

Satoshi Obana, Kaoru Kurosawa: Bounds and Combinatorial Structure of Multi-Receiver-Codes. Des. Codes Cryptography 22(1): 47-63 (2001)

Kaoru Kurosawa, Satoshi Obana: Combinatorial Bounds on Authentication Codes with Arbitration. Des. Codes Cryptography 22(3): 265-281 (2001)

Kaoru Kurosawa, Thomas Johansson, Douglas R. Stinson: Almost k-Wise Independent Sample Spaces and Their Cryptologic Applications. J. Cryptology 14(4): 231-253 (2001)

Tetsu Iwata, Tomonobu Yoshino, Tomohiro Yuasa, Kaoru Kurosawa: Round Security and Super-Pseudorandomness of MISTY Type Structure. FSE 2001: 233-247

Akihiro Yamamura, Kaoru Kurosawa: Generic Algorithms and Key Agreement Protocols Based on Group Actions. ISAAC 2001: 208-218

Kaoru Kurosawa, Wakaha Ogata, Toshihiko Matsuo, Shuichi Makishima: IND-CCA Public Key Schemes Equivalent to Factoring n=pq. Public Key Cryptography 2001: 36-47

Tetsu Iwata, Takayuki Yoshiwara, Kaoru Kurosawa: New Covering Radius of Reed-Muller Codes for t-Resilient Functions. Selected Areas in Cryptography 2001: 75-86

Kaoru Kurosawa: Multi-Recipient Public-Key Encryption with Shortened Ciphertext. IACR Cryptology ePrint Archive 2001: 71 (2001)

Kaoru Kurosawa, Takuya Yoshida: Linear Code Implies Public-Key Traitor Tracing. IACR Cryptology ePrint Archive 2001: 99 (2001)

Satoshi Obana, Kaoru Kurosawa: Combinatorial Classification of Optimal Authentication Codes with Arbitration. Des. Codes Cryptography 20(3): 281-305 (2000)

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)

Koji Okada, Kaoru Kurosawa: MDS secret-sharing scheme secure against cheaters. IEEE Transactions on Information Theory 46(3): 1078-1081 (2000)

Masashi Mitomo, Kaoru Kurosawa: Attack for Flash MIX. ASIACRYPT 2000: 192-204

Wakaha Ogata, Kaoru Kurosawa: Provably Secure Metering Scheme. ASIACRYPT 2000: 388-398

Akihiro Yamamura, Kaoru Kurosawa: Key Agreement Protocol Securer than DLOG. Words, Languages & Combinatorics 2000: 450-465

Yvo Desmedt, Kaoru Kurosawa: How to Break a Practical MIX and Design a New One. EUROCRYPT 2000: 557-572

Tetsu Iwata, Kaoru Kurosawa: On the Pseudorandomness of the AES Finalists - RC6 and Serpent. FSE 2000: 231-243

Kaoru Kurosawa, Tetsu Iwata, Quang Viet Duong: Root Finding Interpolation Attack. Selected Areas in Cryptography 2000: 303-314

Masashi Mitomo, Kaoru Kurosawa: How to Encrypt Long Messages without Large Size Symmetric/Asymmetric Encryption Schemes. IACR Cryptology ePrint Archive 2000: 65 (2000)

Kaoru Kurosawa, Wakaha Ogata: Efficient Rabin-type Digital Signature Scheme. Des. Codes Cryptography 16(1): 53-64 (1999)

Carlo Blundo, Alfredo De Santis, Kaoru Kurosawa, Wakaha Ogata: On a Fallacious Bound for Authentication Codes. J. Cryptology 12(3): 155-159 (1999)

Kaoru Kurosawa, Takuya Yoshida: Strongly universal hashing and identification codes via channels. IEEE Transactions on Information Theory 45(6): 2091-2095 (1999)

Takashi Satoh, Tetsu Iwata, Kaoru Kurosawa: On Cryptographically Secure Vectorial Boolean Functions. ASIACRYPT 1999: 20-28

Tetsu Iwata, Kaoru Kurosawa: Probabilistic Higher Order Differential Attack and Higher Order Bent Functions. ASIACRYPT 1999: 62-74

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)

Wakaha Ogata, Kaoru Kurosawa: Some Basic Properties of General Nonperfect Secret Sharing Schemes. J. UCS 4(8): 690-704 (1998)

Isao Yamada, Kaoru Kurosawa, Hiroshi Hasegawa, Kohichi Sakaniwa: Algebraic multidimensional phase unwrapping and zero distribution of complex polynomials-characterization of multivariate stable polynomials. IEEE Transactions on Signal Processing 46(6): 1639-1664 (1998)

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

Kaoru Kurosawa, Takuya Yoshida, Yvo Desmedt, Mike Burmester: Some Bounds and a Construction for Secure Broadcast Encryption. ASIACRYPT 1998: 420-433

Kaoru Kurosawa, Yvo Desmedt: Optimum Traitor Tracing and Asymmetric Schemes. EUROCRYPT 1998: 145-157

Kaoru Kurosawa, Takashi Satoh, K. Yamamoto: Highly Nonlinear t-resilient Functions. J. UCS 3(6): 721-729 (1997)

Kaoru Kurosawa, Satoshi Obana: Characterisation of (k, n) Multi-receiver Authentication. ACISP 1997: 204-215

Kaoru Kurosawa, Thomas Johansson, Douglas R. Stinson: Almost k-wise Independent Sample Spaces and Their Cryptologic Applications. EUROCRYPT 1997: 409-421

Kaoru Kurosawa, Takashi Satoh: Design of SAC/PC(l) of Order k Boolean Functions and Three Other Cryptographic Criteria. EUROCRYPT 1997: 434-449

Satoshi Obana, Kaoru Kurosawa: A²-code = Affine resolvable = BIBD. ICICS 1997: 118-129

Wakaha Ogata, Kaoru Kurosawa, Kazue Sako, Kazunori Takatani: Fault tolerant anonymous channel. ICICS 1997: 440-444

Wakaha Ogata, Keiichi Sakano, Kaoru Kurosawa: Multisymbol Majority Vote and Hard Core. Inf. Process. Lett. 58(6): 285-292 (1996)

Satoshi Obana, Kaoru Kurosawa: Veto is Impossible in Secret Sharing Schemes. Inf. Process. Lett. 58(6): 293-295 (1996)

Kaoru Kurosawa, Koji Okada: Combinatorial Lower Bounds for Secret Sharing Schemes. Inf. Process. Lett. 60(6): 301-304 (1996)

Kaoru Kurosawa, Takashi Satoh: Generalization of Higher Order SAC to Vector Output Boolean Functions. ASIACRYPT 1996: 218-231

Wakaha Ogata, Kaoru Kurosawa: Optimum Secret Sharing Scheme Secure against Cheating. EUROCRYPT 1996: 200-211

Kaoru Kurosawa, Koji Okada, Shigeo Tsujii: Low Exponent Attack Against Elliptic Curve RSA. Inf. Process. Lett. 53(2): 77-83 (1995)

Kaoru Kurosawa, Sanpei Kageyama: New Bound for Afine Resolvable Designs and Its Application to Authentication Codes. COCOON 1995: 292-302

Kaoru Kurosawa, Satoshi Obana, Wakaha Ogata: t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes. CRYPTO 1995: 410-423

Kaoru Kurosawa, Satoshi Obana: Combinatorial Bounds for Authentication Codes with Arbitration. EUROCRYPT 1995: 289-300

Kaoru Kurosawa, Naonori Yamashita: Power Complementary and Linear Phase Filter Banks. ISCAS 1995: 760-763

Koji Okada, Kaoru Kurosawa: Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes. ASIACRYPT 1994: 33-41

Kaoru Kurosawa, Koji Okada: Combinatorial Interpretation of Secret Sharing Schemes. ASIACRYPT 1994: 55-64

Kaoru Kurosawa, Koji Okada, Keiichi Sakano: Security of the Center in Key Distribution Schemes. ASIACRYPT 1994: 333-341

Kaoru Kurosawa, Koji Okada, Shigeo Tsujii: Low Exponent Attack against Elliptic Curve RSA. ASIACRYPT 1994: 376-383

Kaoru Kurosawa: New Bound on Authentication Code with Arbitration. CRYPTO 1994: 140-149

Kaoru Kurosawa, Isao Yamada, Naonori Yamashita, Toshiriro Komou: Optimum Highpass Filter in Linear Phase Perfect Reconstruction QMF Bank. ISCAS 1994: 25-28

Kaoru Kurosawa, Isao Yamada, Masayuki Ihara: A Necessary Condition for Linear Phase in Two Dimensional Perfect Reconstruction QMF Banks. ISCAS 1994: 29-32

Kaoru Kurosawa, Koji Okada, Keiichi Sakano, Wakaha Ogata, Shigeo Tsujii: Nonperfect Secret Sharing Schemes and Matroids. EUROCRYPT 1993: 126-141

Choonsik Park, Kazutomo Itoh, Kaoru Kurosawa: Efficient Anonymous Channel and All/Nothing Election Scheme. EUROCRYPT 1993: 248-259

Choonsik Park, Kaoru Kurosawa, Tatsuaki Okamoto, Shigeo Tsujii: On Key Distribution and Authentication in Mobile Radio Networks. EUROCRYPT 1993: 461-465

Kaoru Kurosawa, Isao Yamada, Tetsunari Yokokawa, Shigeo Tsujii: A fast stability test for multidimensional systems. ISCAS 1993: 579-582

Kaoru Kurosawa, Kouichi Kawabe, Shigeo Tsujii: Stability and zeros of a complex polynomial. ISCAS 1993: 2279-2282

Wakaha Ogata, Kaoru Kurosawa, Shigeo Tsujii: Nonperfect Secret Sharing Schemes. AUSCRYPT 1992: 56-66

Takashi Satoh, Kaoru Kurosawa, Shigeo Tsujii: Privacy for Multi-Party Protocols. AUSCRYPT 1992: 252-260

Kaoru Kurosawa, Osamu Watanabe: Computational and Statistical Indistinguishabilities. ISAAC 1992: 430-438

Wakaha Ogata, Kaoru Kurosawa: On Claw Free Families. ASIACRYPT 1991: 111-123

Takeshi Saito, Kaoru Kurosawa, Kouichi Sakurai: 4 Move Perfect ZKIP of Knowledge with No Assumption. ASIACRYPT 1991: 321-330

Kaoru Kurosawa, Shigeo Tsujii: Multi-Language Zero Knowledge Interactive Proof Systems. CRYPTO 1990: 339-352

Kaoru Kurosawa, Yutaka Katayama, Wakaha Ogata, Shigeo Tsujii: General Public Key Residue Cryptosystems and Mental Poker Protocols. EUROCRYPT 1990: 374-388

Kaoru Kurosawa, Shigeo Tsujii: An Efficient Method to Find Invalid Loops in a Communication Protocol and Its Application to HDLC. ICC 1986: 563-567