The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Proactive public key and signature systems
Abstract
Emerging applications like electronic commerce and secure communications over open networks have made clear the fundamental role of public key cryptography as a unique enabler for world-wide scale security solutions. On the other hand, these solutions clearly expose the fact that the protection of private keys is a security bottleneck in these sensitive applications. This problem is further worsened in the cases where a single and unchanged private key must be kept secret for very long time (such is the case of certification authority keys, bank and e-cash keys, etc.). One crucial defense against exposure of private keys is offered by threshold cryptography where the private key functions (like signatures or decryption) are distributed among several parties such that a predetermined number of parties must cooperate in order to correctly perform these operations. This protects keys from any single point of failure. An attacker needs to break into a multiplicity of locations before it c...
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756 · cited 3×
“We also skip the definition of secret sharing [ Sh ].”
BackgroundInfluentialA 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
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Safeguarding cryptographic keys
BLAKLEY, G. R. (1979) · 1979 International Workshop on Managing Requirements Knowledge (MARK) · doi:10.1109/mark.1979.8817296 · Cited by 3,499
The knowledge complexity of interactive proof systems
Goldwasser, S., Micali, S., & Rackoff, C. (1989) · SIAM Journal on Computing · doi:10.1137/0218012 · Cited by 3,285
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
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
Pedersen, T. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_9 · Cited by 2,448
Efficient Identification and Signatures for Smart Cards
Schnorr, C. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_22 · Cited by 1,381
Wallet Databases with Observers
Chaum, D., & Pedersen, T. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_7 · Cited by 1,292
Desmedt, Y., & Frankel, Y. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_28 · Cited by 1,131
A practical scheme for non-interactive verifiable secret sharing
Feldman, P. (1987) · 28th Annual Symposium on Foundations of Computer Science (sfcs 1987) · doi:10.1109/sfcs.1987.4 · Cited by 1,125
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
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
Herzberg, A., Jarecki, S., Krawczyk, H., & Yung, M. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-44750-4_27 · Cited by 738
Self-citationChaum, D., & van Antwerpen, H. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_20 · Cited by 605
Untraceable Off-line Cash in Wallet with Observers
Brands, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_26 · Cited by 507
How to withstand mobile virus attacks (extended abstract)
Ostrovsky, R., & Yung, M. (1991) · Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 · doi:10.1145/112600.112605 · Cited by 465
Self-citationHow to share a function securely
De Santis, A., Desmedt, Y., Frankel, Y., & Yung, M. (1994) · Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 · doi:10.1145/195058.195405 · Cited by 328
Self-citationWith microscope and tweezers: an analysis of the Internet virus of November 1988
Eichin, M. W., & Rochlis, J. A. (2003) · Proceedings. 1989 IEEE Symposium on Security and Privacy · doi:10.1109/secpri.1989.36307 · Cited by 197
Robust and Efficient Sharing of RSA Functions
Gennaro, R., Jarecki, S., Krawczyk, H., & Rabin, T. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_13 · Cited by 189
Self-citationConvertible Undeniable Signatures
Boyar, J., Chaum, D., Damgård, I., & Pedersen, T. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-38424-3_14 · Cited by 167
Maintaining Security in the Presence of Transient Faults
Canetti, R., & Herzberg, A. (2007) · Springer eBooks · doi:10.1007/3-540-48658-5_38 · Cited by 106
Self-citationWitness-based cryptographic program checking and robust function sharing
Frankel, Y., Gemmell, P. S., & Yung, M. M. (1996) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/237814.237998 · Cited by 63
Self-citationImproved digital signature scheme based on discrete exponentiation
Agnew, G. B., Mullin, R. C., & Vanstone, S. A. (1990) · Electronics Letters · doi:10.1049/el:19900663 · Cited by 58
Cited by
Kocher, P., Jaffe, J., & Jun, B. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_25 · Cited by 7,407
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
Practical byzantine fault tolerance and proactive recovery
Castro, M., & Liskov, B. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571640 · Cited by 2,475
Boldyreva, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36288-6_3 · Cited by 1,006
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
Metadata
- Authors
- Herzberg, A., Jakobsson, M., Jarecki, S., Krawczyk, H., & Yung, M.
- Venue
- Proceedings of the 4th ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 1997-04
- Pages
- 100-110
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W1983762057
- Cited by
- 253
- References
- 26
- FWCI
- 13.08
- 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.