The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Format-Preserving Encryption
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,000
Introduction to the Theory of Computation
Sipser, M. (1996) · ACM SIGACT News · doi:10.1145/230514.571645 · Cited by 2,784
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
Formal Languages and Their Relation to Automata
Hopcroft, J. E., & Ullman, J. D. (1969) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,355
Formal Languages and their Relation to Automata
Morris, J. B. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19706 · Cited by 998
How to Construct Pseudorandom Permutations from Pseudorandom Functions
Luby, M., & Rackoff, C. (1988) · SIAM Journal on Computing · doi:10.1137/0217022 · Cited by 938
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Jerrum, M., Sinclair, A., & Vigoda, E. (2004) · Journal of the ACM · doi:10.1145/1008731.1008738 · Cited by 792
Cited by
The tao of inference in privacy-protected databases
Bindschaedler, V., Grubbs, P., Cash, D., Ristenpart, T., & Shmatikov, V. (2018) · Proceedings of the VLDB Endowment · doi:10.14778/3236187.3236217 · Cited by 75
Self-citationZhang, Y., Zhao, R., Zhang, Y., Lan, R., & Chai, X. (2022) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2022.04.001 · Cited by 57
Adjusted NPCR and UACI Reference Values for STL Files under IEEE-754 Validity Constraints
Troev, T., & Stoyanov, B. (2026) · doi:10.20944/preprints202606.1723.v1 · Cited by 1
Metadata
- Authors
- Bellare, M., Ristenpart, T., Rogaway, P., & Stegers, T.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2009
- Pages
- 295-312
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1673464365
- Cited by
- 274
- References
- 24
- FWCI
- 9.17
- Type
- conference paper
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Format-Preserving Encryption. https://app.cochat.ai/papers/10.1007/978-3-642-05445-7_19
- The paper
- Bellare, M., Ristenpart, T., Rogaway, P., & Stegers, T. (2009). Format-Preserving Encryption. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-05445-7_19
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
