Efficient and Non-interactive Non-malleable Commitment View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2001-04-15

AUTHORS

Giovanni Di Crescenzo , Jonathan Katz , Rafail Ostrovsky , Adam Smith

ABSTRACT

We present new constructions of non-malleable commitment schemes, in the public parameter model (where a trusted party makes parameters available to all parties), based on the discrete logarithm or RSA assumptions. The main features of our schemes are: they achieve near-optimal communication for arbitrarily-large messages and are non-interactive. Previous schemes either required (several rounds of) interaction or focused on achieving non-malleable commitment based on general assumptions and were thus efficient only when committing to a single bit. Although our main constructions are for the case of perfectly-hiding commitment, we also present a communication-efficient, non-interactive commitment scheme (based on general assumptions) that is perfectly binding. More... »

PAGES

40-59

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-44987-6_4

DOI

http://dx.doi.org/10.1007/3-540-44987-6_4

DIMENSIONS

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


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/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "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"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Telcordia Technologies, Inc., Columbia", 
          "id": "http://www.grid.ac/institutes/grid.432790.b", 
          "name": [
            "Telcordia Technologies, Inc., Columbia"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Di Crescenzo", 
        "givenName": "Giovanni", 
        "id": "sg:person.010106610565.51", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010106610565.51"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Telcordia Technologies and Department of Computer Science, Columbia University, Columbia", 
          "id": "http://www.grid.ac/institutes/grid.21729.3f", 
          "name": [
            "Telcordia Technologies and Department of Computer Science, Columbia University, Columbia"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Katz", 
        "givenName": "Jonathan", 
        "id": "sg:person.01354261156.67", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01354261156.67"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Telcordia Technologies, Inc., Columbia", 
          "id": "http://www.grid.ac/institutes/grid.432790.b", 
          "name": [
            "Telcordia Technologies, Inc., Columbia"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Ostrovsky", 
        "givenName": "Rafail", 
        "id": "sg:person.015474716573.95", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015474716573.95"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Laboratory for Computer Science, MIT, Telcordia Technologies, Columbia", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Laboratory for Computer Science, MIT, Telcordia Technologies, Columbia"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Smith", 
        "givenName": "Adam", 
        "id": "sg:person.013307226666.21", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013307226666.21"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2001-04-15", 
    "datePublishedReg": "2001-04-15", 
    "description": "We present new constructions of non-malleable commitment schemes, in the public parameter model (where a trusted party makes parameters available to all parties), based on the discrete logarithm or RSA assumptions. The main features of our schemes are: they achieve near-optimal communication for arbitrarily-large messages and are non-interactive. Previous schemes either required (several rounds of) interaction or focused on achieving non-malleable commitment based on general assumptions and were thus efficient only when committing to a single bit. Although our main constructions are for the case of perfectly-hiding commitment, we also present a communication-efficient, non-interactive commitment scheme (based on general assumptions) that is perfectly binding.", 
    "editor": [
      {
        "familyName": "Pfitzmann", 
        "givenName": "Birgit", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-44987-6_4", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-42070-5", 
        "978-3-540-44987-4"
      ], 
      "name": "Advances in Cryptology \u2014 EUROCRYPT 2001", 
      "type": "Book"
    }, 
    "keywords": [
      "non-malleable commitments", 
      "commitment scheme", 
      "non-interactive commitment schemes", 
      "non-malleable commitment scheme", 
      "discrete logarithm", 
      "RSA assumption", 
      "large messages", 
      "previous schemes", 
      "single bit", 
      "optimal communication", 
      "non-interactive non-malleable commitments", 
      "scheme", 
      "main construction", 
      "main features", 
      "communication", 
      "messages", 
      "bits", 
      "new construction", 
      "construction", 
      "features", 
      "model", 
      "assumption", 
      "general assumptions", 
      "parameter model", 
      "interaction", 
      "logarithm", 
      "commitment", 
      "cases"
    ], 
    "name": "Efficient and Non-interactive Non-malleable Commitment", 
    "pagination": "40-59", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1051386971"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-44987-6_4"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-44987-6_4", 
      "https://app.dimensions.ai/details/publication/pub.1051386971"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-06-01T22:27", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220601/entities/gbq_results/chapter/chapter_108.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-44987-6_4"
  }
]
 

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/3-540-44987-6_4'

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/3-540-44987-6_4'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-44987-6_4'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/3-540-44987-6_4'


 

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

115 TRIPLES      23 PREDICATES      53 URIs      46 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-44987-6_4 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N7135d2f875b74a6a9fa01f8d5650fbdd
4 schema:datePublished 2001-04-15
5 schema:datePublishedReg 2001-04-15
6 schema:description We present new constructions of non-malleable commitment schemes, in the public parameter model (where a trusted party makes parameters available to all parties), based on the discrete logarithm or RSA assumptions. The main features of our schemes are: they achieve near-optimal communication for arbitrarily-large messages and are non-interactive. Previous schemes either required (several rounds of) interaction or focused on achieving non-malleable commitment based on general assumptions and were thus efficient only when committing to a single bit. Although our main constructions are for the case of perfectly-hiding commitment, we also present a communication-efficient, non-interactive commitment scheme (based on general assumptions) that is perfectly binding.
7 schema:editor Ncdbbc587b5984ae585d8660166a227d1
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf Nf166053cc4144bb88527bcb5d9b570ee
12 schema:keywords RSA assumption
13 assumption
14 bits
15 cases
16 commitment
17 commitment scheme
18 communication
19 construction
20 discrete logarithm
21 features
22 general assumptions
23 interaction
24 large messages
25 logarithm
26 main construction
27 main features
28 messages
29 model
30 new construction
31 non-interactive commitment schemes
32 non-interactive non-malleable commitments
33 non-malleable commitment scheme
34 non-malleable commitments
35 optimal communication
36 parameter model
37 previous schemes
38 scheme
39 single bit
40 schema:name Efficient and Non-interactive Non-malleable Commitment
41 schema:pagination 40-59
42 schema:productId N5b14c27d38f74ae489bc1980a4bdcd12
43 Naf543121fa21429c9cbc654ec5e61ff3
44 schema:publisher Nfe86607ad900490c9aed932c1ffbf593
45 schema:sameAs https://app.dimensions.ai/details/publication/pub.1051386971
46 https://doi.org/10.1007/3-540-44987-6_4
47 schema:sdDatePublished 2022-06-01T22:27
48 schema:sdLicense https://scigraph.springernature.com/explorer/license/
49 schema:sdPublisher N2612732976d54e3685b871e8f1ca4c89
50 schema:url https://doi.org/10.1007/3-540-44987-6_4
51 sgo:license sg:explorer/license/
52 sgo:sdDataset chapters
53 rdf:type schema:Chapter
54 N2612732976d54e3685b871e8f1ca4c89 schema:name Springer Nature - SN SciGraph project
55 rdf:type schema:Organization
56 N4be0f1feb3bf4c63b3684156dafe12cd rdf:first sg:person.015474716573.95
57 rdf:rest Nf3b053c7921645e9b20be1eb04662a31
58 N5b14c27d38f74ae489bc1980a4bdcd12 schema:name doi
59 schema:value 10.1007/3-540-44987-6_4
60 rdf:type schema:PropertyValue
61 N7135d2f875b74a6a9fa01f8d5650fbdd rdf:first sg:person.010106610565.51
62 rdf:rest N961545aa71a74ddbb1e885bf43f8539c
63 N961545aa71a74ddbb1e885bf43f8539c rdf:first sg:person.01354261156.67
64 rdf:rest N4be0f1feb3bf4c63b3684156dafe12cd
65 Naf543121fa21429c9cbc654ec5e61ff3 schema:name dimensions_id
66 schema:value pub.1051386971
67 rdf:type schema:PropertyValue
68 Nc34ed8e77ad04dc5815c92180603f9d4 schema:familyName Pfitzmann
69 schema:givenName Birgit
70 rdf:type schema:Person
71 Ncdbbc587b5984ae585d8660166a227d1 rdf:first Nc34ed8e77ad04dc5815c92180603f9d4
72 rdf:rest rdf:nil
73 Nf166053cc4144bb88527bcb5d9b570ee schema:isbn 978-3-540-42070-5
74 978-3-540-44987-4
75 schema:name Advances in Cryptology — EUROCRYPT 2001
76 rdf:type schema:Book
77 Nf3b053c7921645e9b20be1eb04662a31 rdf:first sg:person.013307226666.21
78 rdf:rest rdf:nil
79 Nfe86607ad900490c9aed932c1ffbf593 schema:name Springer Nature
80 rdf:type schema:Organisation
81 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
82 schema:name Information and Computing Sciences
83 rdf:type schema:DefinedTerm
84 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
85 schema:name Data Format
86 rdf:type schema:DefinedTerm
87 sg:person.010106610565.51 schema:affiliation grid-institutes:grid.432790.b
88 schema:familyName Di Crescenzo
89 schema:givenName Giovanni
90 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010106610565.51
91 rdf:type schema:Person
92 sg:person.013307226666.21 schema:affiliation grid-institutes:None
93 schema:familyName Smith
94 schema:givenName Adam
95 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013307226666.21
96 rdf:type schema:Person
97 sg:person.01354261156.67 schema:affiliation grid-institutes:grid.21729.3f
98 schema:familyName Katz
99 schema:givenName Jonathan
100 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01354261156.67
101 rdf:type schema:Person
102 sg:person.015474716573.95 schema:affiliation grid-institutes:grid.432790.b
103 schema:familyName Ostrovsky
104 schema:givenName Rafail
105 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015474716573.95
106 rdf:type schema:Person
107 grid-institutes:None schema:alternateName Laboratory for Computer Science, MIT, Telcordia Technologies, Columbia
108 schema:name Laboratory for Computer Science, MIT, Telcordia Technologies, Columbia
109 rdf:type schema:Organization
110 grid-institutes:grid.21729.3f schema:alternateName Telcordia Technologies and Department of Computer Science, Columbia University, Columbia
111 schema:name Telcordia Technologies and Department of Computer Science, Columbia University, Columbia
112 rdf:type schema:Organization
113 grid-institutes:grid.432790.b schema:alternateName Telcordia Technologies, Inc., Columbia
114 schema:name Telcordia Technologies, Inc., Columbia
115 rdf:type schema:Organization
 




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


...