Robust and Efficient Sharing of RSA Functions
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Cited by
Zhou, L., & Haas, Z. J. (1999) · IEEE Network · doi:10.1109/65.806983 · Cited by 2,333
Practical Threshold Signatures
Shoup, V. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_15 · Cited by 874
A secure and optimally efficient multi‐authority election scheme
Cramer, R., Gennaro, R., & Schoenmakers, B. (1997) · European Transactions on Telecommunications · doi:10.1002/ett.4460080506 · Cited by 784
Self-citation(1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5 · Cited by 783
Providing robust and ubiquitous security support for mobile ad-hoc networks
Jiej, Petros, Z., Luo, H., Lu, S., & Zhang, L. (2001) · Proceedings Ninth International Conference on Network Protocols ICNP 2001 ICNP-01 · doi:10.1109/icnp.2001.992905 · Cited by 688
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
Self-citationRobust Threshold DSS Signatures
Gennaro, R., Jarecki, S., Krawczyk, H., & Rabin, T. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_31 · Cited by 427
Self-citationSelf-securing ad hoc wireless networks
Luo, H., Zerfos, P., Kong, J., Lu, S., & Zhang, L. (2003) · Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications · doi:10.1109/iscc.2002.1021731 · Cited by 358
A Secure and Optimally Efficient Multi-Authority Election Scheme
Cramer, R., Gennaro, R., & Schoenmakers, B. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_9 · Cited by 357
Self-citationSharing Decryption in the Context of Voting or Lotteries
Fouque, P.-A., Poupard, G., & Stern, J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45472-1_7 · Cited by 312
Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
Camenisch, J., & Michels, M. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_8 · Cited by 299
URSA: Ubiquitous and Robust Access Control for Mobile Ad Hoc Networks
Luo, H., Kong, J., Zerfos, P., Lu, S., & Zhang, L. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2004.838598 · Cited by 294
COCA: A secure distributed online certification authority
Zhou, L., Schneider, F. B., & Van Renesse, R. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571638 · Cited by 278
A simplified approach to threshold and proactive RSA
Rabin, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055722 · Cited by 262
Self-citationSecuring threshold cryptosystems against chosen ciphertext attack
Shoup, V., & Gennaro, R. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054113 · Cited by 257
Self-citationProactive public key and signature systems
Herzberg, A., Jakobsson, M., Jarecki, S., Krawczyk, H., & Yung, M. (1997) · Proceedings of the 4th ACM conference on Computer and communications security · doi:10.1145/266420.266442 · Cited by 253
Self-citationPESTO: Proactively Secure Distributed Single Sign-On, or How to Trust a Hacked Server
Baum, C., Frederiksen, T., Hesse, J., Lehmann, A., & Yanai, A. (2020) · 2020 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp48549.2020.00044 · Cited by 49
Metadata
- Authors
- Gennaro, R., Jarecki, S., Krawczyk, H., & Rabin, T.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1996
- Pages
- 157-172
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1928188623
- Cited by
- 189
- References
- 2
- FWCI
- 10.30
- Type
- conference paper
- Language
- en
- Open access
- closed
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.