Receipt-Free Universally-Verifiable Voting with Everlasting Privacy View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2006

AUTHORS

Tal Moran , Moni Naor

ABSTRACT

We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first receipt-free scheme to give “everlasting privacy” for votes: even a computationally unbounded party does not gain any information about individual votes (other than what can be inferred from the final tally).Our voting protocols are designed to be used in a “traditional” setting, in which voters cast their ballots in a private polling booth (which we model as an untappable channel between the voter and the tallying authority). Following in the footsteps of Chaum and Neff [7,16], our protocol ensures that the integrity of an election cannot be compromised even if the computers running it are all corrupt (although ballot secrecy may be violated in this case).We give a generic voting protocol which we prove to be secure in the Universal Composability model, given that the underlying commitment is universally composable. We also propose a concrete implementation, based on the hardness of discrete log, that is slightly more efficient (and can be used in practice). More... »

PAGES

373-392

Book

TITLE

Advances in Cryptology - CRYPTO 2006

ISBN

978-3-540-37432-9
978-3-540-37433-6

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/11818175_22

DOI

http://dx.doi.org/10.1007/11818175_22

DIMENSIONS

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


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": "Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel", 
          "id": "http://www.grid.ac/institutes/grid.13992.30", 
          "name": [
            "Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Moran", 
        "givenName": "Tal", 
        "id": "sg:person.012022173111.00", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012022173111.00"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel", 
          "id": "http://www.grid.ac/institutes/grid.13992.30", 
          "name": [
            "Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Naor", 
        "givenName": "Moni", 
        "id": "sg:person.07776170271.83", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07776170271.83"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2006", 
    "datePublishedReg": "2006-01-01", 
    "description": "We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first receipt-free scheme to give \u201ceverlasting privacy\u201d for votes: even a computationally unbounded party does not gain any information about individual votes (other than what can be inferred from the final tally).Our voting protocols are designed to be used in a \u201ctraditional\u201d setting, in which voters cast their ballots in a private polling booth (which we model as an untappable channel between the voter and the tallying authority). Following in the footsteps of Chaum and Neff [7,16], our protocol ensures that the integrity of an election cannot be compromised even if the computers running it are all corrupt (although ballot secrecy may be violated in this case).We give a generic voting protocol which we prove to be secure in the Universal Composability model, given that the underlying commitment is universally composable. We also propose a concrete implementation, based on the hardness of discrete log, that is slightly more efficient (and can be used in practice).", 
    "editor": [
      {
        "familyName": "Dwork", 
        "givenName": "Cynthia", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/11818175_22", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-37432-9", 
        "978-3-540-37433-6"
      ], 
      "name": "Advances in Cryptology - CRYPTO 2006", 
      "type": "Book"
    }, 
    "keywords": [
      "everlasting privacy", 
      "voting protocol", 
      "Universal Composability model", 
      "verifiable voting schemes", 
      "unbounded party", 
      "concrete implementation", 
      "voting scheme", 
      "discrete log", 
      "privacy", 
      "polling booth", 
      "individual votes", 
      "scheme", 
      "protocol", 
      "Chaum", 
      "computer", 
      "implementation", 
      "voting", 
      "information", 
      "log", 
      "vote", 
      "footsteps", 
      "underlying commitment", 
      "parties", 
      "ballot", 
      "general assumptions", 
      "model", 
      "booth", 
      "integrity", 
      "assumption", 
      "setting", 
      "voters", 
      "elections", 
      "commitment", 
      "hardness", 
      "Neff", 
      "first receipt-free scheme", 
      "receipt-free scheme", 
      "private polling booth", 
      "footsteps of Chaum", 
      "generic voting protocol", 
      "Composability model", 
      "Free Universally-Verifiable Voting", 
      "Universally-Verifiable Voting"
    ], 
    "name": "Receipt-Free Universally-Verifiable Voting with Everlasting Privacy", 
    "pagination": "373-392", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1020478055"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/11818175_22"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/11818175_22", 
      "https://app.dimensions.ai/details/publication/pub.1020478055"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-01-01T19:12", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/chapter/chapter_200.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/11818175_22"
  }
]
 

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/11818175_22'

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/11818175_22'

Turtle is a human-readable linked data format.

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

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

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


 

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

110 TRIPLES      23 PREDICATES      69 URIs      62 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/11818175_22 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N96fe420a39f8449db9dfbeacc23cd6bb
4 schema:datePublished 2006
5 schema:datePublishedReg 2006-01-01
6 schema:description We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first receipt-free scheme to give “everlasting privacy” for votes: even a computationally unbounded party does not gain any information about individual votes (other than what can be inferred from the final tally).Our voting protocols are designed to be used in a “traditional” setting, in which voters cast their ballots in a private polling booth (which we model as an untappable channel between the voter and the tallying authority). Following in the footsteps of Chaum and Neff [7,16], our protocol ensures that the integrity of an election cannot be compromised even if the computers running it are all corrupt (although ballot secrecy may be violated in this case).We give a generic voting protocol which we prove to be secure in the Universal Composability model, given that the underlying commitment is universally composable. We also propose a concrete implementation, based on the hardness of discrete log, that is slightly more efficient (and can be used in practice).
7 schema:editor N9f755c68a70347b7b7680c9c54a9a902
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf N977ab68121164bf5896117682ca885a2
12 schema:keywords Chaum
13 Composability model
14 Free Universally-Verifiable Voting
15 Neff
16 Universal Composability model
17 Universally-Verifiable Voting
18 assumption
19 ballot
20 booth
21 commitment
22 computer
23 concrete implementation
24 discrete log
25 elections
26 everlasting privacy
27 first receipt-free scheme
28 footsteps
29 footsteps of Chaum
30 general assumptions
31 generic voting protocol
32 hardness
33 implementation
34 individual votes
35 information
36 integrity
37 log
38 model
39 parties
40 polling booth
41 privacy
42 private polling booth
43 protocol
44 receipt-free scheme
45 scheme
46 setting
47 unbounded party
48 underlying commitment
49 verifiable voting schemes
50 vote
51 voters
52 voting
53 voting protocol
54 voting scheme
55 schema:name Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
56 schema:pagination 373-392
57 schema:productId N2d309e443bda49f78d706f70fa6d0284
58 N5404704ea70c46adb619d19c7bb62c00
59 schema:publisher Nefa69e76a91047ea96c0f721a5ab9639
60 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020478055
61 https://doi.org/10.1007/11818175_22
62 schema:sdDatePublished 2022-01-01T19:12
63 schema:sdLicense https://scigraph.springernature.com/explorer/license/
64 schema:sdPublisher N65506b4523a04d71a9edac01a7d2bcfa
65 schema:url https://doi.org/10.1007/11818175_22
66 sgo:license sg:explorer/license/
67 sgo:sdDataset chapters
68 rdf:type schema:Chapter
69 N2d309e443bda49f78d706f70fa6d0284 schema:name doi
70 schema:value 10.1007/11818175_22
71 rdf:type schema:PropertyValue
72 N5404704ea70c46adb619d19c7bb62c00 schema:name dimensions_id
73 schema:value pub.1020478055
74 rdf:type schema:PropertyValue
75 N65506b4523a04d71a9edac01a7d2bcfa schema:name Springer Nature - SN SciGraph project
76 rdf:type schema:Organization
77 N96fe420a39f8449db9dfbeacc23cd6bb rdf:first sg:person.012022173111.00
78 rdf:rest Ncc5837fe561844b8a88e9f729106b280
79 N977ab68121164bf5896117682ca885a2 schema:isbn 978-3-540-37432-9
80 978-3-540-37433-6
81 schema:name Advances in Cryptology - CRYPTO 2006
82 rdf:type schema:Book
83 N9f755c68a70347b7b7680c9c54a9a902 rdf:first Ncdcd8d503960467fb669c01e989bdfef
84 rdf:rest rdf:nil
85 Ncc5837fe561844b8a88e9f729106b280 rdf:first sg:person.07776170271.83
86 rdf:rest rdf:nil
87 Ncdcd8d503960467fb669c01e989bdfef schema:familyName Dwork
88 schema:givenName Cynthia
89 rdf:type schema:Person
90 Nefa69e76a91047ea96c0f721a5ab9639 schema:name Springer Nature
91 rdf:type schema:Organisation
92 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
93 schema:name Information and Computing Sciences
94 rdf:type schema:DefinedTerm
95 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
96 schema:name Data Format
97 rdf:type schema:DefinedTerm
98 sg:person.012022173111.00 schema:affiliation grid-institutes:grid.13992.30
99 schema:familyName Moran
100 schema:givenName Tal
101 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012022173111.00
102 rdf:type schema:Person
103 sg:person.07776170271.83 schema:affiliation grid-institutes:grid.13992.30
104 schema:familyName Naor
105 schema:givenName Moni
106 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07776170271.83
107 rdf:type schema:Person
108 grid-institutes:grid.13992.30 schema:alternateName Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel
109 schema:name Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel
110 rdf:type schema:Organization
 




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


...