摘要
提出了一种新的基于大整数分解困难问题的叛逆者追踪方案。该方案的主要思想是构造两个特殊的参数A1,A2,与用户i对应的一对值(ai1,ai2)满足ai1+ai2=hmod(Ф(N)),其中h为一常数,欧拉函数(ФN)=(p-1)(q-1),解密时利用参数A1,A2和用户的私钥即可获得h。与现有两种方案相比,新方案具有黑盒子追踪、密文长度是常量、增加用户或撤消用户以及前向安全性和后向安全性等优点。
A traitor tracing scheme on LIFP(large integer factoring problem)is proposed, the essential idea of which is that two special parameters A1 ,A2 are constructed,a pair (ail ,ai2 ) with respect to user i satisfiesaia+ai2=h mod(φ (N) ), where h is a constant, φ(N)= (p-1)( q-1 ) is Euler Function. In decryption procedure, h can be obtained by parameters A1 ,A2 and user's private key. Compared with the existing two traitor tracing schemes, this scheme has many advantages such as black-box traitor tracing, ciphertexts of constant size, adding or revoking users, forward security and backward security.
出处
《计算机科学》
CSCD
北大核心
2006年第7期131-133,共3页
Computer Science
基金
国家自然科学基金资助项目(60372046)
华为基金资助项目(YSCB2005037NP)。