安全加密的门限签名混淆

doi:10.11959/j.issn.1000-436x.2020129

Journal on Communications ›› 2020, Vol. 41 ›› Issue (6): 61-69.doi: 10.11959/j.issn.1000-436x.2020129

• Papers • Previous Articles Next Articles

Secure obfuscation for encrypted threshold signatures

Yahong LI¹,Caifen WANG^2,³,Yulei ZHANG²,Xiaodong YANG²,Haiyan HUANG¹

¹ College of Telecommunication Engineering,Lanzhou Jiaotong University,Lanzhou 730070,China
² College of Computer Science and Engineering,Northwest Normal University,Lanzhou 730070,China
³ College of Big Data and Internet,Shenzhen Technology University,Shenzhen 518118,China

Revised:2020-04-02 Online:2020-06-25 Published:2020-07-04
Supported by:
The National Natural Science Foundation of China(61063041);The National Natural Science Foundation of China(61901201);The Youth Science Foundation of Lanzhou Jiaotong University(2018002)

Abstract

Abstract:

Aiming at the key leakage security problem of the threshold signature,an encrypted threshold signature functionality was firstly proposed and securely obfuscated.The output of obfuscated circuit could be implemented by any third party without revealing the private key of threshold signature.Secondly,the security models of encrypted threshold signature functionality and the obfuscator were defined,such as the existential unforgeablity and the average case virtual black box property,and its correctness and security were proved.The analyses of theory and simulation experiment show that the obfuscation for encrypted threshold signature has feasibility.

Key words: obfuscation, encrypted threshold signature, encrypted private key, average case virtual black box property

CLC Number:

TP309

Yahong LI,Caifen WANG,Yulei ZHANG,Xiaodong YANG,Haiyan HUANG. Secure obfuscation for encrypted threshold signatures[J]. Journal on Communications, 2020, 41(6): 61-69.

Figures/Tables 3

空间	运算	Setup	${ETS}_{p, S K, p k_{e}}$	Obf _ETS	$R_{p, z, {pk}_{e}}$
	Rand	k	n+ 4	2n	n+ 4
Z_q	Add	(n+1)(k-1)	2	2n	2k
	Mult	$\frac{(n + 1) k (k - 1)}{2}$	0	0	2k
	Rand	n+ 2	0	0	0
G	Mult	0	2k+n+1	n+ 1	4k+n+1
	Exp	2n+1	2n+2k+6	3n+1	2n+4k+6
G_T	Mult	0	1	0	1
e :G × G→G_T	Pair	0	3	0	3

References 20

[1]	DESMEDT Y , . Threshold cryptosystems[C]// Advances in Cryptology-CRYPTO'89. Berlin:Springer, 1989: 1-14.
[2]	YANG W , LUO W , LUO X ,et al. Fully distributed certificateless threshold signature without random oracles[J]. Science China(Information Sciences), 2018,61(9): 259-269.
[3]	张艳硕, 李文敬, 陈雷 ,等. 基于特征值的可验证特殊门限秘密共享方案[J]. 通信学报, 2018,39(8): 169-175.
	ZHANG Y S , LI W J , CHEN L ,et al. Verifiable special threshold secret sharing scheme based on eigenvalue[J]. Journal on Communications, 2018,39(8): 169-175.
[4]	LIBERT B , YUNG M . Adaptively secure non-interactive threshold cryptosystems[C]// International Conference on Automata. Berlin:Springer, 2011: 588-600.
[5]	ZHOU G , ZENG P , YUAN X ,et al. An efficient code-based threshold ring signature scheme with a leader-participant model[J]. Security ＆Communication Networks,2017, 2017:1.
[6]	LI J , YUEN T H , KIM K . Practical threshold signatures without random oracles[C]// International Conference on Provable Security. Berlin:Springer, 2007: 198-207.
[7]	陈立全, 朱政, 王慕阳 ,等. 适用于移动互联网的门限群签名方案[J]. 计算机学报, 2018,41(5): 86-101.
	CHEN L Q , ZHU Z , WANG M Y ,et al. A threshold group signature scheme for mobile Internet application[J]. Chinese Journal of Computers, 2018,41(5): 86-101.
[8]	任艳丽, 徐丹婷, 张新鹏 ,等. 基于门限环签名的可删除区块链[J]. 通信学报, 2019,40(4): 75-86.
	REN Y L , XU D T , ZHANG X P ,et al. Deletable blockchain based on threshold ring signature[J]. Journal on Communications, 2019,40(4): 75-86.
[9]	徐明, 李旭如, 刘朝斌 ,等. 基于双重代理密钥的船舶自组网门限签名方案[J]. 通信学报, 2018,39(7): 170-179.
	XU M , LI X R , LIU C B ,et al. Dual-proxy key-based threshold signature scheme for ship ad-hoc network[J]. Journal on Communications, 2018,39(7): 170-179.
[10]	MOWBRAY M , PEARSON S , SHEN Y . Enhancing privacy in cloud computing via policy-based obfuscation[J]. Journal of Supercomputing, 2012,61(2): 267-291.
[11]	SHI Y , ZHANG Q , LIANG J W ,et al. Obfuscatable anonymous authentication scheme for mobile crowd sensing[J]. IEEE Systems Journal, 2018,PP(99): 1-12.
[12]	BARAK B , GOLDREICH O , IMPSGLIAZZO R ,et al. On the (im)possibility of obfuscating programs[J]. Lecture Notes in Computer Science, 2001,2139(2): 1-18.
[13]	HOHENBERGER S , ROTHBLUM G N , SHELAT A ,et al. Securely obfuscating re-encryption[M]. Berlin: SpringerPress, 2007.
[14]	HADA S , . Secure obfuscation for encrypted signatures[C]// International Conference on Theory ＆ Applications of Cryptographic Techniques. Berlin:Springer, 2010: 92-112.
[15]	WATERS B , . Efficient identity-based encryption without random oracles[C]// International Conference on the Theory ＆ Applications of Cryptographic Techniques. Berlin:Springer, 2005: 14-127.
[16]	BONEH D , BOYEN X , SHACHAM H . Short group signatures[C]// 24th Annual International Cryptology Conference. Springer Berlin, 2004: 41-55.
[17]	SHI Y , ZHAO Q P , FAN H F ,et al. Secure obfuscation for encrypted group signatures[J]. Plos One, 2015,10(7):1.
[18]	陈兴发, 高崇志, 姚正安 ,等. 安全加密的环签名混淆器[J]. 中山大学学报(自然科学版), 2014,53(1): 8-17.
	CHEN X F , GAO C Z , YAO Z A ,et al. Secure obfuscation for encrypted ring signatures[J]. Acta Scientiarum Naturalium Universitatis Sunyatseni, 2014,53(1): 8-17.
[19]	SHI Y , HAN J X , FAN H F ,et al. Protecting encrypted signature functions against intrusions on computing devices by obfuscation[J]. IEEE Access, 2016,4: 6401-6415.
[20]	TAKAGI T , OKAMOTO T , OKAMOTO E ,et al. Pairing-based cryptography–pairing 2007[M]. Berlin: SpringerPress, 2007.

Metrics

Recommended 0

No Suggested Reading articles found!

Secure obfuscation for encrypted threshold signatures

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 3

References 20

Related Articles 2

Metrics

Recommended 0

[1]	Yongjin HU,Yuanbo GUO,Jun MA,Han ZHANG,Xiuqing MAO. Method to generate cyber deception traffic based on adversarial sample [J]. Journal on Communications, 2020, 41(9): 59-70.
[2]	Shaobo ZHANG,Qin LIU,Guojun WANG. Trajectory privacy protection method based on location obfuscation [J]. Journal on Communications, 2018, 39(7): 81-91.