zero-knowledge argument for simultaneous discrete logarithms

CORC > 软件研究所 > 软件所图书馆 > 2010软件所会议论文

	zero-knowledge argument for simultaneous discrete logarithms
	Chow Sherman S. M. ; Ma Changshe ; Weng Jian
	2010
会议名称	16th Annual International Computing and Combinatorics Conference, COCOON 2010
会议日期	37456
会议地点	Nha Trang, Viet nam
关键词	Cryptography
页码	520-529
英文摘要	In Crypto92, Chaum and Pedersen introduced a widely-used protocol (CP protocol for short) for proving the equality of two discrete logarithms (EQDL) with unconditional soundness, which plays a central role in DL-based cryptography. Somewhat surprisingly, the CP protocol has never been improved for nearly two decades since its advent. We note that the CP protocol is usually used as a non-interactive proof by using the Fiat-Shamir heuristic, which inevitably relies on the random oracle model (ROM) and assumes that the adversary is computationally bounded. In this paper, we present an EQDL protocol in the ROM which saves &asyum;40% of the computational cost and &asyum;33% of the provers uploading bandwidth. Our idea can be naturally extended for simultaneously showing the equality of n discrete logarithms with O(1)-size commitment, in contrast to the n-element adaption of the CP protocol which requires O(n)-size. This improvement benefits a variety of interesting cryptosystems, ranging from signatures and anonymous credential systems, to verifiable secret sharing and threshold cryptosystems. As an example, we present a signature scheme that only takes one (offline) exponentiation to sign, without utilizing pairing, relying on the standard decisional Diffie-Hellman assumption. © 2010 Springer-Verlag Berlin Heidelberg.
收录类别	EI,SPRINGER
会议录	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
会议录出版地	Germany
语种	英语
ISSN号	3029743
ISBN号	3642140300
内容类型	会议论文
源URL	[http://124.16.136.157/handle/311060/8972]
专题	软件研究所_软件所图书馆_2010软件所会议论文
推荐引用方式 GB/T 7714	Chow Sherman S. M.,Ma Changshe,Weng Jian. zero-knowledge argument for simultaneous discrete logarithms[C]. 见:16th Annual International Computing and Combinatorics Conference, COCOON 2010. Nha Trang, Viet nam. 37456.