Kaoru Kurosawa

International Association for Cryptologic Research

Kaoru Kurosawa Search web for home page

Program Committees

1	2015	TCC	pc
2	2015	Asiacrypt	pc
3	2014	PKC	pc
4	2014	Crypto	pc
5	2013	PKC	pc chair
6	2012	Crypto	pc
7	2012	PKC	pc
8	2011	PKC	pc
9	2010	Asiacrypt	pc
10	2009	Eurocrypt	pc
11	2009	Crypto	pc
12	2008	PKC	pc
13	2008	Asiacrypt	pc
14	2007	Crypto	pc
15	2007	Asiacrypt	pc chair
16	2006	Asiacrypt	pc
17	2005	PKC	pc
18	2004	FSE	pc
19	2003	PKC	pc
20	2001	Eurocrypt	pc
21	1993	Eurocrypt	pc

Publications

	year	title	booktitle	pages
1	2015	(Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces	eurocrypt	537-555
2	2015	How to Construct UC-Secure Searchable Symmetric Encryption Scheme	eprint	251
3	2010	Round-Efficient Perfectly Secure Message Transmission Scheme Against General Adversary	eprint	online
4	2010	A New and Improved Paradigm for Hybrid Encryption Secure Against Chosen-Ciphertext Attack	jofc	91-120
5	2010	Between Hashed DH and Computational DH: Compact Encryption from Weaker Assumption	eprint	online
6	2010	Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption	eprint	online
7	2009	Simple Adaptive Oblivious Transfer without Random Oracle	asiacrypt	334-346
8	2008	Tag-KEM/DEM: A New Framework for Hybrid Encryption	jofc	97-130
9	2008	Universally Composable Undeniable Signature	eprint	online
10	2008	Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption	asiacrypt	308-325
11	2008	Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme	eurocrypt	324-340
12	2008	Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme	eprint	online
13	2008	Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption	eprint	online
14	2007	Direct Reduction of String (1,2)-OT to Rabin's OT	eprint	online
15	2007	How to Derive Lower Bound on Oblivious Transfer Reduction	eprint	online
16	2007	Almost Secure (1-Round, n-Channel) Message Transmission Scheme	eprint	online
17	2007	How To Find Many Collisions of 3-Pass HAVAL	eprint	online
18	2007	Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi's RSA	pkc	412-425
19	2006	New Approach for Selectively Convertible Undeniable Signature Schemes	asiacrypt	online
20	2006	The Power of Identification Schemes	pkc	online
21	2006	New Online/Offline Signature Schemes Without Random Oracles	pkc	online
22	2005	How to Enhance the Security of the 3GPP Confidentiality and Integrity Algorithms	fse	online
23	2005	Tag-KEM/DEM: A New Framework for Hybrid Encryption	eprint	online
24	2005	The Security of the FDH Variant of Chaum's Undeniable Signature Scheme	pkc	online
25	2005	One-Wayness Equivalent to General Factoring	eprint	online
26	2005	Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM	eurocrypt	online
27	2005	A Provably Secure and Efficient Verifiable Shuffle based on a Variant of the Paillier Cryptosystem	eprint	online
28	2005	3-Move Undeniable Signature Scheme	eurocrypt	online
29	2005	Primal-Dual Distance Bounds of Linear Codes with Application to Cryptography	eprint	online
30	2005	Verifiable Shuffles: A Formal Model and a Paillier-based 3-Round Construction with Provable Security	eprint	online
31	2004	Short Exponent Diffie-Hellman Problems	pkc	online
32	2004	From Digital Signature to ID-based Identification/Signature	pkc	online
33	2004	Almost Ideal Contrast Visual Cryptography with Reversing	eprint	online
34	2004	The Security of the FDH Variant of Chaum's Undeniable Signature Scheme	eprint	online
35	2004	A New Paradigm of Hybrid Encryption Scheme	crypto	online
36	2003	Almost Security of Cryptographic Boolean Functions	eprint	online
37	2003	Stronger Security Bounds for OMAC, TMAC and XCBC	eprint	online
38	2003	A Complete and Explicit Security Reduction Algorithm for RSA-Based Cryptosystems	asiacrypt	online
39	2003	Some RSA-Based Encryption Schemes with Tight Security Reduction	asiacrypt	online
40	2003	On the Pseudorandomness of KASUMI Type Permutations	eprint	online
41	2003	Some RSA-based Encryption Schemes with Tight Security Reduction	eprint	online
42	2003	OMAC: One-Key CBC MAC	fse	online
43	2003	Efficient Public Key Steganography Secure Against Adaptively Chosen Stegotext Attacks	eprint	online
44	2002	Non-cryptographic Primitive for Pseudorandom Permutation	fse	online
45	2002	Bounds for Robust Metering Schemes and Their Relationship with A-code	asiacrypt	online
46	2002	TMAC: Two-Key CBC MAC	eprint	online
47	2002	Multi-recipient Public-Key Encryption with Shortened Ciphertext	pkc	48-63
48	2002	Linear Code Implies Public-Key Traitor Tracing	pkc	172-187
49	2002	New covering radius of Reed-Muller codes for $t$-resilient functions	eprint	online
50	2002	Power of a Public Random Permutation and its Application to Authenticated-Encryption	eprint	online
51	2002	OMAC: One-Key CBC MAC	eprint	online
52	2002	Oblivious Keyword Search	eprint	online
53	2002	Bit-Slice Auction Circuit	eprint	online
54	2001	Round Security and Super-Pseudorandomness of MISTY Type Structure	fse	233-247
55	2001	IND-CCA Public Key Schemes Equivalent to Factoring n=pq	pkc	36-47
56	2001	Almost k-Wise Independent Sample Spaces and Their Cryptologic Applications	jofc	231-253
57	2001	Multi-Recipient Public-Key Encryption with Shortened Ciphertext	eprint	online
58	2001	Linear Code Implies Public-Key Traitor Tracing	eprint	online
59	2000	Provably Secure Metering Scheme	asiacrypt	388-398
60	2000	On the Pseudorandomness of the AES Finalists - RC6 and Serpent	fse	231-243
61	2000	How to Encrypt Long Messages without Large Size Symmetric/Asymmetric Encryption Schemes	eprint	online
62	2000	Attack for Flash MIX	asiacrypt	192-204
63	2000	How to Break a Practical MIX and Design a New One	eurocrypt	557-572
64	1999	On a Fallacious Bound for Authentication Codes	jofc	155-159
65	1999	Probabilistic Higher Order Differential Attack and Higher Order Bent Functions	asiacrypt	62-74
66	1999	On Cryptographically Secure Vectorial Boolean Functions	asiacrypt	20-28
67	1998	Some Bounds and a Construction for Secure Broadcast Encryption	asiacrypt	420-433
68	1998	Optimum Traitor Tracing and Asymmetric Schemes	eurocrypt	145-157
69	1997	Almost k-wise Independent Sample Spaces and Their Cryptologic Applications	eurocrypt	409-421
70	1997	Design of SAC/PC(l) of Order k Boolean Functions and Three Other Cryptographic Criteria	eurocrypt	434-449
71	1996	Generalization of Higher Order SAC to Vector Output Boolean Functions	asiacrypt	218-231
72	1996	Optimum Secret Sharing Scheme Secure against Cheating	eurocrypt	200-211
73	1995	t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes	crypto	410-423
74	1995	Combinatorial Bounds for Authentication Codes with Arbitration	eurocrypt	289-300
75	1994	Combinatorial Interpretation of Secret Sharing Schemes	asiacrypt	55-64
76	1994	Security of the Center in Key Distribution Schemes	asiacrypt	333-341
77	1994	Low Exponent Attack against Elliptic Curve RSA	asiacrypt	376-383
78	1994	Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes	asiacrypt	33-41
79	1994	New Bound on Authentication Code with Arbitration	crypto	140-149
80	1993	Efficient Anonymous Channel and All/Nothing Election Scheme	eurocrypt	248-259
81	1993	On Key Distribution and Authentication in Mobile Radio Networks	eurocrypt	461-465
82	1993	Nonperfect Secret Sharing Schemes and Matroids	eurocrypt	126-141
83	1992	Nonperfect Secret Sharing Schemes	auscrypt	56-66
84	1992	Privacy for Multi-Party Protocols	auscrypt	252-260
85	1991	On Claw Free Families	asiacrypt	111-123
86	1991	4 Move Perfect ZKIP of Knowledge with No Assumption	asiacrypt	321-330
87	1990	Multi-Language Zero Knowledge Interactive Proof Systems	crypto	339-352
88	1990	General Public Key Residue Cryptosystems and Mental Poker Protocols	eurocrypt	374-388

Kaoru Kurosawa Search web for home page

Program Committees

Publications

Coauthors of Kaoru Kurosawa