中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
题名:
Noninteractive Zero-Knowledge
作者: Manuel Blum ; Alfredo De Santis ; Silvio Micali ; Giuseppe Persiano
刊名: SIAM Journal on Computing
发表日期: 1991
卷: 20, 期:6, 页:1084-1118
收录类别: 其他
合作性质: 其它
英文摘要: This paper investigates the possibility of disposing of interaction between prover and verifier in a zero-knowledge proof if they share beforehand a short random string.Without any assumption, it is proven that noninteractive zero-knowledge proofs exist for some number-theoretic languages for which no efficient algorithm is known.If deciding quadratic residuosity (modulo composite integers whose factorization is not known) is computationally hard, it is shown that the NP-complete language of satisfiability also possesses noninteractive zero-knowledge proofs.
语种: 英语
内容类型: 期刊论文
URI标识: http://ir.iscas.ac.cn/handle/311060/1313
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:
File Name/ File Size Content Type Version Access License
bj01132981.pdf(2456KB)----限制开放 联系获取全文

Recommended Citation:
Manuel Blum,Alfredo De Santis,Silvio Micali,et al. Noninteractive Zero-Knowledge[J]. SIAM Journal on Computing,1991-01-01,20(6):1084-1118.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Manuel Blum]'s Articles
[Alfredo De Santis]'s Articles
[Silvio Micali]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Manuel Blum]‘s Articles
[Alfredo De Santis]‘s Articles
[Silvio Micali]‘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