The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Towards mobile cryptography
Abstract
Mobile code technology has become a driving force for recent advances in distributed systems. The concept of the mobility of executable code raises major security problems. In this paper, we deal with the protection of mobile code from possibly malicious hosts. We conceptualize the specific cryptographic problems posed by mobile code, and we are able to provide a solution for some of these problems. We present techniques to achieve "non-interactive evaluation with encrypted functions" in certain cases and give a complete solution for this problem in important instances. We further present a way in which an agent might securely perform a cryptographic primitive-digital signing-in an untrusted execution environment. Our results are based on the use of homomorphic encryption schemes and function composition techniques.
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
(1978) · Cited by 1,875
A survey of active network research
Tennenhouse, D. L., Smith, J. M., Sincoskie, W. D., Wetherall, D. J., & Minden, G. J. (1997) · IEEE Communications Magazine · doi:10.1109/35.568214 · Cited by 1,358
The Complexity of Boolean Functions
Wegener, I. (1987) · Cited by 882
Protecting Mobile Agents Against Malicious Hosts
Sander, T., & Tschudin, C. F. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-68671-1_4 · Cited by 596
Self-citationFoundations of secure computation
DeMillo, R. A., Lipton, R. J., Dobkin, D., & Jones, A. K. (1978) · SMARTech Repository (Georgia Institute of Technology) · Cited by 462
Itinerant agents for mobile computing
Chess, D., Grosof, B., Harrison, C., Levine, D., Parris, C., & Tsudik, G. (1995) · IEEE Personal Communications · doi:10.1109/98.468361 · Cited by 402
Dense Probabilistic Encryption
Benaloh, J. (1999) · Selected Areas in Cryptography · Cited by 244
The Notion of Security for Probabilistic Cryptosystems
Micali, S., Rackoff, C., & Sloan, B. (1988) · SIAM Journal on Computing · doi:10.1137/0217025 · Cited by 161
Secure circuit evaluation: A protocol based on hiding information from an oracle
Abadi, M., & Feigenbaum, J. (1990) · Journal of Cryptology · doi:10.1007/bf02252866 · Cited by 145
Vigna, G. (1998) · Lecture notes in computer science · doi:10.1007/3-540-68671-1 · Cited by 144
Efficient Signature Schemes Based on Birational Permutations
Adi Shamir, Z. (2007) · Springer eBooks · doi:10.1007/3-540-48329-2_1 · Cited by 121
Cited by
Time Limited Blackbox Security: Protecting Mobile Agents From Malicious Hosts
Hohl, F. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-68671-1_6 · Cited by 391
Non-interactive cryptocomputing for NC/sup 1/
Sander, T., Young, A., & Yung, M. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814630 · Cited by 279
Self-citationUncheatable Distributed Computations
Golle, P., & Mironov, I. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45353-9_31 · Cited by 256
Kumari, K. A., Sharma, A., Chakraborty, C., & Ananyaa, M. (2022) · Big Data · doi:10.1089/big.2021.0012 · Cited by 36
Metadata
- Authors
- Sander, T., & Tschudin, C. F.
- Venue
- Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186)
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-27
- Pages
- 215-224
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W1859852026
- Cited by
- 252
- References
- 12
- FWCI
- 23.65
- 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.