Trace and revoke systems with short ciphertexts

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Trace and revoke systems with short ciphertexts

Full text

Pdf (354 KB)

Source

International Conference on Security of Information and Networks archive
Proceedings of the 2nd international conference on Security of information and networks table of contents

Famagusta, North Cyprus

SESSION: SI.1 SI: security and integrity management and models table of contents

Pages 61-66

Year of Publication: 2009

ISBN:978-1-60558-412-6

Authors

Lie Liu	Graduate School at Shenzhen, Tsinghua University, Shenzhen, China
Chun Yuan	Graduate School at Shenzhen, Tsinghua University, Shenzhen, China

Sponsor

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 11, Downloads (12 Months): 11, Citation Count: 0

Additional Information:

abstract references index terms

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1626195.1626212 What is a DOI?

ABSTRACT

Trace and revoke systems are motivated by content protection on various platforms such as DVD players, satellite radio receivers and PCs, which provide both broadcast encryption and traitor tracing mechanisms. So far, the best existing system requires ciphertext size sub-linear in the number of users. In communications, as system scale increases, it brings up a high bandwidth requirement which cannot be satisfied by current network condition. In this paper, we present a new fully collusion resistant trace and revoke system which has only constant size ciphertexts. The system is CPA secure against static adversaries with public broadcast key and secret tracing key. It can be efficiently applied in DRM fields where network bandwidth is limited.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	S. Berkovits. How to broadcast a secret. In AdAdvances in Cryptology -- EUROCRYPT '91, pages 535--541. Springer-Verlag, 1991.
	2	D. Boneh, X. Boyen, and E.-J. Goh. Hierarchical identity based encryption with constant size ciphertext. In Proceedings of Eurocrypt '05, pages 440--456. Springer-Verlag, 2005.
	3	D. Boneh, C. Gentry, and B. Waters. Collusion resistant broadcast encryption with short ciphertexts and private keys. In Proceedings of Crypto '05, pages 258--275. Springer-Verlag, 2005.
	4	D. Boneh and M. Naor. Traitor tracing with constant size ciphertext. http://crypto.stanford.edu/~dabo/abstracts/consttt.html, February 2008.
	5	D. Boneh, A. Sahai, and B. Waters. Fully collusion resistant traitor tracing with short ciphertexts and private keys. In Proceedings of Eurocrypt '06, pages 573--592. Springer-Verlag, 2006.
	6	D. Boneh and J. Shaw. Collusion-secure fingerprinting for digital data. In Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology, pages 452--465. Springer-Verlag, 1995.
	7	D. Boneh and B. Waters. A fully collusion resistant broadcast, trace, and revoke system. In Proceedings of the 13th ACM Conference on Computer and Communications Security, pages 211--220. ACM, 2006.
	8	B. Chor, A. Fiat, M. Naor, and B. Pinkas. Tracing traitors. In Proceedings of Crypto '94, pages 257--270. Springer-Verlag, 1994.
	9	Y. Dodis and N. Fazio. Public key broadcast encryption for stateless receivers. In Proceedings of the Digital Rights Management Workshop 2002, pages 61--80. Springer-Verlag, 2002.
	10	A. Fiat and M. Naor. Broadcast encryption. In Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology, pages 480--491. Springer-Verlag, 1994.
	11	G. Frey, M. Muller, and H.-G. Ruck. The tate pairing and the discrete logarithm applied to elliptic curve cryptosystems. Information Theory, IEEE Transactions on, 45:1717--1719, July 1999.
	12	D. Halevy and A. Shamir. The lsd broadcast encryption scheme. In Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology, pages 47--60. Springer-Verlag, 2002.
	13	A. Joux. The weil and tate pairings as building blocks for public key cryptosystems. In Proceedings of the 5th International Symposium on Algorithmic Number Theory, pages 20--32. Springer-Verlag, 2002.
	14	A. Menezes. An introduction to pairing-based cryptography. Contemporary Mathematics, 477:47--65, 2009.
	15	A.J. Menezes, T. Okamoto, and S.A. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. In Proceedings of the Twenty-third Annual ACM Symposium on Theory of Computing, pages 80--89. ACM, 1991.
	16	A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.
	17	D. Naor, M. Naor, and J. Lotspiech. Revocation and tracing schemes for stateless receivers. In Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology, pages 41--62. Springer-Verlag, 2001.
	18	M. Naor and B. Pinkas. Efficient trace and revoke schemes. In Proceedings of the 4th International Conference on Financial Cryptography, pages 1--20. Springer-Verlag, 2000.
	19	S.R. Subramanya and B.K. Yi. Digital rights management. Potentials, 25:31--34, 2006.
	20	G. Tardos. Optimal probabilistic fingerprint codes. Journal of the ACM (JACM), 55(10), May 2008.