• What's new
• Archive
• Best Papers
• Videos
• Authors
• Coauthors
• By year
• By conference
• All Committees
• Most Committees
• Report errors
• Maps
• About

Jung Hee Cheon  Search web for home page

Program Committees

Publications

	year	title	booktitle	pages
1	2012	Constant-Round Multi-party Private Set Union Using Reversed Laurent Series	pkc	398-412
2	2012	Beyond the Limitation of Prime-Order Bilinear Groups, and Round Optimal Blind Signatures	tcc	133-150
3	2010	Discrete Logarithm Problems with Auxiliary Inputs	jofc	457-476
4	2009	Subset-Restricted Random Walks for Pollard rho Method on Fpm	pkc	54-67
5	2009	Reducing RFID Reader Load with the Meet-in-the-Middle Strategy	eprint	online
6	2008	A Parameterized Splitting System and Its Application to the Discrete Logarithm Problem with Low Hamming Weight Product Exponents	pkc	328-343
7	2008	Speeding Up the Pollard Rho Method on Prime Fields	asiacrypt	471-488
8	2007	Fast Batch Verification of Multiple Signatures	pkc	442-457
9	2006	Security Analysis of the Strong Diffie-Hellman Problem	eurocrypt	online
10	2006	Analysis of Privacy-Preserving Element Reduction of Multiset	eprint	online
11	2005	Use of Sparse and/or Complex Exponents in Batch Verification of Exponentiations	eprint	online
12	2005	One-Way Chain Based Broadcast Encryption Schemes	eurocrypt	online
13	2005	BROADCAST ENCRYPTION $\pi$	eprint	online
14	2005	Skipping, Cascade, and Combined Chain Schemes for Broadcast Encryption	eprint	online
15	2004	A New ID-based Signature with Batch Verification	eprint	online
16	2004	Timed-Release and Key-Insulated Public Key Encryption	eprint	online
17	2004	Resistance of S-Boxes against Algebraic Attacks	fse	83-94
18	2003	An Identity-Based Signature from Gap Diffie-Hellman Groups	pkc	18-30
19	2003	A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem	crypto	online
20	2003	A Cryptanalysis of the Original Domingo-Ferrer's Algebraic Privacy Homomophism	eprint	online
21	2003	A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem	eprint	online
22	2002	An Identity-Based Signature from Gap Diffie-Hellman Groups	eprint	online
23	2002	A Universal Forgery of Hess's Second ID-based Signature against the Known-message Attack	eprint	online
24	2002	Diffie-Hellman Problems and Bilinear Maps	eprint	online
25	2001	An Efficient Implementation of Braid Groups	asiacrypt	144-156
26	2001	Nonlinear Vector Resilient Functions	crypto	458-469
27	2000	New Public-Key Cryptosystem Using Braid Groups	crypto	166-183
28	1999	S-boxes with Controllable Nonlinearity	eurocrypt	286-294
29	1998	Two Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map	pkc	195-202