default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKaoru Kurosawa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c134]Reo Eriguchi, Kaoru Kurosawa, Koji Nuida
:
Efficient and Generic Methods to Achieve Active Security in Private Information Retrieval and More Advanced Database Search. EUROCRYPT (5) 2024: 92-121- [i53]Reo Eriguchi, Kaoru Kurosawa, Koji Nuida:
Efficient and Generic Methods to Achieve Active Security in Private Information Retrieval and More Advanced Database Search. IACR Cryptol. ePrint Arch. 2024: 375 (2024) - 2023
- [i52]Reo Eriguchi, Kaoru Kurosawa, Koji Nuida:
New Generic Constructions of Error-Correcting PIR and Efficient Instantiations. IACR Cryptol. ePrint Arch. 2023: 210 (2023) - 2022
- [j80]Toi Tomita, Wakaha Ogata, Kaoru Kurosawa:
Boosting CPA to CCA2 for Leakage-Resilient Attribute-Based Encryption by Using New QA-NIZK. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(3): 143-159 (2022) - [c133]Reo Eriguchi, Kaoru Kurosawa, Koji Nuida:
Multi-Server PIR with Full Error Detection and Limited Error Correction. ITC 2022: 1:1-1:20 - [c132]Reo Eriguchi, Kaoru Kurosawa, Koji Nuida:
On the Optimal Communication Complexity of Error-Correcting Multi-server PIR. TCC (3) 2022: 60-88 - [i51]Reo Eriguchi, Kaoru Kurosawa, Koji Nuida:
Multi-Server PIR with Full Error Detection and Limited Error Correction. IACR Cryptol. ePrint Arch. 2022: 500 (2022) - [i50]Reo Eriguchi, Kaoru Kurosawa, Koji Nuida:
On the Optimal Communication Complexity of Error-Correcting Multi-Server PIR. IACR Cryptol. ePrint Arch. 2022: 1206 (2022) - 2021
- [c131]Takanori Daiza, Kaoru Kurosawa:
Optimum Attack on 3-Round Feistel-2 Structure. IWSEC 2021: 175-192 - 2020
- [j79]Toi Tomita, Wakaha Ogata, Kaoru Kurosawa, Ryo Kuwayama:
CCA-Secure Leakage-Resilient Identity-Based Encryption without q-Type Assumptions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(10): 1157-1166 (2020) - [j78]Jia-Ch'ng Loh, Swee-Huay Heng, Syh-Yuan Tan, Kaoru Kurosawa:
On the Invisibility and Anonymity of Undeniable Signature Schemes. J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl. 11(1): 18-34 (2020)
2010 – 2019
- 2019
- [j77]Wakaha Ogata, Kaoru Kurosawa:
No-Dictionary Searchable Symmetric Encryption. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(1): 114-124 (2019) - [c130]Kaoru Kurosawa:
How to Correct Errors in Multi-server PIR. ASIACRYPT (2) 2019: 564-574 - [c129]Toi Tomita, Wakaha Ogata, Kaoru Kurosawa:
CCA-Secure Leakage-Resilient Identity-Based Key-Encapsulation from Simple (Not \mathtt q -type) Assumptions. IWSEC 2019: 3-22 - [c128]Kaoru Kurosawa, Akinaga Ueda, Hayato Matsuhashi, Yusuke Sakagami:
How to Solve Multiple Short-Exponent Discrete Logarithm Problem. IWSEC 2019: 53-64 - [c127]Jia-Ch'ng Loh, Swee-Huay Heng, Syh-Yuan Tan, Kaoru Kurosawa:
A Note on the Invisibility and Anonymity of Undeniable Signature Schemes. WISA 2019: 112-125 - [i49]Kaoru Kurosawa:
How to Correct Errors in Multi-Server PIR. IACR Cryptol. ePrint Arch. 2019: 531 (2019) - [i48]Toi Tomita, Wakaha Ogata, Kaoru Kurosawa, Ryo Kuwayama:
CCA-Secure Leakage-Resilient Identity-Based Key-Encapsulation from Simple (not $\mathtt{q}$-type) Assumptions. IACR Cryptol. ePrint Arch. 2019: 982 (2019) - 2018
- [c126]Akinaga Ueda, Hayato Tada, Kaoru Kurosawa:
(Short Paper) How to Solve DLOG Problem with Auxiliary Input. IWSEC 2018: 104-113 - [c125]Hayato Tada, Akinaga Ueda, Kaoru Kurosawa:
How to Prove KDM Security of BHHO. IWSEC 2018: 281-296 - 2017
- [j76]Kaoru Kurosawa, Hiroyuki Ohta, Kenji Kakuta:
How to make a linear network code (strongly) secure. Des. Codes Cryptogr. 82(3): 559-582 (2017) - [j75]Kaoru Kurosawa, Le Trieu Phong:
Anonymous and leakage resilient IBE and IPE. Des. Codes Cryptogr. 85(2): 273-298 (2017) - [j74]Naoto Itakura, Kaoru Kurosawa, Kazuki Yoneyama:
Oblivious Polynomial Evaluation in the Exponent, Revisited. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(1): 26-33 (2017) - [j73]Kaoru Kurosawa, Le Trieu Phong:
IBE and function-private IBE under linear assumptions with shorter ciphertexts and private keys, and extensions. Int. J. Appl. Cryptogr. 3(3): 210-224 (2017) - [c124]Kaoru Kurosawa, Rie Habuka:
More Efficient Construction of Bounded KDM Secure Encryption. ACNS 2017: 354-372 - [c123]Wakaha Ogata, Kaoru Kurosawa:
Efficient No-dictionary Verifiable Searchable Symmetric Encryption. Financial Cryptography 2017: 498-516 - 2016
- [c122]Kaoru Kurosawa, Keisuke Sasaki, Kiyohiko Ohta, Kazuki Yoneyama:
UC-Secure Dynamic Searchable Symmetric Encryption Scheme. IWSEC 2016: 73-90 - [i47]Wakaha Ogata, Kaoru Kurosawa:
Efficient No-dictionary Verifiable SSE. IACR Cryptol. ePrint Arch. 2016: 981 (2016) - 2015
- [j72]Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong:
Generic Fully Simulatable Adaptive Oblivious Transfer. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(1): 232-245 (2015) - [j71]Shigeyoshi Imai, Kaoru Kurosawa:
Improved reconstruction of RSA private-keys from their fraction. Inf. Process. Lett. 115(6-8): 630-632 (2015) - [c121]Kaoru Kurosawa, Le Trieu Phong:
IBE Under k k -LIN with Shorter Ciphertexts and Private Keys. ACISP 2015: 145-159 - [c120]Koji Nuida, Naoto Itakura, Kaoru Kurosawa:
A Simple and Improved Algorithm for Integer Factorization with Implicit Hints. CT-RSA 2015: 258-269 - [c119]Koji Nuida, Kaoru Kurosawa:
(Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces. EUROCRYPT (1) 2015: 537-555 - [i46]Kaoru Kurosawa, Yasuhiro Ohtaki:
How to Construct UC-Secure Searchable Symmetric Encryption Scheme. IACR Cryptol. ePrint Arch. 2015: 251 (2015) - 2014
- [j70]Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong:
Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(1): 215-224 (2014) - [c118]Kaoru Kurosawa, Le Trieu Phong:
Kurosawa-Desmedt Key Encapsulation Mechanism, Revisited. AFRICACRYPT 2014: 51-68 - [c117]Kaoru Kurosawa, Jun Furukawa:
2-Pass Key Exchange Protocols from CPA-Secure KEM. CT-RSA 2014: 385-401 - [c116]Kaoru Kurosawa:
Garbled Searchable Symmetric Encryption. Financial Cryptography 2014: 234-251 - [i45]Koji Nuida, Kaoru Kurosawa:
(Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces. IACR Cryptol. ePrint Arch. 2014: 777 (2014) - [i44]Koji Nuida, Naoto Itakura, Kaoru Kurosawa:
A Simple and Improved Algorithm for Integer Factorization with Implicit Hints. IACR Cryptol. ePrint Arch. 2014: 839 (2014) - 2013
- [j69]Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong:
New leakage-resilient CCA-secure public key encryption. J. Math. Cryptol. 7(4): 297-312 (2013) - [c115]Kaoru Kurosawa, Le Trieu Phong:
Leakage Resilient IBE and IPE under the DLIN Assumption. ACNS 2013: 487-501 - [c114]Kaoru Kurosawa, Yasuhiro Ohtaki:
How to Update Documents Verifiably in Searchable Symmetric Encryption. CANS 2013: 309-328 - [c113]Kaoru Kurosawa, Hiroyuki Ohta, Kenji Kakuta:
How to Construct Strongly Secure Network Coding Scheme. ICITS 2013: 1-17 - [c112]Kaoru Kurosawa, Takuma Ueda:
How to Factor N 1 and N 2 When $p_1=p_2 \bmod 2^t$. IWSEC 2013: 217-225 - [e5]Kaoru Kurosawa, Goichiro Hanaoka:
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 [contents] - [i43]Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong:
UC-Secure Multi-Session OT Using Tamper-Proof Hardware. IACR Cryptol. ePrint Arch. 2013: 77 (2013) - [i42]Kaoru Kurosawa, Takuma Ueda:
How to Factor N1 and N2 When p1=p2 mod 2t. IACR Cryptol. ePrint Arch. 2013: 249 (2013) - [i41]Kaoru Kurosawa, Le Trieu Phong:
Kurosawa-Desmedt Key Encapsulation Mechanism, Revisited. IACR Cryptol. ePrint Arch. 2013: 765 (2013) - 2012
- [j68]Kaoru Kurosawa:
Round-efficient perfectly secure message transmission scheme against general adversary. Des. Codes Cryptogr. 63(2): 199-207 (2012) - [j67]Le Trieu Phong, Kaoru Kurosawa, Wakaha Ogata:
Undeniable and Unpretendable Signatures. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(1): 138-150 (2012) - [c111]Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong:
Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions. ACISP 2012: 235-246 - [c110]Kaoru Kurosawa, Yasuhiro Ohtaki:
UC-Secure Searchable Symmetric Encryption. Financial Cryptography 2012: 285-298 - [i40]Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong:
Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions. IACR Cryptol. ePrint Arch. 2012: 213 (2012) - [i39]Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong:
New Leakage Resilient CCA-Secure Public Key Encryption. IACR Cryptol. ePrint Arch. 2012: 453 (2012) - 2011
- [j66]Yusuke Sakai, Goichiro Hanaoka, Kaoru Kurosawa, Kazuo Ohta:
How to Shorten a Ciphertext of Reproducible Key Encapsulation Mechanisms in the Random Oracle Model. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(6): 1293-1305 (2011) - [j65]Kaoru Kurosawa:
General Error Decodable Secret Sharing Scheme and Its Application. IEEE Trans. Inf. Theory 57(9): 6304-6309 (2011) - [c109]Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong:
Generic Fully Simulatable Adaptive Oblivious Transfer. ACNS 2011: 274-291 - [c108]Ashish Choudhury, Kaoru Kurosawa, Arpita Patra:
Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary. ACNS 2011: 292-308 - [c107]Ashish Choudhury, Kaoru Kurosawa, Arpita Patra:
The Round Complexity of Perfectly Secure General VSS. ICITS 2011: 143-162 - [r1]Kaoru Kurosawa:
Hybrid Encryption. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 570-572 - [i38]Ashish Choudhury, Kaoru Kurosawa, Arpita Patra:
Simple and Efficient Single Round Almost Perfectly Secure Message Transmission Tolerating Generalized Adversary. IACR Cryptol. ePrint Arch. 2011: 27 (2011) - [i37]Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong:
Generic Fully Simulatable Adaptive Oblivious Transfer. IACR Cryptol. ePrint Arch. 2011: 382 (2011) - [i36]Kaoru Kurosawa, Le Trieu Phong:
Maximum Leakage Resilient IBE and IPE. IACR Cryptol. ePrint Arch. 2011: 628 (2011) - 2010
- [j64]Le Trieu Phong, Kaoru Kurosawa, Wakaha Ogata:
New RSA-Based (Selectively) Convertible Undeniable Signature Schemes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(1): 63-75 (2010) - [j63]Goichiro Hanaoka, Kaoru Kurosawa:
Between Hashed DH and Computational DH: Compact Encryption from Weaker Assumption. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(11): 1994-2006 (2010) - [j62]Yvo Desmedt, Rosario Gennaro, Kaoru Kurosawa, Victor Shoup:
A New and Improved Paradigm for Hybrid Encryption Secure Against Chosen-Ciphertext Attack. J. Cryptol. 23(1): 91-120 (2010) - [j61]Kaoru Kurosawa:
Power of a public random permutation and its application to authenticated encryption. IEEE Trans. Inf. Theory 56(10): 5366-5374 (2010) - [c106]Kaoru Kurosawa:
Cryptography for Unconditionally Secure Message Transmission in Networks (Invited Talk). CANS 2010: 43 - [c105]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 - [c104]Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong:
Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption. SCN 2010: 172-181 - [c103]Le Trieu Phong, Kaoru Kurosawa, Wakaha Ogata:
Provably Secure Convertible Undeniable Signatures with Unambiguity. SCN 2010: 291-308 - [e4]Kaoru Kurosawa:
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 [contents] - [e3]Swee-Huay Heng, Kaoru Kurosawa:
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 [contents] - [i35]Goichiro Hanaoka, Kaoru Kurosawa:
Between Hashed DH and Computational DH: Compact Encryption from Weaker Assumption. IACR Cryptol. ePrint Arch. 2010: 35 (2010) - [i34]Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong:
Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption. IACR Cryptol. ePrint Arch. 2010: 327 (2010) - [i33]Kaoru Kurosawa:
Round-Efficient Perfectly Secure Message Transmission Scheme Against General Adversary. IACR Cryptol. ePrint Arch. 2010: 450 (2010) - [i32]Ashish Choudhury, Kaoru Kurosawa, Arpita Patra:
The Round Complexity of General VSS. IACR Cryptol. ePrint Arch. 2010: 609 (2010)
2000 – 2009
- 2009
- [j60]Kouichi Itoh, Noboru Kunihiro, Kaoru Kurosawa:
Small Secret Key Attack on a Takagi's Variant of RSA. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(1): 33-41 (2009) - [j59]Masayuki Abe, Yang Cui, Hideki Imai, Kaoru Kurosawa:
Tag-KEM from Set Partial Domain One-Way Permutations. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(1): 42-52 (2009) - [j58]Kaoru Kurosawa, Kazuhiro Suzuki:
Almost Secure (1-Round, n-Channel) Message Transmission Scheme. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(1): 105-112 (2009) - [j57]Kaoru Kurosawa, Tsuyoshi Takagi:
One-wayness equivalent to general factoring. IEEE Trans. Inf. Theory 55(9): 4249-4262 (2009) - [j56]Kaoru Kurosawa, Kazuhiro Suzuki:
Truly efficient 2-round perfectly secure message transmission scheme. IEEE Trans. Inf. Theory 55(11): 5223-5232 (2009) - [c102]Le Trieu Phong, Kaoru Kurosawa, Wakaha Ogata:
New RSA-Based (Selectively) Convertible Undeniable Signature Schemes. AFRICACRYPT 2009: 116-134 - [c101]Kaoru Kurosawa, Ryo Nojima:
Simple Adaptive Oblivious Transfer without Random Oracle. ASIACRYPT 2009: 334-346 - [i31]Kaoru Kurosawa:
General Error Decodable Secret Sharing Scheme and Its Application. IACR Cryptol. ePrint Arch. 2009: 263 (2009) - [i30]Kaoru Kurosawa, Ryo Nojima:
Simple Adaptive Oblivious Transfer Without Random Oracle. IACR Cryptol. ePrint Arch. 2009: 327 (2009) - [i29]Le Trieu Phong, Kaoru Kurosawa, Wakaha Ogata:
Provably Secure Convertible Undeniable Signatures with Unambiguity. IACR Cryptol. ePrint Arch. 2009: 394 (2009) - 2008
- [j55]Tetsu Iwata, Tohru Yagi, Kaoru Kurosawa:
Security of the Five-Round Kasumi Type Permutation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(1): 30-38 (2008) - [j54]Kazuhiro Suzuki, Dongvu Tonien, Kaoru Kurosawa, Koji Toyota:
Birthday Paradox for Multi-Collisions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(1): 39-45 (2008) - [j53]Noboru Kunihiro, Kaoru Kurosawa:
Deterministic Polynomial Time Equivalence between Factoring and Key-Recovery Attack on Takagi's RSA. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(9): 2356-2364 (2008) - [j52]Kaoru Kurosawa, Swee-Huay Heng:
The power of identification schemes. Int. J. Appl. Cryptogr. 1(1): 60-69 (2008) - [j51]Masayuki Abe, Rosario Gennaro, Kaoru Kurosawa:
Tag-KEM/DEM: A New Framework for Hybrid Encryption. J. Cryptol. 21(1): 97-130 (2008) - [j50]Kaoru Kurosawa, Wataru Kishimoto, Takeshi Koshiba:
A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions. IEEE Trans. Inf. Theory 54(6): 2566-2571 (2008) - [c100]Goichiro Hanaoka, Kaoru Kurosawa:
Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption. ASIACRYPT 2008: 308-325 - [c99]Kouichi Itoh, Noboru Kunihiro, Kaoru Kurosawa:
Small Secret Key Attack on a Variant of RSA (Due to Takagi). CT-RSA 2008: 387-406 - [c98]Kaoru Kurosawa, Kazuhiro Suzuki:
Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme. EUROCRYPT 2008: 324-340 - [c97]Kaoru Kurosawa, Jun Furukawa:
Universally Composable Undeniable Signature. ICALP (2) 2008: 524-535 - [c96]Kaoru Kurosawa, Takeshi Koshiba:
Simple Direct Reduction of String (1, 2)-OT to Rabin's OT without Privacy Amplification. ICITS 2008: 199-209 - [c95]Jun Furukawa, Frederik Armknecht, Kaoru Kurosawa:
A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort. SCN 2008: 392-408 - [i28]Kaoru Kurosawa, Jun Furukawa:
Universally Composable Undeniable Signature. IACR Cryptol. ePrint Arch. 2008: 94 (2008) - [i27]Goichiro Hanaoka, Kaoru Kurosawa:
Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption. IACR Cryptol. ePrint Arch. 2008: 211 (2008) - [i26]Kaoru Kurosawa, Kazuhiro Suzuki:
Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme. IACR Cryptol. ePrint Arch. 2008: 421 (2008) - 2007
- [j49]Tetsu Iwata, Kaoru Kurosawa:
How to Construct Super-Pseudorandom Permutations with Short Keys. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(1): 2-13 (2007) - [j48]Osamu Hirota, Kaoru Kurosawa:
Immunity against Correlation Attack on Quantum Stream Cipher by Yuen 2000 Protocol. Quantum Inf. Process. 6(2): 81-91 (2007) - [j47]Mihir Bellare, Alexandra Boldyreva, Kaoru Kurosawa, Jessica Staddon:
Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security. IEEE Trans. Inf. Theory 53(11): 3927-3943 (2007) - [c94]Kaoru Kurosawa, Kazuhiro Suzuki:
Almost Secure (1-Round, n-Channel) Message Transmission Scheme. ICITS 2007: 99-112 - [c93]Yvo Desmedt, Kaoru Kurosawa:
A Generalization and a Variant of Two Threshold Cryptosystems Based on Factoring. ISC 2007: 351-361 - [c92]Kazuhiro Suzuki, Kaoru Kurosawa:
How to Find Many Collisions of 3-Pass HAVAL. IWSEC 2007: 428-443 - [c91]Noboru Kunihiro, Kaoru Kurosawa:
Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi's RSA. Public Key Cryptography 2007: 412-425 - [e2]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. Lecture Notes in Computer Science 4833, Springer 2007, ISBN 978-3-540-76899-9 [contents] - [i25]Kaoru Kurosawa, Takeshi Koshiba:
Direct Reduction of String (1, 2)-OT to Rabin's OT. IACR Cryptol. ePrint Arch. 2007: 46 (2007) - [i24]Kaoru Kurosawa, Wataru Kishimoto, Takeshi Koshiba:
How to Derive Lower Bound on Oblivious Transfer Reduction. IACR Cryptol. ePrint Arch. 2007: 65 (2007) - [i23]Kaoru Kurosawa, Kazuhiro Suzuki:
Almost Secure (1-Round, n-Channel) Message Transmission Scheme. IACR Cryptol. ePrint Arch. 2007: 76 (2007) - [i22]Kazuhiro Suzuki, Kaoru Kurosawa:
How To Find Many Collisions of 3-Pass HAVAL. IACR Cryptol. ePrint Arch. 2007: 79 (2007) - 2006
- [j46]Swee-Huay Heng, Kaoru Kurosawa:
k-Resilient Identity-Based Encryption in the Standard Model. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(1): 39-46 (2006) - [j45]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) - [j44]Wakaha Ogata, Kaoru Kurosawa, Douglas R. Stinson:
Optimum Secret Sharing Scheme Secure against Cheating. SIAM J. Discret. Math. 20(1): 79-95 (2006) - [j43]Wakaha Ogata, Kaoru Kurosawa, Swee-Huay Heng:
The security of the FDH variant of Chaum's undeniable signature scheme. IEEE Trans. Inf. Theory 52(5): 2006-2017 (2006) - [j42]Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu:
Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography. IEEE Trans. Inf. Theory 52(9): 4251-4256 (2006) - [c90]Masayuki Abe, Yang Cui, Hideki Imai, Kaoru Kurosawa:
Tag-KEM from Set Partial Domain One-Way Permutations. ACISP 2006: 360-370 - [c89]Kaoru Kurosawa, Tsuyoshi Takagi:
New Approach for Selectively Convertible Undeniable Signature Schemes. ASIACRYPT 2006: 428-443 - [c88]Jun Furukawa, Kaoru Kurosawa, Hideki Imai:
An Efficient Compiler from Sigma-Protocol to 2-Move Deniable Zero-Knowledge. ICALP (2) 2006: 46-57 - [c87]Kazuhiro Suzuki, Dongvu Tonien, Kaoru Kurosawa, Koji Toyota:
Birthday Paradox for Multi-collisions. ICISC 2006: 29-40 - [c86]Tri Van Le, Kaoru Kurosawa:
Bandwidth Optimal Steganography Secure Against Adaptive Chosen Stegotext Attacks. Information Hiding 2006: 297-313 - [c85]Kaoru Kurosawa, Katja Schmidt-Samoa:
New Online/Offline Signature Schemes Without Random Oracles. Public Key Cryptography 2006: 330-346 - [c84]Kaoru Kurosawa, Swee-Huay Heng:
The Power of Identification Schemes. Public Key Cryptography 2006: 364-377 - [c83]Kaoru Kurosawa, Swee-Huay Heng:
Relations Among Security Notions for Undeniable Signature Schemes. SCN 2006: 34-48 - [e1]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, ISBN 1-59593-555-X [contents] - 2005
- [j41]Kaoru Kurosawa, Tetsu Iwata, Quang Viet Duong:
How to Improve Interpolation Attack. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(1): 9-15 (2005) - [j40]Tetsu Iwata, Kaoru Kurosawa:
On the Security of a MAC by Mitchell. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(1): 25-32 (2005) - [j39]Yasuhiro Ohtaki, Masaru Kamada, Kaoru Kurosawa:
A Scheme for Partial Disclosure of Transaction Log. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(1): 222-229 (2005) - [j38]Masaru Kamada, Kaoru Kurosawa, Yasuhiro Ohtaki, Shusuke Okamoto:
A Network Game Based on Fair Random Numbers. IEICE Trans. Inf. Syst. 88-D(5): 859-864 (2005) - [j37]Lan Nguyen, Reihaneh Safavi-Naini, Kaoru Kurosawa:
A Provably Secure and Efficient Verifiable Shuffle based on a Variant of the Paillier Cryptosystem. J. Univers. Comput. Sci. 11(6): 986-1010 (2005) - [c82]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 - [c81]Kaoru Kurosawa, Swee-Huay Heng:
3-Move Undeniable Signature Scheme. EUROCRYPT 2005: 181-197 - [c80]Tetsu Iwata, Kaoru Kurosawa:
How to Enhance the Security of the 3GPP Confidentiality and Integrity Algorithms. FSE 2005: 268-283 - [c79]Kaoru Kurosawa, Swee-Huay Heng:
Identity-Based Identification Without Random Oracles. ICCSA (2) 2005: 603-613 - [c78]Kaoru Kurosawa:
Some topics related to resilient functions. ICITS 2005: 55-60 - [c77]Yvo Desmedt, Kaoru Kurosawa:
Electronic Voting: Starting Over? ISC 2005: 329-343 - [c76]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 - [i21]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) - [i20]Masayuki Abe, Rosario Gennaro, Kaoru Kurosawa:
Tag-KEM/DEM: A New Framework for Hybrid Encryption. IACR Cryptol. ePrint Arch. 2005: 27 (2005) - [i19]Lan Nguyen, Reihaneh Safavi-Naini, Kaoru Kurosawa:
A Provably Secure and Efficient Verifiable Shuffle based on a Variant of the Paillier Cryptosystem. IACR Cryptol. ePrint Arch. 2005: 162 (2005) - [i18]Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu:
Primal-Dual Distance Bounds of Linear Codes with Application to Cryptography. IACR Cryptol. ePrint Arch. 2005: 194 (2005) - [i17]Kaoru Kurosawa, Tsuyoshi Takagi:
One-Wayness Equivalent to General Factoring. IACR Cryptol. ePrint Arch. 2005: 382 (2005) - 2004
- [j36]Wakaha Ogata, Kaoru Kurosawa, Douglas R. Stinson, Hajime Saido:
New combinatorial designs and their applications to authentication codes and secret sharing schemes. Discret. Math. 279(1-3): 383-405 (2004) - [j35]Kaoru Kurosawa, Tetsu Iwata:
TMAC: Two-Key CBC MAC. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 87-A(1): 46-52 (2004) - [j34]Swee-Huay Heng, Kaoru Kurosawa:
Square Hash with a Small Key Size. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 87-A(1): 54-59 (2004) - [j33]Tetsu Iwata, Kaoru Kurosawa:
On the Universal Hash Functions in Luby-Rackoff Cipher. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 87-A(1): 60-66 (2004) - [j32]Toshihiko Matsuo, Kaoru Kurosawa:
On Parallel Hash Functions Based on Block-Ciphers. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 87-A(1): 67-74 (2004) - [j31]Kaoru Kurosawa, Quang Viet Duong:
How to Design Efficient Multiple-Use 1-out-n Oblivious Transfer. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 87-A(1): 141-146 (2004) - [j30]Wakaha Ogata, Kaoru Kurosawa:
Oblivious keyword search. J. Complex. 20(2-3): 356-371 (2004) - [j29]Kaoru Kurosawa, Tetsu Iwata, Takayuki Yoshiwara:
New covering radius of Reed-Muller codes for t-resilient functions. IEEE Trans. Inf. Theory 50(3): 468-475 (2004) - [j28]Kaoru Kurosawa, Ryutaroh Matsumoto:
Almost security of cryptographic Boolean functions. IEEE Trans. Inf. Theory 50(11): 2752-2761 (2004) - [c75]Tetsu Iwata, Kaoru Kurosawa:
How to Re-use Round Function in Super-Pseudorandom Permutation. ACISP 2004: 224-235 - [c74]Kaoru Kurosawa, Toshihiko Matsuo:
How to Remove MAC from DHIES. ACISP 2004: 236-247 - [c73]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 - [c72]Kaoru Kurosawa, Yvo Desmedt:
A New Paradigm of Hybrid Encryption Scheme. CRYPTO 2004: 426-442 - [c71]Swee-Huay Heng, Kaoru Kurosawa:
k-Resilient Identity-Based Encryption in the Standard Model. CT-RSA 2004: 67-80 - [c70]Quang Viet Duong, Kaoru Kurosawa:
Almost Ideal Contrast Visual Cryptography with Reversing. CT-RSA 2004: 353-365 - [c69]Takeshi Koshiba, Kaoru Kurosawa:
Short Exponent Diffie-Hellman Problems. Public Key Cryptography 2004: 173-186 - [c68]Kaoru Kurosawa, Swee-Huay Heng:
From Digital Signature to ID-based Identification/Signature. Public Key Cryptography 2004: 248-261 - [i16]Quang Viet Duong, Kaoru Kurosawa:
Almost Ideal Contrast Visual Cryptography with Reversing. IACR Cryptol. ePrint Arch. 2004: 287 (2004) - [i15]Wakaha Ogata, Kaoru Kurosawa, Swee-Huay Heng:
The Security of the FDH Variant of Chaum's Undeniable Signature Scheme. IACR Cryptol. ePrint Arch. 2004: 290 (2004) - 2003
- [j27]Tetsu Iwata, Kaoru Kurosawa:
Inclusion Relations of Boolean Functions Satisfying PC(l) of Order k. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(1): 47-53 (2003) - [j26]Tetsu Iwata, Tomonobu Yoshino, Kaoru Kurosawa:
Non-cryptographic primitive for pseudorandom permutation. Theor. Comput. Sci. 306(1-3): 139-154 (2003) - [c67]Tetsu Iwata, Tohru Yagi, Kaoru Kurosawa:
On the Pseudorandomness of KASUMI Type Permutations. ACISP 2003: 130-141 - [c66]Toshihiko Matsuo, Kaoru Kurosawa:
On Parallel Hash Functions Based on Block-Cipher. ACISP 2003: 510-521 - [c65]Swee-Huay Heng, Kaoru Kurosawa:
Square Hash with a Small Key Size. ACISP 2003: 522-531 - [c64]Kaoru Kurosawa, Tsuyoshi Takagi:
Some RSA-Based Encryption Schemes with Tight Security Reduction. ASIACRYPT 2003: 19-36 - [c63]Kaoru Kurosawa, Katja Schmidt-Samoa, Tsuyoshi Takagi:
A Complete and Explicit Security Reduction Algorithm for RSA-Based Cryptosystems. ASIACRYPT 2003: 474-491 - [c62]Kaoru Kurosawa, Tetsu Iwata:
TMAC: Two-Key CBC MAC. CT-RSA 2003: 33-49 - [c61]Tetsu Iwata, Kaoru Kurosawa:
OMAC: One-Key CBC MAC. FSE 2003: 129-153 - [c60]Tetsu Iwata, Kaoru Kurosawa:
On the Security of a New Variant of OMAC. ICISC 2003: 67-78 - [c59]Tetsu Iwata, Kaoru Kurosawa:
On the Correctness of Security Proofs for the 3GPP Confidentiality and Integrity Algorithms. IMACC 2003: 306-318 - [c58]Tetsu Iwata, Kaoru Kurosawa:
Stronger Security Bounds for OMAC, TMAC, and XCBC. INDOCRYPT 2003: 402-415 - [c57]Yvo Desmedt, Kaoru Kurosawa, Tri Van Le:
Error Correcting and Complexity Aspects of Linear Secret Sharing Schemes. ISC 2003: 396-407 - [i14]Kaoru Kurosawa:
Almost Security of Cryptographic Boolean Functions. IACR Cryptol. ePrint Arch. 2003: 75 (2003) - [i13]Tetsu Iwata, Kaoru Kurosawa:
Stronger Security Bounds for OMAC, TMAC and XCBC. IACR Cryptol. ePrint Arch. 2003: 82 (2003) - [i12]Tetsu Iwata, Tohru Yagi, Kaoru Kurosawa:
On the Pseudorandomness of KASUMI Type Permutations. IACR Cryptol. ePrint Arch. 2003: 130 (2003) - [i11]Kaoru Kurosawa, Tsuyoshi Takagi:
Some RSA-based Encryption Schemes with Tight Security Reduction. IACR Cryptol. ePrint Arch. 2003: 157 (2003) - [i10]Tri Van Le, Kaoru Kurosawa:
Efficient Public Key Steganography Secure Against Adaptively Chosen Stegotext Attacks. IACR Cryptol. ePrint Arch. 2003: 244 (2003) - 2002
- [j25]Wataru Kishimoto, Koji Okada, Kaoru Kurosawa, Wakaha Ogata:
On the bound for anonymous secret sharing schemes. Discret. Appl. Math. 121(1-3): 193-202 (2002) - [j24]Tetsu Iwata, Tomonobu Yoshino, Tomohiro Yuasa, Kaoru Kurosawa:
Round Security and Super-Pseudorandomness of MISTY Type Structure. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(1): 2-10 (2002) - [c56]Wakaha Ogata, Kaoru Kurosawa:
Bounds for Robust Metering Schemes and Their Relationship with A-code. ASIACRYPT 2002: 64-80 - [c55]Kaoru Kurosawa, Wakaha Ogata:
Bit-Slice Auction Circuit. ESORICS 2002: 24-38 - [c54]Tetsu Iwata, Tomonobu Yoshino, Kaoru Kurosawa:
Non-cryptographic Primitive for Pseudorandom Permutation. FSE 2002: 149-163 - [c53]Tetsu Iwata, Kaoru Kurosawa:
On the Universal Hash Functionsin Luby-Rackoff Cipher. ICISC 2002: 226-236 - [c52]Kaoru Kurosawa:
Multi-recipient Public-Key Encryption with Shortened Ciphertext. Public Key Cryptography 2002: 48-63 - [c51]Kaoru Kurosawa, Takuya Yoshida:
Linear Code Implies Public-Key Traitor Tracing. Public Key Cryptography 2002: 172-187 - [i9]Kaoru Kurosawa, Tetsu Iwata:
TMAC: Two-Key CBC MAC. IACR Cryptol. ePrint Arch. 2002: 92 (2002) - [i8]Kaoru Kurosawa, Tetsu Iwata, Takayuki Yoshiwara:
New covering radius of Reed-Muller codes for t-resilient functions. IACR Cryptol. ePrint Arch. 2002: 123 (2002) - [i7]Kaoru Kurosawa:
Power of a Public Random Permutation and its Application to Authenticated-Encryption. IACR Cryptol. ePrint Arch. 2002: 127 (2002) - [i6]Tetsu Iwata, Kaoru Kurosawa:
OMAC: One-Key CBC MAC. IACR Cryptol. ePrint Arch. 2002: 180 (2002) - [i5]Wakaha Ogata, Kaoru Kurosawa:
Oblivious Keyword Search. IACR Cryptol. ePrint Arch. 2002: 182 (2002) - [i4]Kaoru Kurosawa, Wakaha Ogata:
Bit-Slice Auction Circuit. IACR Cryptol. ePrint Arch. 2002: 189 (2002) - 2001
- [j23]Satoshi Obana, Kaoru Kurosawa:
Bounds and Combinatorial Structure of Multi-Receiver-Codes. Des. Codes Cryptogr. 22(1): 47-63 (2001) - [j22]Kaoru Kurosawa, Satoshi Obana:
Combinatorial Bounds on Authentication Codes with Arbitration. Des. Codes Cryptogr. 22(3): 265-281 (2001) - [j21]Kaoru Kurosawa, Thomas Johansson, Douglas R. Stinson:
Almost k-Wise Independent Sample Spaces and Their Cryptologic Applications. J. Cryptol. 14(4): 231-253 (2001) - [c50]Tetsu Iwata, Tomonobu Yoshino, Tomohiro Yuasa, Kaoru Kurosawa:
Round Security and Super-Pseudorandomness of MISTY Type Structure. FSE 2001: 233-247 - [c49]Akihiro Yamamura, Kaoru Kurosawa:
Generic Algorithms and Key Agreement Protocols Based on Group Actions. ISAAC 2001: 208-218 - [c48]Kaoru Kurosawa, Wakaha Ogata, Toshihiko Matsuo, Shuichi Makishima:
IND-CCA Public Key Schemes Equivalent to Factoring n=pq. Public Key Cryptography 2001: 36-47 - [c47]Tetsu Iwata, Takayuki Yoshiwara, Kaoru Kurosawa:
New Covering Radius of Reed-Muller Codes for t-Resilient Functions. Selected Areas in Cryptography 2001: 75-86 - [i3]Kaoru Kurosawa:
Multi-Recipient Public-Key Encryption with Shortened Ciphertext. IACR Cryptol. ePrint Arch. 2001: 71 (2001) - [i2]Kaoru Kurosawa, Takuya Yoshida:
Linear Code Implies Public-Key Traitor Tracing. IACR Cryptol. ePrint Arch. 2001: 99 (2001) - 2000
- [j20]Satoshi Obana, Kaoru Kurosawa:
Combinatorial Classification of Optimal Authentication Codes with Arbitration. Des. Codes Cryptogr. 20(3): 281-305 (2000) - [j19]Kaoru Kurosawa, Fumio Sato, Takahiro Sakata, Wataru Kishimoto:
A relationship between linear complexity and kapa-error linear complexity. IEEE Trans. Inf. Theory 46(2): 694-698 (2000) - [j18]Koji Okada, Kaoru Kurosawa:
MDS secret-sharing scheme secure against cheaters. IEEE Trans. Inf. Theory 46(3): 1078-1081 (2000) - [c46]Masashi Mitomo, Kaoru Kurosawa:
Attack for Flash MIX. ASIACRYPT 2000: 192-204 - [c45]Wakaha Ogata, Kaoru Kurosawa:
Provably Secure Metering Scheme. ASIACRYPT 2000: 388-398 - [c44]Akihiro Yamamura, Kaoru Kurosawa:
Key Agreement Protocol Securer than DLOG. Words, Languages & Combinatorics 2000: 450-465 - [c43]Yvo Desmedt, Kaoru Kurosawa:
How to Break a Practical MIX and Design a New One. EUROCRYPT 2000: 557-572 - [c42]Tetsu Iwata, Kaoru Kurosawa:
On the Pseudorandomness of the AES Finalists - RC6 and Serpent. FSE 2000: 231-243 - [c41]Kaoru Kurosawa, Tetsu Iwata, Quang Viet Duong:
Root Finding Interpolation Attack. Selected Areas in Cryptography 2000: 303-314 - [i1]Masashi Mitomo, Kaoru Kurosawa:
How to Encrypt Long Messages without Large Size Symmetric/Asymmetric Encryption Schemes. IACR Cryptol. ePrint Arch. 2000: 65 (2000)
1990 – 1999
- 1999
- [j17]Kaoru Kurosawa, Wakaha Ogata:
Efficient Rabin-type Digital Signature Scheme. Des. Codes Cryptogr. 16(1): 53-64 (1999) - [j16]Carlo Blundo, Alfredo De Santis, Kaoru Kurosawa, Wakaha Ogata:
On a Fallacious Bound for Authentication Codes. J. Cryptol. 12(3): 155-159 (1999) - [j15]Kaoru Kurosawa, Takuya Yoshida:
Strongly universal hashing and identification codes via channels. IEEE Trans. Inf. Theory 45(6): 2091-2095 (1999) - [c40]Takashi Satoh, Tetsu Iwata, Kaoru Kurosawa:
On Cryptographically Secure Vectorial Boolean Functions. ASIACRYPT 1999: 20-28 - [c39]Tetsu Iwata, Kaoru Kurosawa:
Probabilistic Higher Order Differential Attack and Higher Order Bent Functions. ASIACRYPT 1999: 62-74 - 1998
- [j14]Kaoru Kurosawa, Koji Okada, Hajime Saido, Douglas R. Stinson:
New Combinatorial Bounds for Authentication Codes and Key Predistribution Schemes. Des. Codes Cryptogr. 15(1): 87-100 (1998) - [j13]Wakaha Ogata, Kaoru Kurosawa:
Some Basic Properties of General Nonperfect Secret Sharing Schemes. J. Univers. Comput. Sci. 4(8): 690-704 (1998) - [j12]Isao Yamada, Kaoru Kurosawa, Hiroshi Hasegawa, Kohichi Sakaniwa:
Algebraic multidimensional phase unwrapping and zero distribution of complex polynomials-characterization of multivariate stable polynomials. IEEE Trans. Signal Process. 46(6): 1639-1664 (1998) - [c38]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 - [c37]Kaoru Kurosawa, Takuya Yoshida, Yvo Desmedt, Mike Burmester:
Some Bounds and a Construction for Secure Broadcast Encryption. ASIACRYPT 1998: 420-433 - [c36]Kaoru Kurosawa, Yvo Desmedt:
Optimum Traitor Tracing and Asymmetric Schemes. EUROCRYPT 1998: 145-157 - [c35]Tetsu Iwata, Kaoru Kurosawa:
Inclusion Relations of Boolean Functions Satisfying PC(l) of Order k. SETA 1998: 263-272 - [c34]Fumio Sato, Kaoru Kurosawa:
On the Randomness of a [d, k] Self-Decimation Stream Key Generator. SETA 1998: 343-353 - 1997
- [j11]Kaoru Kurosawa, Takashi Satoh, Kentaro Yamamoto:
Highly Nonlinear t-resilient Functions. J. Univers. Comput. Sci. 3(6): 721-729 (1997) - [c33]Kaoru Kurosawa, Satoshi Obana:
Characterisation of (k, n) Multi-receiver Authentication. ACISP 1997: 204-215 - [c32]Kaoru Kurosawa, Thomas Johansson, Douglas R. Stinson:
Almost k-wise Independent Sample Spaces and Their Cryptologic Applications. EUROCRYPT 1997: 409-421 - [c31]Kaoru Kurosawa, Takashi Satoh:
Design of SAC/PC(l) of Order k Boolean Functions and Three Other Cryptographic Criteria. EUROCRYPT 1997: 434-449 - [c30]Satoshi Obana, Kaoru Kurosawa:
A2-code = Affine resolvable = BIBD. ICICS 1997: 118-129 - [c29]Wakaha Ogata, Kaoru Kurosawa, Kazue Sako, Kazunori Takatani:
Fault tolerant anonymous channel. ICICS 1997: 440-444 - 1996
- [j10]Wakaha Ogata, Keiichi Sakano, Kaoru Kurosawa:
Multisymbol Majority Vote and Hard Core. Inf. Process. Lett. 58(6): 285-292 (1996) - [j9]Satoshi Obana, Kaoru Kurosawa:
Veto is Impossible in Secret Sharing Schemes. Inf. Process. Lett. 58(6): 293-295 (1996) - [j8]Kaoru Kurosawa, Koji Okada:
Combinatorial Lower Bounds for Secret Sharing Schemes. Inf. Process. Lett. 60(6): 301-304 (1996) - [j7]Kaoru Kurosawa:
Fast stability test algorithm for discrete time systems. Signal Process. 53(1): 83-88 (1996) - [c28]Kaoru Kurosawa, Takashi Satoh:
Generalization of Higher Order SAC to Vector Output Boolean Functions. ASIACRYPT 1996: 218-231 - [c27]Wakaha Ogata, Kaoru Kurosawa:
Optimum Secret Sharing Scheme Secure against Cheating. EUROCRYPT 1996: 200-211 - 1995
- [j6]Kaoru Kurosawa, Koji Okada, Shigeo Tsujii:
Low Exponent Attack Against Elliptic Curve RSA. Inf. Process. Lett. 53(2): 77-83 (1995) - [c26]Kaoru Kurosawa, Sanpei Kageyama:
New Bound for Afine Resolvable Designs and Its Application to Authentication Codes. COCOON 1995: 292-302 - [c25]Kaoru Kurosawa, Satoshi Obana, Wakaha Ogata:
t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes. CRYPTO 1995: 410-423 - [c24]Kaoru Kurosawa, Satoshi Obana:
Combinatorial Bounds for Authentication Codes with Arbitration. EUROCRYPT 1995: 289-300 - [c23]Kaoru Kurosawa, Naonori Yamashita:
Power Complementary and Linear Phase Filter Banks. ISCAS 1995: 760-763 - 1994
- [c22]Koji Okada, Kaoru Kurosawa:
Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes. ASIACRYPT 1994: 33-41 - [c21]Kaoru Kurosawa, Koji Okada:
Combinatorial Interpretation of Secret Sharing Schemes. ASIACRYPT 1994: 55-64 - [c20]Kaoru Kurosawa, Koji Okada, Keiichi Sakano:
Security of the Center in Key Distribution Schemes. ASIACRYPT 1994: 333-341 - [c19]Kaoru Kurosawa, Koji Okada, Shigeo Tsujii:
Low Exponent Attack against Elliptic Curve RSA. ASIACRYPT 1994: 376-383 - [c18]Kaoru Kurosawa:
New Bound on Authentication Code with Arbitration. CRYPTO 1994: 140-149 - [c17]Kaoru Kurosawa, Isao Yamada, Naonori Yamashita, Toshiriro Komou:
Optimum Highpass Filter in Linear Phase Perfect Reconstruction QMF Bank. ISCAS 1994: 25-28 - [c16]Kaoru Kurosawa, Isao Yamada, Masayuki Ihara:
A Necessary Condition for Linear Phase in Two Dimensional Perfect Reconstruction QMF Banks. ISCAS 1994: 29-32 - [c15]Kaoru Kurosawa:
On McClellan Transform and 2-D QMF Banks. ISCAS 1994: 505-508 - 1993
- [c14]Kaoru Kurosawa, Koji Okada, Keiichi Sakano, Wakaha Ogata, Shigeo Tsujii:
Nonperfect Secret Sharing Schemes and Matroids. EUROCRYPT 1993: 126-141 - [c13]Choonsik Park, Kazutomo Itoh, Kaoru Kurosawa:
Efficient Anonymous Channel and All/Nothing Election Scheme. EUROCRYPT 1993: 248-259 - [c12]Choonsik Park, Kaoru Kurosawa, Tatsuaki Okamoto, Shigeo Tsujii:
On Key Distribution and Authentication in Mobile Radio Networks. EUROCRYPT 1993: 461-465 - [c11]Kaoru Kurosawa, Isao Yamada, Tetsunari Yokokawa, Shigeo Tsujii:
A fast stability test for multidimensional systems. ISCAS 1993: 579-582 - [c10]Kaoru Kurosawa, Kouichi Kawabe, Shigeo Tsujii:
Stability and zeros of a complex polynomial. ISCAS 1993: 2279-2282 - 1992
- [c9]Wakaha Ogata, Kaoru Kurosawa, Shigeo Tsujii:
Nonperfect Secret Sharing Schemes. AUSCRYPT 1992: 56-66 - [c8]Takashi Satoh, Kaoru Kurosawa, Shigeo Tsujii:
Privacy for Multi-Party Protocols. AUSCRYPT 1992: 252-260 - [c7]Kaoru Kurosawa, Osamu Watanabe:
Computational and Statistical Indistinguishabilities. ISAAC 1992: 430-438 - 1991
- [c6]Wakaha Ogata, Kaoru Kurosawa:
On Claw Free Families. ASIACRYPT 1991: 111-123 - [c5]Takeshi Saito, Kaoru Kurosawa, Kouichi Sakurai:
4 Move Perfect ZKIP of Knowledge with No Assumption. ASIACRYPT 1991: 321-330 - 1990
- [c4]Kaoru Kurosawa, Shigeo Tsujii:
Multi-Language Zero Knowledge Interactive Proof Systems. CRYPTO 1990: 339-352 - [c3]Kaoru Kurosawa, Yutaka Katayama, Wakaha Ogata, Shigeo Tsujii:
General Public Key Residue Cryptosystems and Mental Poker Protocols. EUROCRYPT 1990: 374-388
1980 – 1989
- 1989
- [j5]Tomohisa Suganuma, Kaoru Kurosawa, Ni Yongmao:
A polynomial time validation method for channel boundedness of communication protocols (2 processes). Syst. Comput. Jpn. 20(11): 60-66 (1989) - [j4]Kaoru Kurosawa, Shigeo Tsujii:
An IIR parallel-type adaptive algorithm using the fast least squares method. IEEE Trans. Acoust. Speech Signal Process. 37(8): 1226-1230 (1989) - 1988
- [j3]Kaoru Kurosawa, Toshiya Itoh, Masashi Takeuchi:
Public Key Cryptosystem using a reciprocal number with the same Intractability as Factoring a Large number. Cryptologia 12(4): 225-233 (1988) - [j2]Shigeo Tsujii, Toshiya Itoh, Atsushi Fujioka, Kaoru Kurosawa, Tsutomu Matsumoto:
A public-key cryptosystem based on the difficulty of solving a system of nonlinear equations. Syst. Comput. Jpn. 19(2): 10-18 (1988) - [j1]Kaoru Kurosawa, Yoshiki Kuwabara, Takashi Shigeno:
A Validation Method for Communication Protocols Using Context-Free Language Theory. Syst. Comput. Jpn. 19(4): 48-55 (1988) - 1986
- [c2]Kaoru Kurosawa, Shigeo Tsujii:
A new IIR type adaptive algorithm of parallel type structure. ICASSP 1986: 2091-2094 - [c1]Kaoru Kurosawa, Shigeo Tsujii:
An Efficient Method to Find Invalid Loops in a Communication Protocol and Its Application to HDLC. ICC 1986: 563-567
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
