CoChat
Sign Up
Cited by 54Cryptography and Data SecurityCloud Data Security SolutionsInternet Traffic Analysis and Secure E-voting

Dynamic Decentralized Functional Encryption

Open access
Chotard, Jérémy, Dufour-Sans, Edouard, Gay, Romain, Phan, Duong Hieu, Pointcheval, David·2020·Lecture Notes in Computer Science
DOI 10.1007/978-3-030-56784-2_25
Open this paper in CoChat — free account

Integrity signals

Registry

Crossref · 10.1007/978-3-030-56784-2_25

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Functional encryption enables the computation of specific functions on encrypted data and returns only the result, restricting information exposure more tightly than homomorphic encryption.

    “Functional Encryption (FE): FE goes a step further by enabling the computation of specific functions on encrypted data and returning only the result.This restricts the information exposure even more tightly than HE.Chotard et al. [119].”

    From Confidential Computing Across Edge‐To‐Cloud for Machine Learning: A Survey Study (2025) · cites this paper as [119]

Cited by

Sorted by citations

Authors
Chotard, J., Dufour-Sans, E., Gay, R., Phan, D. H., & Pointcheval, D.
Affiliations
  • Centre National de la Recherche Scientifique (FR)
  • Cornell Tech (US)
Corresponding author
  • Gay, Romain
  • Pointcheval, David
ORCID
Venue
Lecture Notes in Computer Science
Publisher
Springer International Publishing
Published
2020
Volume
LNCS
Issue
12170
Pages
747-775
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
DOI
10.1007/978-3-030-56784-2_25
OpenAlex
W3013668697
Cited by
54
References
0
Citations by year
2026: 2 · 2025: 15 · 2024: 6 · 2023: 15 · 2022: 6 · 2021: 8 · 2020: 2
FWCI
2.96
Type
conference paper
Language
en
Open access
Licence
Locations
  • Lecture notes in computer science (publishedVersion)
  • HAL (submittedVersion, other-oa)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
  • Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
  • Physical Sciences › Computer Science › Artificial Intelligence › Internet Traffic Analysis and Secure E-voting
Keywords
inner-product functional encryption, prime order groups, random oracle model, DDH assumption

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review