Institutional Repository
| zero-knowledge argument for simultaneous discrete logarithms | |
| Chow Sherman S. M.; Ma Changshe; Weng Jian | |
| 2010 | |
| Conference Name | 16th Annual International Computing and Combinatorics Conference, COCOON 2010 |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 520-529 |
| Conference Date | 37456 |
| Conference Place | Nha Trang, Viet nam |
| Indexed Type | ei,springer |
| Publish Place | Germany |
| ISSN | 3029743 |
| ISBN | 3642140300 |
| Department | (1) Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, NY 10012, United States; (2) School of Computer, South China Normal University, Guangzhou 510631, China; (3) Department of Computer Science, Jinan University, Guangzhou 510632, China; (4) State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (5) State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China |
| English Abstract | 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. |
| Keyword | Cryptography |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/8972 |
| Collection | 2010软件所会议论文 |
| Recommended Citation GB/T 7714 | Chow Sherman S. M.,Ma Changshe,Weng Jian. zero-knowledge argument for simultaneous discrete logarithms[C]. Germany,2010:520-529. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| zero-knowledge argum（212KB） | 限制开放 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment