The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
How to share a function securely
Abstract
Article Free Access Share on How to share a function securely Authors: Alfredo De Santis Dip. di Informatica ed Applicazioni Università di Salerno, Baronissi (SA), Italy Dip. di Informatica ed Applicazioni Università di Salerno, Baronissi (SA), ItalyView Profile , Yvo Desmedt Dept. of EE&CS, Univ. of Wisconsin Milwaukee, WI Dept. of EE&CS, Univ. of Wisconsin Milwaukee, WIView Profile , Yair Frankel GTE Laboratories Incorporated, Waltham, MA GTE Laboratories Incorporated, Waltham, MAView Profile , Moti Yung IBM T. J. Watson Research Center, Yorktown Heights, NY IBM T. J. Watson Research Center, Yorktown Heights, NYView Profile Authors Info & Claims STOC '94: Proceedings of the twenty-sixth annual ACM symposium on Theory of ComputingMay 1994 Pages 522–533https://doi.org/10.1145/195058.195405Published:23 May 1994Publication History 193citation1,775DownloadsMetricsTotal Citations193Total Downloads1,775Last 12 Months169Last 6 weeks18 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
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
B., T. A. A. (1946) · The Mathematical Gazette · doi:10.1017/s0025557200071461 · Cited by 7,129
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
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
Goldreich, O., Micali, S., & Wigderson, A. (1991) · Journal of the ACM · doi:10.1145/116825.116852 · Cited by 1,349
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
Blum, M., & Micali, S. (1984) · SIAM Journal on Computing · doi:10.1137/0213053 · Cited by 1,322
Public-key cryptosystems provably secure against chosen ciphertext attacks
Naor, M., & Yung, M. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100273 · Cited by 1,088
Self-citationDefinitions and properties of zero-knowledge proof systems
Goldreich, O., & Oren, Y. (1994) · Journal of Cryptology · doi:10.1007/bf00195207 · Cited by 614
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
Shared generation of authenticators and signatures
Desmedt, Y., & Frankel, Y. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_37 · Cited by 394
Self-citationPseudorandomness and Cryptographic Applications
Luby, M. (1996) · Princeton University Press eBooks · doi:10.1515/9780691206844 · Cited by 374
RSA and Rabin Functions: Certain Parts are as Hard as the Whole
Alexi, W., Chor, B., Goldreich, O., & Schnorr, C. P. (1988) · SIAM Journal on Computing · doi:10.1137/0217013 · Cited by 339
Rivest, R. L., Hellman, M. E., Anderson, J. C., & Lyons, J. W. (1992) · Communications of the ACM · doi:10.1145/129902.129905 · Cited by 187
A digital multisignature scheme using bijective public-key cryptosystems
Okamoto, T. (1988) · ACM Transactions on Computer Systems · doi:10.1145/48012.48246 · Cited by 145
Micali, S. M. (2007) · Springer eBooks · doi:10.1007/3-540-48071-4_9 · Cited by 142
How to securely replicate services
Reiter, M. K., & Birman, K. (1994) · ACM Transactions on Programming Languages and Systems · doi:10.1145/177492.177745 · Cited by 133
Secure and efficient off-line digital money (extended abstract)
Franklin, M. K., & Yung, M. M. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56939-1_78 · Cited by 87
Self-citationHow To Sign Given Any Trapdoor Function
Mihir Bellare, Y., & Micali, S. M. (1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2_15 · Cited by 66
How to sign given any trapdoor permutation
Mihir Bellare, Y., & Micali, S. M. (1992) · Journal of the ACM · doi:10.1145/147508.147537 · Cited by 60
Minimum-Knowledge Interactive Proofs for Decision Problems
Galil, Z., Haber, S., & Yung, M. M. (1989) · SIAM Journal on Computing · doi:10.1137/0218049 · Cited by 44
Self-citation
Cited by
Practical Threshold Signatures
Shoup, V. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_15 · Cited by 874
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-citationProviding 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
Oblivious transfer and polynomial evaluation
Naor, M., & Pinkas, B. (1999) · Proceedings of the thirty-first annual ACM symposium on Theory of Computing · doi:10.1145/301250.301312 · Cited by 629
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
Metadata
- Authors
- De Santis, A., Desmedt, Y., Frankel, Y., & Yung, M.
- Venue
- Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94
- Publisher
- ACM Press
- Published
- 1994
- Pages
- 522-533
- OpenAlex
- W2009432965
- Cited by
- 328
- References
- 25
- FWCI
- 12.91
- 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.