Public-Key Cryptosystems Based on Composite Degree Residuosity Classes View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

1999-04-15

AUTHORS

Pascal Paillier

ABSTRACT

This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new trapdoor mechanism and derive from this technique three encryption schemes: a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA. Our cryptosystems, based on usual modular arithmetics, are provably secure under appropriate assumptions in the standard model. More... »

PAGES

223-238

Book

TITLE

Advances in Cryptology — EUROCRYPT ’99

ISBN

978-3-540-65889-4

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-48910-x_16

DOI

http://dx.doi.org/10.1007/3-540-48910-x_16

DIMENSIONS

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


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": "Computer Science Department, ENST, 46, rue Barrault, 75634, Paris Cedex 13, France", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Cryptography Department, GEMPLUS, 34 Rue Guynemer, 92447, Issy-Les-Moulineaux, France", 
            "Computer Science Department, ENST, 46, rue Barrault, 75634, Paris Cedex 13, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Paillier", 
        "givenName": "Pascal", 
        "id": "sg:person.012202553435.44", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012202553435.44"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1999-04-15", 
    "datePublishedReg": "1999-04-15", 
    "description": "This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new trapdoor mechanism and derive from this technique three encryption schemes: a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA. Our cryptosystems, based on usual modular arithmetics, are provably secure under appropriate assumptions in the standard model.", 
    "editor": [
      {
        "familyName": "Stern", 
        "givenName": "Jacques", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-48910-x_16", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-65889-4"
      ], 
      "name": "Advances in Cryptology \u2014 EUROCRYPT \u201999", 
      "type": "Book"
    }, 
    "keywords": [
      "encryption scheme", 
      "public-key cryptography", 
      "probabilistic encryption scheme", 
      "novel computational problem", 
      "key cryptosystem", 
      "computational problems", 
      "trapdoor permutations", 
      "class problem", 
      "modular arithmetic", 
      "trapdoor mechanism", 
      "cryptosystem", 
      "scheme", 
      "cryptography", 
      "RSA", 
      "arithmetic", 
      "permutations", 
      "applications", 
      "standard model", 
      "appropriate assumptions", 
      "model", 
      "class", 
      "assumption", 
      "mechanism", 
      "problem", 
      "paper", 
      "Composite Residuosity Class Problem", 
      "Residuosity Class Problem", 
      "new trapdoor mechanism", 
      "technique three encryption schemes", 
      "three encryption schemes", 
      "homomorphic probabilistic encryption schemes", 
      "usual modular arithmetics", 
      "Composite Degree Residuosity Classes", 
      "Degree Residuosity Classes", 
      "Residuosity Classes"
    ], 
    "name": "Public-Key Cryptosystems Based on Composite Degree Residuosity Classes", 
    "pagination": "223-238", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1026773924"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-48910-x_16"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-48910-x_16", 
      "https://app.dimensions.ai/details/publication/pub.1026773924"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2021-12-01T20:01", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20211201/entities/gbq_results/chapter/chapter_232.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-48910-x_16"
  }
]
 

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-48910-x_16'

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-48910-x_16'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-48910-x_16'

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-48910-x_16'


 

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

95 TRIPLES      23 PREDICATES      60 URIs      53 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-48910-x_16 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N5ddd4db594d14ae48161af2a1db96701
4 schema:datePublished 1999-04-15
5 schema:datePublishedReg 1999-04-15
6 schema:description This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new trapdoor mechanism and derive from this technique three encryption schemes: a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA. Our cryptosystems, based on usual modular arithmetics, are provably secure under appropriate assumptions in the standard model.
7 schema:editor N574fefc4105c46d0b202814b5d230177
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf N3a6a7a5ba36b4f8fb4e227261e89b1e9
12 schema:keywords Composite Degree Residuosity Classes
13 Composite Residuosity Class Problem
14 Degree Residuosity Classes
15 RSA
16 Residuosity Class Problem
17 Residuosity Classes
18 applications
19 appropriate assumptions
20 arithmetic
21 assumption
22 class
23 class problem
24 computational problems
25 cryptography
26 cryptosystem
27 encryption scheme
28 homomorphic probabilistic encryption schemes
29 key cryptosystem
30 mechanism
31 model
32 modular arithmetic
33 new trapdoor mechanism
34 novel computational problem
35 paper
36 permutations
37 probabilistic encryption scheme
38 problem
39 public-key cryptography
40 scheme
41 standard model
42 technique three encryption schemes
43 three encryption schemes
44 trapdoor mechanism
45 trapdoor permutations
46 usual modular arithmetics
47 schema:name Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
48 schema:pagination 223-238
49 schema:productId N3b2ba54ad224476fa1e05b94082db6ef
50 Ne70f533afbb74b119139e5f17163ffd4
51 schema:publisher N3541119f1cd34c3398a8937871ad5922
52 schema:sameAs https://app.dimensions.ai/details/publication/pub.1026773924
53 https://doi.org/10.1007/3-540-48910-x_16
54 schema:sdDatePublished 2021-12-01T20:01
55 schema:sdLicense https://scigraph.springernature.com/explorer/license/
56 schema:sdPublisher Nab12a338134f40b68291b11474b7fd0a
57 schema:url https://doi.org/10.1007/3-540-48910-x_16
58 sgo:license sg:explorer/license/
59 sgo:sdDataset chapters
60 rdf:type schema:Chapter
61 N057a4d80f6dc4981b06cca5463c78a60 schema:familyName Stern
62 schema:givenName Jacques
63 rdf:type schema:Person
64 N3541119f1cd34c3398a8937871ad5922 schema:name Springer Nature
65 rdf:type schema:Organisation
66 N3a6a7a5ba36b4f8fb4e227261e89b1e9 schema:isbn 978-3-540-65889-4
67 schema:name Advances in Cryptology — EUROCRYPT ’99
68 rdf:type schema:Book
69 N3b2ba54ad224476fa1e05b94082db6ef schema:name doi
70 schema:value 10.1007/3-540-48910-x_16
71 rdf:type schema:PropertyValue
72 N574fefc4105c46d0b202814b5d230177 rdf:first N057a4d80f6dc4981b06cca5463c78a60
73 rdf:rest rdf:nil
74 N5ddd4db594d14ae48161af2a1db96701 rdf:first sg:person.012202553435.44
75 rdf:rest rdf:nil
76 Nab12a338134f40b68291b11474b7fd0a schema:name Springer Nature - SN SciGraph project
77 rdf:type schema:Organization
78 Ne70f533afbb74b119139e5f17163ffd4 schema:name dimensions_id
79 schema:value pub.1026773924
80 rdf:type schema:PropertyValue
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.012202553435.44 schema:affiliation grid-institutes:None
88 schema:familyName Paillier
89 schema:givenName Pascal
90 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012202553435.44
91 rdf:type schema:Person
92 grid-institutes:None schema:alternateName Computer Science Department, ENST, 46, rue Barrault, 75634, Paris Cedex 13, France
93 schema:name Computer Science Department, ENST, 46, rue Barrault, 75634, Paris Cedex 13, France
94 Cryptography Department, GEMPLUS, 34 Rue Guynemer, 92447, Issy-Les-Moulineaux, France
95 rdf:type schema:Organization
 




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


...