The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
Open accessOverview
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
IEEE Transactions on Information Theory
(2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.18 · Cited by 1,856
Pohlig, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055817 · Cited by 1,199
Discrete logarithms in finite fields and their cryptographic significance
Odlyzko, A. M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39757-4_20 · Cited by 367
Fast evaluation of logarithms in fields of characteristic two
Coppersmith, D. (1984) · IEEE Transactions on Information Theory · doi:10.1109/tit.1984.1056941 · Cited by 297
A subexponential algorithm for the discrete logarithm problem with applications to cryptography
Adleman, L. (1979) · 20th Annual Symposium on Foundations of Computer Science (sfcs 1979) · doi:10.1109/sfcs.1979.2 · Cited by 242
An efficient signature scheme based on quadratic equations
Ong, H., Schnorr, C. P., & Adi Shamir, Z. (1984) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800057.808683 · Cited by 82
A Monte Carlo Factoring Algorithm With Linear Storage
Schnorr, C. P., & Lenstra, H. W. (1984) · Mathematics of Computation · doi:10.1090/s0025-5718-1984-0744939-5 · Cited by 70
Cited by
Koblitz, N. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0866109-5 · Cited by 5,634
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
Security Arguments for Digital Signatures and Blind Signatures
Pointcheval, D., & Stern, J. (2000) · Journal of Cryptology · doi:10.1007/s001450010003 · Cited by 2,209
Improved proxy re-encryption schemes with applications to secure distributed storage
Ateniese, G., Fu, K., Green, M., & Hohenberger, S. (2006) · ACM Transactions on Information and System Security · doi:10.1145/1127345.1127346 · Cited by 1,475
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
Camenisch, J., & Lysyanskaya, A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_7 · Cited by 1,321
Bernstein, D. J., & Lange, T. (2017) · Nature · doi:10.1038/nature23461 · Cited by 1,242
Efficient group signature schemes for large groups: Extended abstract
Camenisch, J., & Stadler, M. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052252 · Cited by 1,083
Security and Privacy on Blockchain
Zhang, R., Xue, R., & Liu, L. (2020) · ACM Computing Surveys · doi:10.1145/3316481 · Cited by 959
A Threshold Cryptosystem without a Trusted Party
Pedersen, T. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46416-6_47 · Cited by 777
Oblivious Neural Network Predictions via MiniONN Transformations
Liu, J., Juuti, M., Lu, Y., & Asokan, N. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134056 · Cited by 691
Charm: a framework for rapidly prototyping cryptosystems
Akinyele, J. A., Garman, C., Miers, I., Pagano, M. W., Rushanan, M., Green, M., & Rubin, A. D. (2013) · Journal of Cryptographic Engineering · doi:10.1007/s13389-013-0057-3 · Cited by 675
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
Girault, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46416-6_42 · Cited by 479
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
Gennaro, R., Rabin, M. O., & Rabin, T. (1998) · Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 · doi:10.1145/277697.277716 · Cited by 464
Secure audit logs to support computer forensics
Schneier, B., & Kelsey, J. (1999) · ACM Transactions on Information and System Security · doi:10.1145/317087.317089 · Cited by 443
Secure Distributed Key Generation for Discrete-Log Based Cryptosystems
Gennaro, R., Jarecki, S., Krawczyk, H., & Rabin, T. (2007) · Journal of Cryptology · doi:10.1007/s00145-006-0347-3 · Cited by 428
A New Randomness Extraction Paradigm for Hybrid Encryption
Kiltz, E., Pietrzak, K., Stam, M., & Yung, M. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01001-9_34 · Cited by 384
Simple Functional Encryption Schemes for Inner Products
Abdalla, M., Bourse, F., De Caro, A., & Pointcheval, D. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46447-2_33 · Cited by 379
CATalyst: Defeating last-level cache side channel attacks in cloud computing
Liu, F., Ge, Q., Yarom, Y., Mckeen, F., Rozas, C., Heiser, G., & Lee, R. B. (2016) · 2016 IEEE International Symposium on High Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2016.7446082 · Cited by 370
Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption
Libert, B., & Vergnaud, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78440-1_21 · Cited by 339
Survey on Fully Homomorphic Encryption, Theory, and Applications
Marcolla, C., Sucasas, V., Manzano, M., Bassoli, R., Fitzek, F. H. P., & Aaraj, N. (2022) · Proceedings of the IEEE · doi:10.1109/jproc.2022.3205665 · Cited by 323
A Conceptual Secure Blockchain Based Electronic Voting System
Ben Ayed, A. (2017) · International Journal of Network Security & Its Applications · doi:10.5121/ijnsa.2017.9301 · Cited by 315
Threshold Ring Signatures and Applications to Ad-hoc Groups
Bresson, E., Stern, J., & Szydlo, M. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_30 · Cited by 311
Smart Meter Data Privacy: A Survey
Asghar, M. R., Dan, G., Miorandi, D., & Chlamtac, I. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2720195 · Cited by 307
Efficient Trace and Revoke Schemes
Naor, M., & Pinkas, B. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45472-1_1 · Cited by 298
Privacy Preserving Deep Computation Model on Cloud for Big Data Feature Learning
Zhang, Q., Yang, L. T., & Chen, Z. (2016) · IEEE Transactions on Computers · doi:10.1109/tc.2015.2470255 · Cited by 286
Digital signatures for flows and multicasts
Wong, C. K., & Lam, S. S. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.793005 · Cited by 281
Hazay, C., & Lindell, Y. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78524-8_10 · Cited by 267
Yang, Q., Liu, Y., Cheng, Y., Kang, Y., Chen, T., & Yu, H. (2019) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s00960ed2v01y201910aim043 · Cited by 261
Efficient and Generalized Group Signatures
Camenisch, J. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_32 · Cited by 257
Cyber-security enhancement of networked control systems using homomorphic encryption
Kogiso, K., & Fujita, T. (2015) · 2015 54th IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7403296 · Cited by 253
Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms
Roetteler, M., Naehrig, M., Svore, K. M., & Lauter, K. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-70697-9_9 · Cited by 212
Security Aspects of Blockchain Technology Intended for Industrial Applications
Idrees, S. M., Nowostawski, M., Jameel, R., & Mourya, A. K. (2021) · Electronics · doi:10.3390/electronics10080951 · Cited by 127
Taxonomies for Reasoning About Cyber-physical Attacks in IoT-based Manufacturing Systems
Pan, Y., White, J., Schmidt, D., Elhabashy, A., Sturm, L., Camelio, J., & Williams, C. (2017) · International Journal of Interactive Multimedia and Artificial Intelligence · doi:10.9781/ijimai.2017.437 · Cited by 81
Energy-efficient mechanisms in security of the internet of things: A survey
Hellaoui, H., Koudil, M., & Bouabdallah, A. (2017) · Computer Networks · doi:10.1016/j.comnet.2017.08.006 · Cited by 61
On Security in Publish/Subscribe Services: A Survey
Esposito, C., & Ciampi, M. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2364616 · Cited by 55
TollsOnly Please—Homomorphic Encryption for Toll Transponder Privacy in Internet of Vehicles
Karim, H., & Rawat, D. B. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3056240 · Cited by 43
Secure Architectures Implementing Trusted Coalitions for Blockchained Distributed Learning (TCLearn)
Lugan, S., Desbordes, P., Brion, E., Ramos Tormo, L. X., Legay, A., & Macq, B. (2019) · IEEE Access · doi:10.1109/access.2019.2959220 · Cited by 39
Cipher image damage and decisions in real time
Silva-García, V. M., Flores-Carapia, R., Rentería-Márquez, C., Luna-Benoso, B., Jiménez-Vázquez, C. A., & González-Ramírez, M. D. (2015) · Journal of Electronic Imaging · doi:10.1117/1.jei.24.1.013012 · Cited by 5
Exploring Bitslicing Architectures for Enabling FHE-Assisted Machine Learning
Sinha, S., Saha, S., Alam, M., Agarwal, V., Chatterjee, A., Mishra, A., Khazanchi, D., & Mukhopadhyay, D. (2022) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2022.3204909 · Cited by 4
Metadata
- Authors
- ElGamal, T.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-08-12
- Pages
- 10-18
- OpenAlex
- W1534388293
- Cited by
- 1,604
- References
- 11
- FWCI
- 34.26
- Type
- conference paper
- Language
- en
- Open access
- green
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.