Search For:

Displaying 1-4 out of 4 total
On Homomorphic Signatures for Network Coding
Found in: IEEE Transactions on Computers
By Aaram Yun, Jung Hee Cheon, Yongdae Kim
Issue Date:September 2010
pp. 1295-1296
In this paper, we examine homomorphic signatures that can be used to protect the integrity of network coding. In particular, Yu et al. proposed an RSA-based homomorphic signature scheme recently for this purpose. We show that their scheme in fact does not ...
Use of Sparse and/or Complex Exponents in Batch Verification of Exponentiations
Found in: IEEE Transactions on Computers
By Jung Hee Cheon, Dong Hoon Lee
Issue Date:December 2006
pp. 1536-1542
Modular exponentiation in an abelian group is one of the most frequently used mathematical primitives in modern cryptography. Batch verification is an algorithm for verifying many exponentiations simultaneously. We propose two fast batch verification algor...
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Found in: Proceedings of the 15th ACM conference on Computer and communications security (CCS '08)
By Ali Bagherzandi, Jung-Hee Cheon, Stanislaw Jarecki
Issue Date:October 2008
pp. 79-79
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups with bilinear maps, by Boneh et al, and by a three-round protocol under the D...
New broadcast encryption scheme using tree-based circle
Found in: Proceedings of the 5th ACM workshop on Digital rights management (DRM '05)
By Eun Sun Yoo, Jung Hee Cheon, Myung-Hwan Kim, Nam-Su Jho
Issue Date:November 2005
pp. 37-44
Since broadcast encryption was first introduced in 1993 by Fiat and Naor, many broadcast encryption schemes have been developed. Among these, schemes based on tree structure and linear structure are notable. The subset difference (SD) scheme and layered su...