The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A new public key cryptosystem based on higher residues
Open accessAbstract
This paper describm a new pub~c-key cryptosystem based on the hardnxs of computing higher residuw modulo a composite MA integer.We introduce two versions of our scheme, one deterministic and the other probabi~stic.The deterministic version is practically oriented encryption amounts to a single exponentiation w.r.t. a modulus with at least 768 bits and a 160-bit exponent.Decryption can be suitably optimized so as to become less demanding than a couple RSA decryptions.Although slower than MA, the new sdeme is still reasonably competitive and has several specific applications.The probabilistic version exhibits an homomorphic encryption scheme whose expansion rate is much better than previously proposed such systems.Furthermore, it has se mantic security, relative to the hardness of computing higher residu~s for suitable moduE.
Overview
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
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
Cited by
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806
A Survey on Homomorphic Encryption Schemes: Theory and Implementation
Acar, A., Aksu, H., Uluagac, A. S., & Conti, M. (2019) · ACM Computing Surveys · doi:10.1145/3214303 · Cited by 1,397
Privacy-preserving k -means clustering over vertically partitioned data
Vaidya, J., & Clifton, C. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956776 · Cited by 626
Secure Information Aggregation for Smart Grids Using Homomorphic Encryption
Li, F., Luo, B., & Liu, P. (2010) · 2010 First IEEE International Conference on Smart Grid Communications · doi:10.1109/smartgrid.2010.5622064 · Cited by 559
Metadata
- Authors
- Naccache, D., & Stern, J.
- Venue
- Proceedings of the 5th ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 1998-11
- Pages
- 59-66
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2164409696
- Cited by
- 352
- References
- 1
- FWCI
- 6.67
- 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: A new public key cryptosystem based on higher residues. https://app.cochat.ai/papers/10.1145/288090.288106
- The paper
- Naccache, D., & Stern, J. (1998). A new public key cryptosystem based on higher residues. Proceedings of the 5th ACM conference on Computer and communications security. https://doi.org/10.1145/288090.288106
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.
