Public-key traitor tracing from efficient decoding and unbounded enrollment: extended abstract
Abstract
References
Index Terms
- Public-key traitor tracing from efficient decoding and unbounded enrollment: extended abstract
Recommendations
New traitor tracing schemes using bilinear map
DRM '03: Proceedings of the 3rd ACM workshop on Digital rights managementMitsunari et al [15] presented a new traitor tracing scheme which uses Weil pairing in elliptic curves. To the best of our knowledge this is the first scheme that uses bilinear map. The claimed advantage of the scheme is that the ciphertext size is ...
Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
In this work, we show how to use indistinguishability obfuscation to build multiparty key exchange, efficient broadcast encryption, and efficient traitor tracing. Our schemes enjoy several interesting properties that have not been achievable before:Our ...
Further analysis of pairing-based traitor tracing schemes for broadcast encryption
Pairing-based public key systems have recently received much attention because bilinear property contributes to the designs of many cryptographic schemes. In 2002, Mitsunari et al. proposed the first pairing-based traitor tracing scheme with constant-...
Comments
Information & Contributors
Information
Published In
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Upcoming Conference
- Sponsor:
- sigsac
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 247Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in