The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Key-Insulated Public Key Cryptosystems
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 · cited 2×
“Secret sharing [35], threshold cryptography [13,12], proactive cryptography [32], exposure-resilient cryptography [9] and forward-secure signatures [3,5] may all be viewed as different means of taking this approach.”
BackgroundA 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
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539701398521 · Cited by 3,528
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
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
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
Cramer, R., & Shoup, V. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055717 · Cited by 1,437
Authentication and authenticated key exchanges
Diffie, W., Van Oorschot, P. C., & Wiener, M. J. (1992) · Designs, Codes and Cryptography · doi:10.1007/bf00124891 · Cited by 1,154
Desmedt, Y., & Frankel, Y. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_28 · Cited by 1,131
A concrete security treatment of symmetric encryption
Bellare, M., Desai, A., Jokipii, E., & Rogaway, P. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646128 · Cited by 931
A Forward-Secure Digital Signature Scheme
Bellare, M., & Miner, S. K. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_28 · Cited by 591
Chor, B., Fiat, A., & Naor, M. (1994) · International Cryptology Conference · Cited by 468
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-citationFamilies of finite sets in which no set is covered by the union ofr others
Erdös, P., Frankl, P., & Füredi, Z. (1985) · Israel Journal of Mathematics · doi:10.1007/bf02772959 · Cited by 440
All-or-nothing encryption and the package transform
Rivest, R. L. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052348 · Cited by 398
Blakley, G. R., & Meadows, C. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_20 · Cited by 369
Krawczyk, H. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_12 · Cited by 359
How 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-citationCommunication complexity of secure computation (extended abstract)
Franklin, M., & Yung, M. (1992) · Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 · doi:10.1145/129712.129780 · Cited by 268
Self-citationForward-Secure Signatures with Optimal Signing and Verifying
Itkis, G., & Reyzin, L. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44647-8_20 · Cited by 262
Strong Key-Insulated Signature Schemes
Dodis, Y., Katz, J., Xu, S., & Yung, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36288-6_10 · Cited by 250
Self-citationA New Forward-Secure Digital Signature Scheme
Abdalla, M., & Reyzin, L. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44448-3_10 · Cited by 247
Exposure-Resilient Functions and All-or-Nothing Transforms
Canetti, R., Dodis, Y., Halevi, S., Kushilevitz, E., & Sahai, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_33 · Cited by 191
Self-citationSimple forward-secure signatures from any signature scheme
Krawczyk, H. (2000) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/352600.352617 · Cited by 172
Efficient Generic Forward-Secure Signatures with an Unbounded Number of Time Periods
Malkin, T., Micciancio, D., & Miner, S. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46035-7_27 · Cited by 161
Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures
Jarecki, S., & Lysyanskaya, A. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45539-6_16 · Cited by 140
On the Security Properties of OAEP as an All-or-Nothing Transform
Boyko, V. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48405-1_32 · Cited by 109
Self-delegation with controlled propagation — or — What if you lose your laptop
Goldreich, O., Pfitzmann, B., & Rivest, R. L. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055726 · Cited by 41
Cited by
Public Key Encryption with Keyword Search
Boneh, D., Di Crescenzo, G., Ostrovsky, R., & Persiano, G. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_30 · Cited by 3,134
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
Functional Encryption with Bounded Collusions via Multi-party Computation
Gorbunov, S., Vaikuntanathan, V., & Wee, H. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_11 · Cited by 294
FlipIt: The Game of “Stealthy Takeover”
van Dijk, M., Juels, A., Oprea, A., & Rivest, R. L. (2013) · Journal of Cryptology · doi:10.1007/s00145-012-9134-5 · Cited by 275
A new approach to secure logging
Ma, D., & Tsudik, G. (2009) · ACM Transactions on Storage · doi:10.1145/1502777.1502779 · Cited by 192
Metadata
- Authors
- Dodis, Y., Katz, J., Xu, S., & Yung, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 65-82
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1551969482
- Cited by
- 400
- References
- 27
- FWCI
- 15.77
- 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.