Some Constant-Round Zero-Knowledge Protocols

The concept of zero-knowledge has been extensively used in the design of cryptographic protocols since being introduced. The round complexity of zeroknowledge protocols is a very important efficiency consideration, and in general it is desirable to have zeroknowledge protocols with constant numbers...

Full description

Saved in:
Bibliographic Details
Published in:电子学报：英文版 2010 (1), p.7-12
Main Author: LIU Hanwu LIN Dongdai
Format: Article
Language:English
Subjects:
复杂性
密码协议
零知识
验证程序
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 12
container_issue 1
container_start_page 7
container_title 电子学报：英文版
container_volume
creator LIU Hanwu LIN Dongdai
description The concept of zero-knowledge has been extensively used in the design of cryptographic protocols since being introduced. The round complexity of zeroknowledge protocols is a very important efficiency consideration, and in general it is desirable to have zeroknowledge protocols with constant numbers of rounds. In this paper, we suggest a novel method to use the program of the verifier and use the method to construct some constant round honest-verifier zero-knowledge protocols. The notion of honest-verifier zero-knowledge protocols is highly non-trivial and fascinating itself. It also has many other uses.
format article
fullrecord <record><control><sourceid>chongqing</sourceid><recordid>TN_cdi_chongqing_backfile_37118609</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cqvip_id>37118609</cqvip_id><sourcerecordid>37118609</sourcerecordid><originalsourceid>FETCH-LOGICAL-c182t-dca7a0e5678b8a2b628392f4841e40f736139e9e9f3cf4426871e13c52f82de03</originalsourceid><addsrcrecordid>eNotzMtKxDAUgOEsRnAY5x2KawM556RJupTiDQeUuWzcDGl6UsvUBCcVX19B-Rff7l-IJShEqU1Nl2JdytgpZayqAXApbnb5g6s2pzL7NMtt_kp99cbnLJ9T_p64H7h6Pec5hzyVK3ER_VR4_e9KHO7v9u2j3Lw8PLW3GxnA4Sz74K1XXBvrOuexM-iowaidBtYqWjJADf8WKUSt0TgLDBRqjA57VrQS13_f8J7T8Dmm4dj5cIrjxEeyAM6ohn4AQ8w8sg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Some Constant-Round Zero-Knowledge Protocols</title><source>IEEE Xplore All Journals</source><creator>LIU Hanwu LIN Dongdai</creator><creatorcontrib>LIU Hanwu LIN Dongdai</creatorcontrib><description>The concept of zero-knowledge has been extensively used in the design of cryptographic protocols since being introduced. The round complexity of zeroknowledge protocols is a very important efficiency consideration, and in general it is desirable to have zeroknowledge protocols with constant numbers of rounds. In this paper, we suggest a novel method to use the program of the verifier and use the method to construct some constant round honest-verifier zero-knowledge protocols. The notion of honest-verifier zero-knowledge protocols is highly non-trivial and fascinating itself. It also has many other uses.</description><identifier>ISSN: 1022-4653</identifier><language>eng</language><subject>复杂性 ; 密码协议 ; 零知识 ; 验证程序</subject><ispartof>电子学报：英文版, 2010 (1), p.7-12</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://image.cqvip.com/vip1000/qk/86774X/86774X.jpg</thumbnail><link.rule.ids>314,780,784,4021</link.rule.ids></links><search><creatorcontrib>LIU Hanwu LIN Dongdai</creatorcontrib><title>Some Constant-Round Zero-Knowledge Protocols</title><title>电子学报：英文版</title><addtitle>Chinese of Journal Electronics</addtitle><description>The concept of zero-knowledge has been extensively used in the design of cryptographic protocols since being introduced. The round complexity of zeroknowledge protocols is a very important efficiency consideration, and in general it is desirable to have zeroknowledge protocols with constant numbers of rounds. In this paper, we suggest a novel method to use the program of the verifier and use the method to construct some constant round honest-verifier zero-knowledge protocols. The notion of honest-verifier zero-knowledge protocols is highly non-trivial and fascinating itself. It also has many other uses.</description><subject>复杂性</subject><subject>密码协议</subject><subject>零知识</subject><subject>验证程序</subject><issn>1022-4653</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><recordid>eNotzMtKxDAUgOEsRnAY5x2KawM556RJupTiDQeUuWzcDGl6UsvUBCcVX19B-Rff7l-IJShEqU1Nl2JdytgpZayqAXApbnb5g6s2pzL7NMtt_kp99cbnLJ9T_p64H7h6Pec5hzyVK3ER_VR4_e9KHO7v9u2j3Lw8PLW3GxnA4Sz74K1XXBvrOuexM-iowaidBtYqWjJADf8WKUSt0TgLDBRqjA57VrQS13_f8J7T8Dmm4dj5cIrjxEeyAM6ohn4AQ8w8sg</recordid><startdate>2010</startdate><enddate>2010</enddate><creator>LIU Hanwu LIN Dongdai</creator><scope>2RA</scope><scope>92L</scope><scope>CQIGP</scope><scope>W92</scope><scope>~WA</scope></search><sort><creationdate>2010</creationdate><title>Some Constant-Round Zero-Knowledge Protocols</title><author>LIU Hanwu LIN Dongdai</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c182t-dca7a0e5678b8a2b628392f4841e40f736139e9e9f3cf4426871e13c52f82de03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>复杂性</topic><topic>密码协议</topic><topic>零知识</topic><topic>验证程序</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>LIU Hanwu LIN Dongdai</creatorcontrib><collection>维普_期刊</collection><collection>中文科技期刊数据库-CALIS站点</collection><collection>维普中文期刊数据库</collection><collection>中文科技期刊数据库-工程技术</collection><collection>中文科技期刊数据库- 镜像站点</collection><jtitle>电子学报：英文版</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>LIU Hanwu LIN Dongdai</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Some Constant-Round Zero-Knowledge Protocols</atitle><jtitle>电子学报：英文版</jtitle><addtitle>Chinese of Journal Electronics</addtitle><date>2010</date><risdate>2010</risdate><issue>1</issue><spage>7</spage><epage>12</epage><pages>7-12</pages><issn>1022-4653</issn><abstract>The concept of zero-knowledge has been extensively used in the design of cryptographic protocols since being introduced. The round complexity of zeroknowledge protocols is a very important efficiency consideration, and in general it is desirable to have zeroknowledge protocols with constant numbers of rounds. In this paper, we suggest a novel method to use the program of the verifier and use the method to construct some constant round honest-verifier zero-knowledge protocols. The notion of honest-verifier zero-knowledge protocols is highly non-trivial and fascinating itself. It also has many other uses.</abstract><tpages>6</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1022-4653
ispartof 电子学报：英文版, 2010 (1), p.7-12
issn 1022-4653
language eng
recordid cdi_chongqing_backfile_37118609
source IEEE Xplore All Journals
subjects 复杂性
密码协议
零知识
验证程序
title Some Constant-Round Zero-Knowledge Protocols
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T13%3A58%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-chongqing&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Some%20Constant-Round%20Zero-Knowledge%20Protocols&rft.jtitle=%E7%94%B5%E5%AD%90%E5%AD%A6%E6%8A%A5%EF%BC%9A%E8%8B%B1%E6%96%87%E7%89%88&rft.au=LIU%20Hanwu%20LIN%20Dongdai&rft.date=2010&rft.issue=1&rft.spage=7&rft.epage=12&rft.pages=7-12&rft.issn=1022-4653&rft_id=info:doi/&rft_dat=%3Cchongqing%3E37118609%3C/chongqing%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c182t-dca7a0e5678b8a2b628392f4841e40f736139e9e9f3cf4426871e13c52f82de03%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_cqvip_id=37118609&rfr_iscdi=true