Privacy-enhanced content distribution and charging scheme using group signature

Authors:
Takayuki Tobita;Hironori Yamamoto;Hiroshi Doi;Keigo Majima
Affiliations:
Institute of Information Security, Yokohama, Kanagawa, Japan and NEC Soft, Ltd., Tokyo, Japan;The University of Chuo, Tokyo, Japan;Institute of Information Security, Yokohama, Kanagawa, Japan;NHK Science and Technical Research Laboratories, Tokyo, Japan
Venue:
WISA'06 Proceedings of the 7th international conference on Information security applications: PartI
Year:
2006

Citing 10
Cited 0

Oblivious transfer and polynomial evaluation

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Efficient Group Signature Schemes for Large Groups (Extended Abstract)

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
1-out-of-n Signatures from a Variety of Keys

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The Decision Diffie-Hellman Problem

ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Oblivious keyword search

Journal of Complexity - Special issue on coding and cryptography
A secure and optimally efficient multi-authority election scheme

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Collision-free accumulators and fail-stop signature schemes without trees

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Efficient proofs that a committed number lies in an interval

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

As the broadband IP networks have spread rapidly, the number of users of content distribution services has grown. In these services, it is desirable that the user's usage history and their preferences provided are kept confidential in order to protect their privacy. On the other hand, the usage charges need to be calculated correctly based on the contents received by the user. In the above situation, it is not desirable to charge the user at the instant he or she receives it because the usage history can be deduced from the price of each content. In this paper, we propose a generic scheme for content distribution and charging; this scheme that satisfies this privacy requirement by keeping the usage history confidential. Furthermore, we present a new construction based on the group signature proposed by Ateniese et al. In this construction, the computation and communication costs depend only on the number of contents purchased and not on the total number of available content.