Kaoru Kurosawa - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

2010

A New and Improved Paradigm for Hybrid Encryption Secure Against Chosen-Ciphertext AttackYvo Desmedt, Rosario Gennaro, Kaoru Kurosawa, Victor Shoup. joc, 23(1):91-120, 2010. [doi]

Between Hashed DH and Computational DH: Compact Encryption from Weaker AssumptionGoichiro Hanaoka, Kaoru Kurosawa. ieicet, 93-A(11):1994-2006, 2010. [doi]

Provable Security - 4th International Conference, ProvSec 2010, Malacca, Malaysia, October 13-15, 2010. ProceedingsSwee-Huay Heng, Kaoru Kurosawa, editors, Volume 6402 of Lecture Notes in Computer Science, Springer, 2010. [doi]

Cryptography for Unconditionally Secure Message Transmission in Networks (Invited Talk)Kaoru Kurosawa. cans 2010: 43 [doi]

Efficiency-Improved Fully Simulatable Adaptive OT under the DDH AssumptionKaoru Kurosawa, Ryo Nojima, Le Trieu Phong. scn 2010: 172-181 [doi]

Power of a public random permutation and its application to authenticated encryptionKaoru Kurosawa. TIT, 56(10):5366-5374, 2010. [doi]

Information Theoretic Security, 4th International Conference, ICITS 2009, Shizuoka, Japan, December 3-6, 2009. Revised Selected PapersKaoru Kurosawa, editor, Volume 5973 of Lecture Notes in Computer Science, Springer, 2010. [doi]

Provably Secure Convertible Undeniable Signatures with UnambiguityLe Trieu Phong, Kaoru Kurosawa, Wakaha Ogata. scn 2010: 291-308 [doi]

New RSA-Based (Selectively) Convertible Undeniable Signature SchemesLe Trieu Phong, Kaoru Kurosawa, Wakaha Ogata. ieicet, 93-A(1):63-75, 2010. [doi]

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

2009

Tag-KEM from Set Partial Domain One-Way PermutationsMasayuki Abe, Yang Cui, Hideki Imai, Kaoru Kurosawa. ieicet, 92-A(1):42-52, 2009. [doi]

Small Secret Key Attack on a Takagi s Variant of RSAKouichi Itoh, Noboru Kunihiro, Kaoru Kurosawa. ieicet, 92-A(1):33-41, 2009. [doi]

Simple Adaptive Oblivious Transfer without Random OracleKaoru Kurosawa, Ryo Nojima. asiacrypt 2009: 334-346 [doi]

Almost Secure (1-Round, ::::n::::-Channel) Message Transmission SchemeKaoru Kurosawa, Kazuhiro Suzuki. ieicet, 92-A(1):105-112, 2009. [doi]

Truly efficient 2-round perfectly secure message transmission schemeKaoru Kurosawa, Kazuhiro Suzuki. TIT, 55(11):5223-5232, 2009. [doi]

One-wayness equivalent to general factoringKaoru Kurosawa, Tsuyoshi Takagi. TIT, 55(9):4249-4262, 2009. [doi]

New RSA-Based (Selectively) Convertible Undeniable Signature SchemesLe Trieu Phong, Kaoru Kurosawa, Wakaha Ogata. africacrypt 2009: 116-134 [doi]

2008

Tag-KEM/DEM: A New Framework for Hybrid EncryptionMasayuki Abe, Rosario Gennaro, Kaoru Kurosawa. joc, 21(1):97-130, 2008. [doi]

A Universally Composable Group Key Exchange Protocol with Minimum Communication EffortJun Furukawa, Frederik Armknecht, Kaoru Kurosawa. scn 2008: 392-408 [doi]

Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman AssumptionGoichiro Hanaoka, Kaoru Kurosawa. asiacrypt 2008: 308-325 [doi]

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

Security of the Five-Round Kasumi Type PermutationTetsu Iwata, Tohru Yagi, Kaoru Kurosawa. ieicet, 91-A(1):30-38, 2008. [doi]

Deterministic Polynomial Time Equivalence between Factoring and Key-Recovery Attack on Takagi s RSANoboru Kunihiro, Kaoru Kurosawa. ieicet, 91-A(9):2356-2364, 2008. [doi]

Truly Efficient 2-Round Perfectly Secure Message Transmission SchemeKaoru Kurosawa, Kazuhiro Suzuki. eurocrypt 2008: 324-340 [doi]

Simple Direct Reduction of String (1, 2)-OT to Rabin s OT without Privacy AmplificationKaoru Kurosawa, Takeshi Koshiba. icits 2008: 199-209 [doi]

The power of identification schemesKaoru Kurosawa, Swee-Huay Heng. ijact, 1(1):60-69, 2008. [doi]

Universally Composable Undeniable SignatureKaoru Kurosawa, Jun Furukawa. icalp 2008: 524-535 [doi]

A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer ReductionsKaoru Kurosawa, Wataru Kishimoto, Takeshi Koshiba. TIT, 54(6):2566-2571, 2008. [doi]

Birthday Paradox for Multi-CollisionsKazuhiro Suzuki, Dongvu Tonien, Kaoru Kurosawa, Koji Toyota. ieicet, 91-A(1):39-45, 2008. [doi]

2007

2006

Tag-KEM from Set Partial Domain One-Way PermutationsMasayuki Abe, Yang Cui, Hideki Imai, Kaoru Kurosawa. acisp 2006: 360-370 [doi]

An Efficient Compiler from ::::Sigma::::-Protocol to 2-Move Deniable Zero-KnowledgeJun Furukawa, Kaoru Kurosawa, Hideki Imai. icalp 2006: 46-57 [doi]

::::k::::-Resilient Identity-Based Encryption in the Standard ModelSwee-Huay Heng, Kaoru Kurosawa. ieicet, 89-A(1):39-46, 2006. [doi]

The Power of Identification SchemesKaoru Kurosawa, Swee-Huay Heng. pkc 2006: 364-377 [doi]

New Online/Offline Signature Schemes Without Random OraclesKaoru Kurosawa, Katja Schmidt-Samoa. pkc 2006: 330-346 [doi]

Relations Among Security Notions for Undeniable Signature SchemesKaoru Kurosawa, Swee-Huay Heng. scn 2006: 34-48 [doi]

New Approach for Selectively Convertible Undeniable Signature SchemesKaoru Kurosawa, Tsuyoshi Takagi. asiacrypt 2006: 428-443 [doi]

Bandwidth Optimal Steganography Secure Against Adaptive Chosen Stegotext AttacksTri Van Le, Kaoru Kurosawa. ih 2007: 297-313 [doi]

Primal-Dual Distance Bounds of Linear Codes With Application to CryptographyRyutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu. TIT, 52(9):4251-4256, 2006. [doi]

Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable securityLan Nguyen, Reihaneh Safavi-Naini, Kaoru Kurosawa. ijisec, 5(4):241-255, 2006. [doi]

Optimum Secret Sharing Scheme Secure against CheatingWakaha Ogata, Kaoru Kurosawa, Douglas R. Stinson. siamdm, 20(1):79-95, 2006. [doi]

The security of the FDH variant of Chaum s undeniable signature schemeWakaha Ogata, Kaoru Kurosawa, Swee-Huay Heng. TIT, 52(5):2006-2017, 2006. [doi]

Birthday Paradox for Multi-collisionsKazuhiro Suzuki, Dongvu Tonien, Kaoru Kurosawa, Koji Toyota. icisc 2006: 29-40 [doi]

Proceedings of the Sixth ACM Workshop on Digital Rights Management, Alexandria, VA, USA, October 30, 2006Moti Yung, Kaoru Kurosawa, Reihaneh Safavi-Naini, editors, ACM, 2006.

2005

Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEMMasayuki Abe, Rosario Gennaro, Kaoru Kurosawa, Victor Shoup. eurocrypt 2005: 128-146 [doi]

Electronic Voting: Starting Over?Yvo Desmedt, Kaoru Kurosawa. iiswc 2005: 329-343 [doi]

On the Security of a MAC by MitchellTetsu Iwata, Kaoru Kurosawa. ieicet, 88-A(1):25-32, 2005. [doi]

How to Enhance the Security of the 3GPP Confidentiality and Integrity AlgorithmsTetsu Iwata, Kaoru Kurosawa. fse 2005: 268-283 [doi]

A Network Game Based on Fair Random NumbersMasaru Kamada, Kaoru Kurosawa, Yasuhiro Ohtaki, Shusuke Okamoto. ieicet, 88-D(5):859-864, 2005. [doi]

How to Improve Interpolation AttackKaoru Kurosawa, Tetsu Iwata, Quang Viet Duong. ieicet, 88-A(1):9-15, 2005. [doi]

3-Move Undeniable Signature SchemeKaoru Kurosawa, Swee-Huay Heng. eurocrypt 2005: 181-197 [doi]

Identity-Based Identification Without Random OraclesKaoru Kurosawa, Swee-Huay Heng. iccsa 2005: 603-613 [doi]

A Provably Secure and Efficient Verifiable Shuffle based on a Variant of the Paillier CryptosystemLan Nguyen, Reihaneh Safavi-Naini, Kaoru Kurosawa. jucs, 11(6):986-1010, 2005. [doi]

The Security of the FDH Variant of Chaum s Undeniable Signature SchemeWakaha Ogata, Kaoru Kurosawa, Swee-Huay Heng. pkc 2005: 328-345 [doi]

A Scheme for Partial Disclosure of Transaction LogYasuhiro Ohtaki, Masaru Kamada, Kaoru Kurosawa. ieicet, 88-A(1):222-229, 2005. [doi]

2004

Almost Ideal Contrast Visual Cryptography with ReversingQuang Viet Duong, Kaoru Kurosawa. ctrsa 2004: 353-365 [doi]

Square Hash with a Small Key SizeSwee-Huay Heng, Kaoru Kurosawa. ieicet, 87-A(1):54-59, 2004. [doi]

k-Resilient Identity-Based Encryption in the Standard ModelSwee-Huay Heng, Kaoru Kurosawa. ctrsa 2004: 67-80 [doi]

How to Re-use Round Function in Super-Pseudorandom PermutationTetsu Iwata, Kaoru Kurosawa. acisp 2004: 224-235 [doi]

On the Universal Hash Functions in Luby-Rackoff CipherTetsu Iwata, Kaoru Kurosawa. ieicet, 87-A(1):60-66, 2004. [doi]

Short Exponent Diffie-Hellman ProblemsTakeshi Koshiba, Kaoru Kurosawa. pkc 2004: 173-186 [doi]

TMAC: Two-Key CBC MACKaoru Kurosawa, Tetsu Iwata. ieicet, 87-A(1):46-52, 2004. [doi]

New covering radius of Reed-Muller codes for t-resilient functionsKaoru Kurosawa, Tetsu Iwata, Takayuki Yoshiwara. TIT, 20(3):468-475, 2004.

A New Paradigm of Hybrid Encryption SchemeKaoru Kurosawa, Yvo Desmedt. crypto 2004: 426-442 [doi]

How to Remove MAC from DHIESKaoru Kurosawa, Toshihiko Matsuo. acisp 2004: 236-247 [doi]

Almost security of cryptographic Boolean functionsKaoru Kurosawa, Ryutaroh Matsumoto. TIT, 50(11):2752-2761, 2004.

How to Design Efficient Multiple-Use 1-out-n Oblivious TransferKaoru Kurosawa, Quang Viet Duong. ieicet, 87-A(1):141-146, 2004. [doi]

From Digital Signature to ID-based Identification/SignatureKaoru Kurosawa, Swee-Huay Heng. pkc 2004: 248-261 [doi]

On Parallel Hash Functions Based on Block-CiphersToshihiko Matsuo, Kaoru Kurosawa. ieicet, 87-A(1):67-74, 2004. [doi]

Verifiable Shuffles: A Formal Model and a Paillier-Based Efficient Construction with Provable SecurityLan Nguyen, Reihaneh Safavi-Naini, Kaoru Kurosawa. acns 2004: 61-75 [doi]

New combinatorial designs and their applications to authentication codes and secret sharing schemesWakaha Ogata, Kaoru Kurosawa, Douglas R. Stinson, Hajime Saido. DM, 279(1-3):383-405, 2004. [doi]

Oblivious keyword searchWakaha Ogata, Kaoru Kurosawa. jc, 20(2-3):356-371, 2004. [doi]

2003

Error Correcting and Complexity Aspects of Linear Secret Sharing SchemesYvo Desmedt, Kaoru Kurosawa, Tri Van Le. iiswc 2003: 396-407 [doi]

Square Hash with a Small Key SizeSwee-Huay Heng, Kaoru Kurosawa. acisp 2003: 522-531 [doi]

On the Pseudorandomness of KASUMI Type PermutationsTetsu Iwata, Tohru Yagi, Kaoru Kurosawa. acisp 2003: 130-141 [doi]

OMAC: One-Key CBC MACTetsu Iwata, Kaoru Kurosawa. fse 2003: 129-153 [doi]

Non-cryptographic primitive for pseudorandom permutationTetsu Iwata, Tomonobu Yoshino, Kaoru Kurosawa. TCS, 306(1-3):139-154, 2003. [doi]

On the Security of a New Variant of OMACTetsu Iwata, Kaoru Kurosawa. icisc 2004: 67-78 [doi]

Stronger Security Bounds for OMAC, TMAC, and XCBCTetsu Iwata, Kaoru Kurosawa. indocrypt 2003: 402-415 [doi]

On the Correctness of Security Proofs for the 3GPP Confidentiality and Integrity AlgorithmsTetsu Iwata, Kaoru Kurosawa. ima 2003: 306-318 [doi]

TMAC: Two-Key CBC MACKaoru Kurosawa, Tetsu Iwata. ctrsa 2003: 33-49 [doi]

A Complete and Explicit Security Reduction Algorithm for RSA-Based CryptosystemsKaoru Kurosawa, Katja Schmidt-Samoa, Tsuyoshi Takagi. asiacrypt 2003: 474-491 [doi]

Some RSA-Based Encryption Schemes with Tight Security ReductionKaoru Kurosawa, Tsuyoshi Takagi. asiacrypt 2003: 19-36 [doi]

On Parallel Hash Functions Based on Block-CipherToshihiko Matsuo, Kaoru Kurosawa. acisp 2003: 510-521 [doi]

2002

2001

New Covering Radius of Reed-Muller Codes for t-Resilient FunctionsTetsu Iwata, Takayuki Yoshiwara, Kaoru Kurosawa. sacrypt 2001: 75-86 [doi]

PreviousNext