中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 信息安全国家重点实验室  > 会议论文
Title:
statistically hiding sets
Author: Prabhakaran Manoj ; Xue Rui
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Conference Name: Cryptographers Track at the RSA Conference, CT-RSA 2009
Conference Date: April 20,
Issued Date: 2009
Conference Place: San Francisco, CA, United states
Keyword: Information theory
Publish Place: Germany
ISSN: 3029743
ISBN: 9783642008610
Department: (1) Dept. of Computer Science, University of Illinois, Urbana-Champaign; (2) State Key Laboratory of Information Security Institute of Software, Chinese Academy of Sciences
English Abstract: Zero-knowledge set is a primitive introduced by Micali, Rabin, and Kilian (FOCS 2003) which enables a prover to commit a set to a verifier, without revealing even the size of the set. Later the prover can give zero-knowledge proofs to convince the verifier of membership/nonmembership of elements in/not in the committed set. We present a new primitive called Statistically Hiding Sets (SHS), similar to zeroknowledge sets, but providing an information theoretic hiding guarantee, rather than one based on efficient simulation. Then we present a new scheme for statistically hiding sets, which does not fit into the "Merkletree/ mercurial-commitment" paradigm that has been used for all zeroknowledge set constructions so far. This not only provides efficiency gains compared to the best schemes in that paradigm, but also lets us provide statistical hiding; previous approaches required the prover to maintain growing amounts of state with each new proof for such a statistical security. Our construction is based on an algebraic tool called trapdoor DDH groups (TDG), introduced recently by Dent and Galbraith (ANTS 2006). However the specific hardness assumptions we associate with TDG are different, and of a strong nature - strong RSA and a knowledge-ofexponent assumption. Our new knowledge-of-exponent assumption may be of independent interest.We prove this assumption in the generic group model.
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/8500
Appears in Collections:信息安全国家重点实验室_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Prabhakaran Manoj,Xue Rui. statistically hiding sets[C]. 见:Cryptographers Track at the RSA Conference, CT-RSA 2009. San Francisco, CA, United states. April 20,.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Prabhakaran Manoj]'s Articles
[Xue Rui]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Prabhakaran Manoj]‘s Articles
[Xue Rui]‘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-2019  中国科学院软件研究所 - Feedback
Powered by CSpace