The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Protecting Mobile Agents Against Malicious Hosts
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
(1978) · Cited by 1,875
The Complexity of Boolean Functions
Wegener, I. (1987) · Cited by 882
Advances in Cryptology — EUROCRYPT ’97
Fumy, W. (1997) · Lecture notes in computer science · doi:10.1007/3-540-69053-0 · Cited by 599
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
A new privacy homomorphism and applications
Domingo‐Ferrer, J. (1996) · Information Processing Letters · doi:10.1016/s0020-0190(96)00170-6 · Cited by 164
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
Efficient Signature Schemes Based on Birational Permutations
Adi Shamir, Z. (2007) · Springer eBooks · doi:10.1007/3-540-48329-2_1 · Cited by 121
Naccache, D., & Stern, J. (1997) · Lecture notes in computer science · doi:10.1007/3-540-69053-0_3 · Cited by 119
Boolean circuits versus arithmetic circuits
Gathen, J. V. Z., & Seroussi, G. (1991) · Information and Computation · doi:10.1016/0890-5401(91)90078-g · Cited by 40
Cited by
Watermarking, tamper-proofing, and obfuscation - tools for software protection
Collberg, C. S., & Thomborson, C. (2002) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2002.1027797 · Cited by 735
A Survey of Homomorphic Encryption for Nonspecialists
Fontaine, C., & Galand, F. (2007) · EURASIP Journal on Information Security · doi:10.1155/2007/13801 · Cited by 438
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
Trust-based security for wireless ad hoc and sensor networks
Boukerch, A., Xu, L., & EL-Khatib, K. (2007) · Computer Communications · doi:10.1016/j.comcom.2007.04.022 · Cited by 290
A Provably Secure Additive and Multiplicative Privacy Homomorphism*
Domingo-Ferrer, J. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45811-5_37 · Cited by 281
Sander, T., & Tschudin, C. F. (2002) · Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186) · doi:10.1109/secpri.1998.674837 · Cited by 252
Self-citationARRIGHI, P., & SALVAIL, L. (2006) · International Journal of Quantum Information · doi:10.1142/s0219749906002171 · Cited by 118
Security in Multi-Agent Systems
Hedin, Y., & Moradian, E. (2015) · Procedia Computer Science · doi:10.1016/j.procs.2015.08.270 · Cited by 49
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
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1998
- Pages
- 44-60
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1570296326
- Cited by
- 596
- References
- 10
- FWCI
- 25.74
- 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.