Zero-knowledge proofs of identity View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

1988-06

AUTHORS

Uriel Feige, Amos Fiat, Adi Shamir

ABSTRACT

In this paper we extend the notion of interactive proofs of assertions to interactive proofs of knowledge. This leads to the definition of unrestricted input zero-knowledge proofs of knowledge in which the prover demonstrates possession of knowledge without revealing any computational information whatsoever (not even the one bit revealed in zero-knowledge proofs of assertions). We show the relevance of these notions to identification schemes, in which parties prove their identity by demonstrating their knowledge rather than by proving the validity of assertions. We describe a novel scheme which is provably secure if factoring is difficult and whose practical implementations are about two orders of magnitude faster than RSA-based identification schemes. The advantages of thinking in terms of proofs of knowledge rather than proofs of assertions are demonstrated in two efficient variants of the scheme: unrestricted input zero-knowledge proofs of knowledge are used in the construction of a scheme which needs no directory; a version of the scheme based on parallel interactive proofs (which are not known to be zero knowledge) is proved secure by observing that the identification protocols are proofs of knowledge. More... »

PAGES

77-94

References to SciGraph publications

  • 1985-12. Formal theories of knowledge in AI and robotics in NEW GENERATION COMPUTING
  • Journal

    TITLE

    Journal of Cryptology

    ISSUE

    2

    VOLUME

    1

    Author Affiliations

    Related Patents

  • History Preservation In A Computer Storage System
  • Data Repository And Method For Promoting Network Storage Of Data
  • Zero-Knowledge Environment Based Social Networking Engine
  • Data Repository And Method For Promoting Network Storage Of Data
  • Secret-Key Certificates
  • Zero-Knowledge Environment Based Social Networking Engine
  • Data Repository And Method For Promoting Network Storage Of Data
  • Data Repository And Method For Promoting Network Storage Of Data
  • History Preservation In A Computer Storage System
  • History Preservation In A Computer Storage System
  • Communicating Information Between Clients Of A Data Repository That Have Deposited Identical Data Items
  • Data Repository And Method For Promoting Network Storage Of Data
  • Zero-Knowledge Proof Cryptography Methods And Devices
  • Anonymous Authentication
  • History Preservation In A Computer Storage System
  • Data Repository And Method For Promoting Network Storage Of Data
  • Method For Message Authentication From Non-Malleable Crypto Systems
  • History Preservation In A Computer Storage System
  • Data Repository And Method For Promoting Network Storage Of Data
  • Method For Providing Access Control For Data Items In A Data Repository In Which Storage Space Used By Identical Content Is Shared
  • Data Repository And Method For Promoting Network Storage Of Data
  • Archive With Timestamps And Deletion Management
  • History Preservation In A Computer Storage System
  • History Preservation In A Computer Storage System
  • History Preservation In A Computer Storage System
  • Data Repository And Method For Promoting Network Storage Of Data
  • Secure Cryptographic Methods For Electronic Transfer Of Information
  • History Preservation In A Computer Storage System
  • History Preservation In A Computer Storage System
  • Data Repository And Method For Promoting Network Storage Of Data
  • History Preservation In A Computer Storage System
  • History Preservation In A Computer Storage System
  • Method For Protecting History In A File System
  • Data Repository And Method For Promoting Network Storage Of Data
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/bf02351717

    DOI

    http://dx.doi.org/10.1007/bf02351717

    DIMENSIONS

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


    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/0802", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Computation Theory and Mathematics", 
            "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": "Weizmann Institute of Science", 
              "id": "https://www.grid.ac/institutes/grid.13992.30", 
              "name": [
                "Department of Applied Mathematics, The Weizmann Institute of Science, 76100, Rehovot, Israel"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Feige", 
            "givenName": "Uriel", 
            "id": "sg:person.0606741665.35", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0606741665.35"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Weizmann Institute of Science", 
              "id": "https://www.grid.ac/institutes/grid.13992.30", 
              "name": [
                "Department of Applied Mathematics, The Weizmann Institute of Science, 76100, Rehovot, Israel"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Fiat", 
            "givenName": "Amos", 
            "id": "sg:person.07616042017.20", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07616042017.20"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Weizmann Institute of Science", 
              "id": "https://www.grid.ac/institutes/grid.13992.30", 
              "name": [
                "Department of Applied Mathematics, The Weizmann Institute of Science, 76100, Rehovot, Israel"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Shamir", 
            "givenName": "Adi", 
            "id": "sg:person.013052746407.28", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013052746407.28"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "https://doi.org/10.1145/359340.359342", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1013337011"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/800222.806735", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1020643126"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf03037076", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1040030010", 
              "https://doi.org/10.1007/bf03037076"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf03037076", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1040030010", 
              "https://doi.org/10.1007/bf03037076"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/sfcs.1985.1", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1086170269"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/sfcs.1987.49", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1086186231"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/sfcs.1987.43", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1086212674"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/sfcs.1986.47", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1086234957"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/sfcs.1984.715946", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1086247754"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/sfcs.1985.64", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1086253451"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "1988-06", 
        "datePublishedReg": "1988-06-01", 
        "description": "In this paper we extend the notion of interactive proofs of assertions to interactive proofs of knowledge. This leads to the definition of unrestricted input zero-knowledge proofs of knowledge in which the prover demonstrates possession of knowledge without revealing any computational information whatsoever (not even the one bit revealed in zero-knowledge proofs of assertions). We show the relevance of these notions to identification schemes, in which parties prove their identity by demonstrating their knowledge rather than by proving the validity of assertions. We describe a novel scheme which is provably secure if factoring is difficult and whose practical implementations are about two orders of magnitude faster than RSA-based identification schemes. The advantages of thinking in terms of proofs of knowledge rather than proofs of assertions are demonstrated in two efficient variants of the scheme: unrestricted input zero-knowledge proofs of knowledge are used in the construction of a scheme which needs no directory; a version of the scheme based on parallel interactive proofs (which are not known to be zero knowledge) is proved secure by observing that the identification protocols are proofs of knowledge.", 
        "genre": "research_article", 
        "id": "sg:pub.10.1007/bf02351717", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": false, 
        "isPartOf": [
          {
            "id": "sg:journal.1136278", 
            "issn": [
              "0933-2790", 
              "1432-1378"
            ], 
            "name": "Journal of Cryptology", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "2", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "1"
          }
        ], 
        "name": "Zero-knowledge proofs of identity", 
        "pagination": "77-94", 
        "productId": [
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "05368fa505ac68706e7203b6da81465e079cf66129bcadb8b280650dfd2e4fd2"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/bf02351717"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1001094212"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/bf02351717", 
          "https://app.dimensions.ai/details/publication/pub.1001094212"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2019-04-11T12:57", 
        "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/0000000365_0000000365/records_71680_00000000.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "http://link.springer.com/10.1007%2FBF02351717"
      }
    ]
     

    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/bf02351717'

    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/bf02351717'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/bf02351717'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/bf02351717'


     

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

    103 TRIPLES      21 PREDICATES      36 URIs      19 LITERALS      7 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/bf02351717 schema:about anzsrc-for:08
    2 anzsrc-for:0802
    3 schema:author N2e84cf303fc84fb982f5803b29e4dc19
    4 schema:citation sg:pub.10.1007/bf03037076
    5 https://doi.org/10.1109/sfcs.1984.715946
    6 https://doi.org/10.1109/sfcs.1985.1
    7 https://doi.org/10.1109/sfcs.1985.64
    8 https://doi.org/10.1109/sfcs.1986.47
    9 https://doi.org/10.1109/sfcs.1987.43
    10 https://doi.org/10.1109/sfcs.1987.49
    11 https://doi.org/10.1145/359340.359342
    12 https://doi.org/10.1145/800222.806735
    13 schema:datePublished 1988-06
    14 schema:datePublishedReg 1988-06-01
    15 schema:description In this paper we extend the notion of interactive proofs of assertions to interactive proofs of knowledge. This leads to the definition of unrestricted input zero-knowledge proofs of knowledge in which the prover demonstrates possession of knowledge without revealing any computational information whatsoever (not even the one bit revealed in zero-knowledge proofs of assertions). We show the relevance of these notions to identification schemes, in which parties prove their identity by demonstrating their knowledge rather than by proving the validity of assertions. We describe a novel scheme which is provably secure if factoring is difficult and whose practical implementations are about two orders of magnitude faster than RSA-based identification schemes. The advantages of thinking in terms of proofs of knowledge rather than proofs of assertions are demonstrated in two efficient variants of the scheme: unrestricted input zero-knowledge proofs of knowledge are used in the construction of a scheme which needs no directory; a version of the scheme based on parallel interactive proofs (which are not known to be zero knowledge) is proved secure by observing that the identification protocols are proofs of knowledge.
    16 schema:genre research_article
    17 schema:inLanguage en
    18 schema:isAccessibleForFree false
    19 schema:isPartOf N4b42ffc2aabd40828eb2db8356d2f8cb
    20 N91fd17eab5ca4a86b760e90f94c4fa33
    21 sg:journal.1136278
    22 schema:name Zero-knowledge proofs of identity
    23 schema:pagination 77-94
    24 schema:productId N1bdde2bef91a4e379861e6ca7baf7ec7
    25 N6e76d8c1d6f64bbab962cdc510083f19
    26 N950626f3a1704986b3c7861ff4f580d0
    27 schema:sameAs https://app.dimensions.ai/details/publication/pub.1001094212
    28 https://doi.org/10.1007/bf02351717
    29 schema:sdDatePublished 2019-04-11T12:57
    30 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    31 schema:sdPublisher N9c3c3f29edeb44c0b94df032761a99b8
    32 schema:url http://link.springer.com/10.1007%2FBF02351717
    33 sgo:license sg:explorer/license/
    34 sgo:sdDataset articles
    35 rdf:type schema:ScholarlyArticle
    36 N1bdde2bef91a4e379861e6ca7baf7ec7 schema:name dimensions_id
    37 schema:value pub.1001094212
    38 rdf:type schema:PropertyValue
    39 N2e84cf303fc84fb982f5803b29e4dc19 rdf:first sg:person.0606741665.35
    40 rdf:rest Nb3a5ab9c072f41a1b6d1811426a560d7
    41 N4b42ffc2aabd40828eb2db8356d2f8cb schema:volumeNumber 1
    42 rdf:type schema:PublicationVolume
    43 N6e76d8c1d6f64bbab962cdc510083f19 schema:name doi
    44 schema:value 10.1007/bf02351717
    45 rdf:type schema:PropertyValue
    46 N7cb1eabdb34e4e189eeb83e527303980 rdf:first sg:person.013052746407.28
    47 rdf:rest rdf:nil
    48 N91fd17eab5ca4a86b760e90f94c4fa33 schema:issueNumber 2
    49 rdf:type schema:PublicationIssue
    50 N950626f3a1704986b3c7861ff4f580d0 schema:name readcube_id
    51 schema:value 05368fa505ac68706e7203b6da81465e079cf66129bcadb8b280650dfd2e4fd2
    52 rdf:type schema:PropertyValue
    53 N9c3c3f29edeb44c0b94df032761a99b8 schema:name Springer Nature - SN SciGraph project
    54 rdf:type schema:Organization
    55 Nb3a5ab9c072f41a1b6d1811426a560d7 rdf:first sg:person.07616042017.20
    56 rdf:rest N7cb1eabdb34e4e189eeb83e527303980
    57 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    58 schema:name Information and Computing Sciences
    59 rdf:type schema:DefinedTerm
    60 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
    61 schema:name Computation Theory and Mathematics
    62 rdf:type schema:DefinedTerm
    63 sg:journal.1136278 schema:issn 0933-2790
    64 1432-1378
    65 schema:name Journal of Cryptology
    66 rdf:type schema:Periodical
    67 sg:person.013052746407.28 schema:affiliation https://www.grid.ac/institutes/grid.13992.30
    68 schema:familyName Shamir
    69 schema:givenName Adi
    70 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013052746407.28
    71 rdf:type schema:Person
    72 sg:person.0606741665.35 schema:affiliation https://www.grid.ac/institutes/grid.13992.30
    73 schema:familyName Feige
    74 schema:givenName Uriel
    75 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0606741665.35
    76 rdf:type schema:Person
    77 sg:person.07616042017.20 schema:affiliation https://www.grid.ac/institutes/grid.13992.30
    78 schema:familyName Fiat
    79 schema:givenName Amos
    80 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07616042017.20
    81 rdf:type schema:Person
    82 sg:pub.10.1007/bf03037076 schema:sameAs https://app.dimensions.ai/details/publication/pub.1040030010
    83 https://doi.org/10.1007/bf03037076
    84 rdf:type schema:CreativeWork
    85 https://doi.org/10.1109/sfcs.1984.715946 schema:sameAs https://app.dimensions.ai/details/publication/pub.1086247754
    86 rdf:type schema:CreativeWork
    87 https://doi.org/10.1109/sfcs.1985.1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1086170269
    88 rdf:type schema:CreativeWork
    89 https://doi.org/10.1109/sfcs.1985.64 schema:sameAs https://app.dimensions.ai/details/publication/pub.1086253451
    90 rdf:type schema:CreativeWork
    91 https://doi.org/10.1109/sfcs.1986.47 schema:sameAs https://app.dimensions.ai/details/publication/pub.1086234957
    92 rdf:type schema:CreativeWork
    93 https://doi.org/10.1109/sfcs.1987.43 schema:sameAs https://app.dimensions.ai/details/publication/pub.1086212674
    94 rdf:type schema:CreativeWork
    95 https://doi.org/10.1109/sfcs.1987.49 schema:sameAs https://app.dimensions.ai/details/publication/pub.1086186231
    96 rdf:type schema:CreativeWork
    97 https://doi.org/10.1145/359340.359342 schema:sameAs https://app.dimensions.ai/details/publication/pub.1013337011
    98 rdf:type schema:CreativeWork
    99 https://doi.org/10.1145/800222.806735 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020643126
    100 rdf:type schema:CreativeWork
    101 https://www.grid.ac/institutes/grid.13992.30 schema:alternateName Weizmann Institute of Science
    102 schema:name Department of Applied Mathematics, The Weizmann Institute of Science, 76100, Rehovot, Israel
    103 rdf:type schema:Organization
     




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


    ...