中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 2010软件所会议论文
题名:
zero-knowledge argument for simultaneous discrete logarithms
作者: Chow Sherman S. M. ; Ma Changshe ; Weng Jian
会议文集: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
会议名称: 16th Annual International Computing and Combinatorics Conference, COCOON 2010
会议日期: 37456
出版日期: 2010
会议地点: Nha Trang, Viet nam
关键词: Cryptography
出版地: Germany
收录类别: ei,springer
ISSN: 3029743
ISBN: 3642140300
部门归属: (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
英文摘要: 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.
语种: 英语
内容类型: 会议论文
URI标识: http://ir.iscas.ac.cn/handle/311060/8972
Appears in Collections:中科院软件所图书馆_2010软件所会议论文

Files in This Item:
File Name/ File Size Content Type Version Access License
zero-knowledge argument for simultaneous discrete logarithms.pdf(212KB)----限制开放-- 联系获取全文

Recommended Citation:
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.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Chow Sherman S. M.]'s Articles
[Ma Changshe]'s Articles
[Weng Jian]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Chow Sherman S. M.]‘s Articles
[Ma Changshe]‘s Articles
[Weng Jian]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2017  中国科学院软件研究所 - Feedback
Powered by CSpace