Efficient Concurrent npoly(logn)-Simulatable Argument of Knowledge View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2009

AUTHORS

Guifang Huang , Dongdai Lin , Yanshuo Zhang

ABSTRACT

In [16], Pass generalized the definition of zero knowledge proof and defined nO(σ(n))-simulatable proof which can be simulated by a simulator in nO(σ(n)) time. Assuming the existence of one-way permutation secure against sub-exponential circuits and 2-round perfect hiding commitment scheme, an efficient 4-round perfect npoly(logn)-simulatable argument of knowledge was presented there. In this paper, we construct an efficient concurrent npoly(logn)-simulatable argument of knowledge under more general assumption. The new scheme is 5-round and is based on the existence of one-way permutation secure against sub-exponential circuits. However, for the scheme in [16], if using ordinary Σ-protocol for the corresponding statement as sub-protocol, instead of Σ-protocol with honest verifier perfect zero knowledge, the resulting protocol is not necessarily closed under concurrent composition. More... »

PAGES

93-101

References to SciGraph publications

  • 2003-05-13. Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition in ADVANCES IN CRYPTOLOGY — EUROCRYPT 2003
  • 1994-12. Definitions and properties of zero-knowledge proof systems in JOURNAL OF CRYPTOLOGY
  • 2004. Lower Bounds for Concurrent Self Composition in THEORY OF CRYPTOGRAPHY
  • 2001-07-13. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols in ADVANCES IN CRYPTOLOGY — CRYPTO ’94
  • 2004. On the Possibility of One-Message Weak Zero-Knowledge in THEORY OF CRYPTOGRAPHY
  • Book

    TITLE

    Information Security Practice and Experience

    ISBN

    978-3-642-00842-9
    978-3-642-00843-6

    Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/978-3-642-00843-6_9

    DOI

    http://dx.doi.org/10.1007/978-3-642-00843-6_9

    DIMENSIONS

    https://app.dimensions.ai/details/publication/pub.1045088773


    Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
    Incoming Citations Browse incoming citations for this publication using opencitations.net

    JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "about": [
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0804", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Data Format", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Information and Computing Sciences", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "University of Chinese Academy of Sciences", 
              "id": "https://www.grid.ac/institutes/grid.410726.6", 
              "name": [
                "The State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, 100190, Beijing, P.R. China", 
                "Graduate University of Chinese Academy of Sciences, 100049, P.R. China"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Huang", 
            "givenName": "Guifang", 
            "id": "sg:person.015537351057.08", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015537351057.08"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "University of Chinese Academy of Sciences", 
              "id": "https://www.grid.ac/institutes/grid.410726.6", 
              "name": [
                "The State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, 100190, Beijing, P.R. China", 
                "Graduate University of Chinese Academy of Sciences, 100049, P.R. China"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Lin", 
            "givenName": "Dongdai", 
            "id": "sg:person.014134057755.58", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014134057755.58"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "name": [
                "Beijing Institute of Electronic Science and Technology, 100070, Beijing, P.R. China"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Zhang", 
            "givenName": "Yanshuo", 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/978-3-540-24638-1_12", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1001767230", 
              "https://doi.org/10.1007/978-3-540-24638-1_12"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0022-0000(88)90005-0", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1005992495"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/116825.116852", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1020345436"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-39200-9_10", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1028767322", 
              "https://doi.org/10.1007/3-540-39200-9_10"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-39200-9_10", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1028767322", 
              "https://doi.org/10.1007/3-540-39200-9_10"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-24638-1_7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1031013279", 
              "https://doi.org/10.1007/978-3-540-24638-1_7"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-24638-1_7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1031013279", 
              "https://doi.org/10.1007/978-3-540-24638-1_7"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/276698.276853", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1045093113"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf00195207", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1051079135", 
              "https://doi.org/10.1007/bf00195207"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf00195207", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1051079135", 
              "https://doi.org/10.1007/bf00195207"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48658-5_19", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1053299783", 
              "https://doi.org/10.1007/3-540-48658-5_19"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48658-5_19", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1053299783", 
              "https://doi.org/10.1007/3-540-48658-5_19"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1137/0218012", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1062842111"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1137/s0097539701392949", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1062879319"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1137/s0097539791220688", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1062879685"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/sfcs.2003.1238213", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1095425643"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1017/cbo9780511546891", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1098679363"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2009", 
        "datePublishedReg": "2009-01-01", 
        "description": "In [16], Pass generalized the definition of zero knowledge proof and defined nO(\u03c3(n))-simulatable proof which can be simulated by a simulator in nO(\u03c3(n)) time. Assuming the existence of one-way permutation secure against sub-exponential circuits and 2-round perfect hiding commitment scheme, an efficient 4-round perfect npoly(logn)-simulatable argument of knowledge was presented there. In this paper, we construct an efficient concurrent npoly(logn)-simulatable argument of knowledge under more general assumption. The new scheme is 5-round and is based on the existence of one-way permutation secure against sub-exponential circuits. However, for the scheme in [16], if using ordinary \u03a3-protocol for the corresponding statement as sub-protocol, instead of \u03a3-protocol with honest verifier perfect zero knowledge, the resulting protocol is not necessarily closed under concurrent composition.", 
        "editor": [
          {
            "familyName": "Bao", 
            "givenName": "Feng", 
            "type": "Person"
          }, 
          {
            "familyName": "Li", 
            "givenName": "Hui", 
            "type": "Person"
          }, 
          {
            "familyName": "Wang", 
            "givenName": "Guilin", 
            "type": "Person"
          }
        ], 
        "genre": "chapter", 
        "id": "sg:pub.10.1007/978-3-642-00843-6_9", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": false, 
        "isPartOf": {
          "isbn": [
            "978-3-642-00842-9", 
            "978-3-642-00843-6"
          ], 
          "name": "Information Security Practice and Experience", 
          "type": "Book"
        }, 
        "name": "Efficient Concurrent npoly(logn)-Simulatable Argument of Knowledge", 
        "pagination": "93-101", 
        "productId": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1045088773"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/978-3-642-00843-6_9"
            ]
          }, 
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "d6c5a63d59b1fdb877b33b02523ef378a85f0307fb937dd47dbdbd8973fc3d69"
            ]
          }
        ], 
        "publisher": {
          "location": "Berlin, Heidelberg", 
          "name": "Springer Berlin Heidelberg", 
          "type": "Organisation"
        }, 
        "sameAs": [
          "https://doi.org/10.1007/978-3-642-00843-6_9", 
          "https://app.dimensions.ai/details/publication/pub.1045088773"
        ], 
        "sdDataset": "chapters", 
        "sdDatePublished": "2019-04-16T07:09", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000353_0000000353/records_45335_00000000.jsonl", 
        "type": "Chapter", 
        "url": "https://link.springer.com/10.1007%2F978-3-642-00843-6_9"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-00843-6_9'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-00843-6_9'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-00843-6_9'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-00843-6_9'


     

    This table displays all metadata directly associated to this object as RDF triples.

    135 TRIPLES      23 PREDICATES      40 URIs      20 LITERALS      8 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/978-3-642-00843-6_9 schema:about anzsrc-for:08
    2 anzsrc-for:0804
    3 schema:author N08de2103e00c464eb637672976ff33e9
    4 schema:citation sg:pub.10.1007/3-540-39200-9_10
    5 sg:pub.10.1007/3-540-48658-5_19
    6 sg:pub.10.1007/978-3-540-24638-1_12
    7 sg:pub.10.1007/978-3-540-24638-1_7
    8 sg:pub.10.1007/bf00195207
    9 https://doi.org/10.1016/0022-0000(88)90005-0
    10 https://doi.org/10.1017/cbo9780511546891
    11 https://doi.org/10.1109/sfcs.2003.1238213
    12 https://doi.org/10.1137/0218012
    13 https://doi.org/10.1137/s0097539701392949
    14 https://doi.org/10.1137/s0097539791220688
    15 https://doi.org/10.1145/116825.116852
    16 https://doi.org/10.1145/276698.276853
    17 schema:datePublished 2009
    18 schema:datePublishedReg 2009-01-01
    19 schema:description In [16], Pass generalized the definition of zero knowledge proof and defined nO(σ(n))-simulatable proof which can be simulated by a simulator in nO(σ(n)) time. Assuming the existence of one-way permutation secure against sub-exponential circuits and 2-round perfect hiding commitment scheme, an efficient 4-round perfect npoly(logn)-simulatable argument of knowledge was presented there. In this paper, we construct an efficient concurrent npoly(logn)-simulatable argument of knowledge under more general assumption. The new scheme is 5-round and is based on the existence of one-way permutation secure against sub-exponential circuits. However, for the scheme in [16], if using ordinary Σ-protocol for the corresponding statement as sub-protocol, instead of Σ-protocol with honest verifier perfect zero knowledge, the resulting protocol is not necessarily closed under concurrent composition.
    20 schema:editor N657d17289a344bc4988e1661e8517a40
    21 schema:genre chapter
    22 schema:inLanguage en
    23 schema:isAccessibleForFree false
    24 schema:isPartOf N370c5877ae0b468bb4716e73ef2ab499
    25 schema:name Efficient Concurrent npoly(logn)-Simulatable Argument of Knowledge
    26 schema:pagination 93-101
    27 schema:productId N61fdbb23dd3948978c42d9a98da125ed
    28 N74d514d2ec504506b9149a6ffa30e995
    29 Nc8925c9dc2614e1da62ce7a10217033f
    30 schema:publisher N73255528e0ed4c71b20cbff9b2457351
    31 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045088773
    32 https://doi.org/10.1007/978-3-642-00843-6_9
    33 schema:sdDatePublished 2019-04-16T07:09
    34 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    35 schema:sdPublisher Ndb23db8e8df2430e8d16b84b7af53aef
    36 schema:url https://link.springer.com/10.1007%2F978-3-642-00843-6_9
    37 sgo:license sg:explorer/license/
    38 sgo:sdDataset chapters
    39 rdf:type schema:Chapter
    40 N08de2103e00c464eb637672976ff33e9 rdf:first sg:person.015537351057.08
    41 rdf:rest N0c4fb73937214722891f304132114187
    42 N0c4fb73937214722891f304132114187 rdf:first sg:person.014134057755.58
    43 rdf:rest Na991b5715ff94ababf9f9e55d092e44f
    44 N370c5877ae0b468bb4716e73ef2ab499 schema:isbn 978-3-642-00842-9
    45 978-3-642-00843-6
    46 schema:name Information Security Practice and Experience
    47 rdf:type schema:Book
    48 N3d5dd686a90e4a02b1cce74413db7bc2 schema:familyName Wang
    49 schema:givenName Guilin
    50 rdf:type schema:Person
    51 N5a3551b8d317494dad79afc13cc32c46 rdf:first Nd379698a47d048a9a3a3d387571908b5
    52 rdf:rest N6c4ff0e978cd48afa8490fa026664aaa
    53 N61fdbb23dd3948978c42d9a98da125ed schema:name doi
    54 schema:value 10.1007/978-3-642-00843-6_9
    55 rdf:type schema:PropertyValue
    56 N657d17289a344bc4988e1661e8517a40 rdf:first N87773d950b2c44ae9ced52738aea6821
    57 rdf:rest N5a3551b8d317494dad79afc13cc32c46
    58 N6c4ff0e978cd48afa8490fa026664aaa rdf:first N3d5dd686a90e4a02b1cce74413db7bc2
    59 rdf:rest rdf:nil
    60 N73255528e0ed4c71b20cbff9b2457351 schema:location Berlin, Heidelberg
    61 schema:name Springer Berlin Heidelberg
    62 rdf:type schema:Organisation
    63 N74d514d2ec504506b9149a6ffa30e995 schema:name dimensions_id
    64 schema:value pub.1045088773
    65 rdf:type schema:PropertyValue
    66 N87773d950b2c44ae9ced52738aea6821 schema:familyName Bao
    67 schema:givenName Feng
    68 rdf:type schema:Person
    69 Na991b5715ff94ababf9f9e55d092e44f rdf:first Nf96a4d437de346a98c9e1576d88e7d9f
    70 rdf:rest rdf:nil
    71 Nc8925c9dc2614e1da62ce7a10217033f schema:name readcube_id
    72 schema:value d6c5a63d59b1fdb877b33b02523ef378a85f0307fb937dd47dbdbd8973fc3d69
    73 rdf:type schema:PropertyValue
    74 Ncffe557b9c9d401db2b3defdd4dc3cb6 schema:name Beijing Institute of Electronic Science and Technology, 100070, Beijing, P.R. China
    75 rdf:type schema:Organization
    76 Nd379698a47d048a9a3a3d387571908b5 schema:familyName Li
    77 schema:givenName Hui
    78 rdf:type schema:Person
    79 Ndb23db8e8df2430e8d16b84b7af53aef schema:name Springer Nature - SN SciGraph project
    80 rdf:type schema:Organization
    81 Nf96a4d437de346a98c9e1576d88e7d9f schema:affiliation Ncffe557b9c9d401db2b3defdd4dc3cb6
    82 schema:familyName Zhang
    83 schema:givenName Yanshuo
    84 rdf:type schema:Person
    85 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    86 schema:name Information and Computing Sciences
    87 rdf:type schema:DefinedTerm
    88 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
    89 schema:name Data Format
    90 rdf:type schema:DefinedTerm
    91 sg:person.014134057755.58 schema:affiliation https://www.grid.ac/institutes/grid.410726.6
    92 schema:familyName Lin
    93 schema:givenName Dongdai
    94 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014134057755.58
    95 rdf:type schema:Person
    96 sg:person.015537351057.08 schema:affiliation https://www.grid.ac/institutes/grid.410726.6
    97 schema:familyName Huang
    98 schema:givenName Guifang
    99 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015537351057.08
    100 rdf:type schema:Person
    101 sg:pub.10.1007/3-540-39200-9_10 schema:sameAs https://app.dimensions.ai/details/publication/pub.1028767322
    102 https://doi.org/10.1007/3-540-39200-9_10
    103 rdf:type schema:CreativeWork
    104 sg:pub.10.1007/3-540-48658-5_19 schema:sameAs https://app.dimensions.ai/details/publication/pub.1053299783
    105 https://doi.org/10.1007/3-540-48658-5_19
    106 rdf:type schema:CreativeWork
    107 sg:pub.10.1007/978-3-540-24638-1_12 schema:sameAs https://app.dimensions.ai/details/publication/pub.1001767230
    108 https://doi.org/10.1007/978-3-540-24638-1_12
    109 rdf:type schema:CreativeWork
    110 sg:pub.10.1007/978-3-540-24638-1_7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1031013279
    111 https://doi.org/10.1007/978-3-540-24638-1_7
    112 rdf:type schema:CreativeWork
    113 sg:pub.10.1007/bf00195207 schema:sameAs https://app.dimensions.ai/details/publication/pub.1051079135
    114 https://doi.org/10.1007/bf00195207
    115 rdf:type schema:CreativeWork
    116 https://doi.org/10.1016/0022-0000(88)90005-0 schema:sameAs https://app.dimensions.ai/details/publication/pub.1005992495
    117 rdf:type schema:CreativeWork
    118 https://doi.org/10.1017/cbo9780511546891 schema:sameAs https://app.dimensions.ai/details/publication/pub.1098679363
    119 rdf:type schema:CreativeWork
    120 https://doi.org/10.1109/sfcs.2003.1238213 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095425643
    121 rdf:type schema:CreativeWork
    122 https://doi.org/10.1137/0218012 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062842111
    123 rdf:type schema:CreativeWork
    124 https://doi.org/10.1137/s0097539701392949 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062879319
    125 rdf:type schema:CreativeWork
    126 https://doi.org/10.1137/s0097539791220688 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062879685
    127 rdf:type schema:CreativeWork
    128 https://doi.org/10.1145/116825.116852 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020345436
    129 rdf:type schema:CreativeWork
    130 https://doi.org/10.1145/276698.276853 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045093113
    131 rdf:type schema:CreativeWork
    132 https://www.grid.ac/institutes/grid.410726.6 schema:alternateName University of Chinese Academy of Sciences
    133 schema:name Graduate University of Chinese Academy of Sciences, 100049, P.R. China
    134 The State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, 100190, Beijing, P.R. China
    135 rdf:type schema:Organization
     




    Preview window. Press ESC to close (or click here)


    ...