The DOI matches its Crossref record; 29 of the 29 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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
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
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
Kocher, P. C. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_9 · Cited by 4,387
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
Cryptography and data security
Denning, D. E. (1982) · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · Cited by 1,904
Pohlig, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055817 · Cited by 1,199
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Rabin, M. O. (1979) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1,020
Factoring Integers with Elliptic Curves
Lenstra, H. W. (1987) · The Annals of Mathematics · doi:10.2307/1971363 · Cited by 974
Minimum disclosure proofs of knowledge
Brassard, G., Chaum, D., & Crépeau, C. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90005-0 · Cited by 959
A new public-key cryptosystem as secure as factoring
Okamoto, T., & Uchiyama, S. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054135 · Cited by 673
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
Goldreich, O., Micali, S., & Wigderson, A. (1986) · 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) · doi:10.1109/sfcs.1986.47 · Cited by 549
A robust and verifiable cryptographically secure election scheme
Cohen, J. D., & Fischer, M. J. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.2 · Cited by 408
Theorems on factorization and primality testing
Pollard, J. M. (1974) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100049252 · Cited by 402
Verifiable secret-ballot elections
Benaloh, J. (1987) · Cited by 380
A new identification scheme based on syndrome decoding
Stern, J. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_2 · Cited by 353
Self-citationFast Exponentiation with Precomputation
Brickell, E. F., Gordon, D. M., McCurley, K. S., & Wilson, D. B. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47555-9_18 · Cited by 236
Pfitzmann, B., & Schunter, M. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_8 · Cited by 186
Robustness Principles for Public Key Protocols
Anderson, R., & Needham, R. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-44750-4_19 · Cited by 179
A key distribution system equivalent to factoring
McCurley, K. S. (1988) · Journal of Cryptology · doi:10.1007/bf02351718 · Cited by 176
Non-interactive Public-Key Cryptography
Maurer, U. M., & Yacobi, Y. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46416-6_43 · Cited by 160
Naccache, D., & Stern, J. (1997) · Lecture notes in computer science · doi:10.1007/3-540-69053-0_3 · Cited by 119
Self-citationAn Efficient Identification Scheme Based on Permuted Kernels (extended abstract)
Shamir, A. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_54 · Cited by 110
A proposed architecture for trusted third party services
Jefferies, N., Mitchell, C. J., & Walker, M. (1996) · Lecture notes in computer science · doi:10.1007/bfb0032349 · Cited by 87
A New Identification Scheme Based on the Perceptrons Problem
Pointcheval, D. (1995) · Lecture notes in computer science · doi:10.1007/3-540-49264-x_26 · Cited by 74
Pollard, J. M. (1993) · Lecture Notes in Mathematics · doi:10.1007/bfb0091536 · Cited by 49
Securing Traceability of Ciphertexts — Towards a Secure Software Key Escrow System
Desmedt, Y. (1995) · Lecture notes in computer science · doi:10.1007/3-540-49264-x_12 · Cited by 40
On the Difficulty of Software Key Escrow
Knudsen, L. R., & Pedersen, T. P. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68339-9_21 · Cited by 20
A Generalization of Public Key Residue Cryptosystem
Park, S.-J., & Won, D. (1993) · India Software Engineering Conference · Cited by 6
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
- 29
- 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
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.