Cryptographic security for mobile code

被引:42
|
作者
Algesheimer, J [1 ]
Cachin, C [1 ]
Camenisch, J [1 ]
Karjoth, G [1 ]
机构
[1] IBM Corp, Zurich Res Lab, CH-8803 Ruschlikon, Switzerland
关键词
D O I
10.1109/SECPRI.2001.924283
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper addresses the protection of mobile code against cheating and potentially malicious hosts. We point our that the recent approach based on computing with "encrypted functions" is limited to the case where only the code originator learns the result of the computation and the host running the code must not notice anything at all. We argue that if the host is to receive some output of the computation, then securing mobile code requires minimal trust in a third party. Tamper-proof hardware installed on each host has been proposed for this purpose. In this paper we introduce a new approach for securely executing (fragments of) mobile code that relies on a minimally trusted third party. This party is a generic independent entity, called the secure computation service, which performs some operations on behalf of the mobile application, but does not learn anything about the encrypted computation. Because it is universal, the secure computation service needs to be only minimally trusted and can serve many different applications. We present a protocol based on tools from theoretical cryptography that is quire practical for computing small functions.
引用
收藏
页码:2 / 11
页数:10
相关论文
共 50 条
  • [41] Hiding cliques for cryptographic security
    Juels, A
    Peinado, M
    DESIGNS CODES AND CRYPTOGRAPHY, 2000, 20 (03) : 269 - 280
  • [42] The design of a cryptographic security architecture
    Gutmann, P
    USENIX ASSOCIATION PROCEEDINGS OF THE EIGHTH USENIX SECURITY SYMPOSIUM (SECURITY '99), 1999, : 153 - 168
  • [43] Cryptographic Security of Individual Instances
    Antunes, L.
    Laplante, S.
    Pinto, A.
    Salvador, L.
    INFORMATION THEORETIC SECURITY, 2009, 4883 : 195 - +
  • [44] On the Bit Security of Cryptographic Primitives
    Micciancio, Daniele
    Walter, Michael
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2018, PT I, 2018, 10820 : 3 - 28
  • [45] Threshold computation and cryptographic security
    Han, YN
    Hemaspaandra, LA
    Thierauf, T
    SIAM JOURNAL ON COMPUTING, 1997, 26 (01) : 59 - 78
  • [46] Opportunities for Genetic Improvement of Cryptographic Code
    Chuengsatiansup, Chitchanok
    Wagner, Markus
    Yarom, Yuval
    PROCEEDINGS OF THE 2022 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION, GECCO 2022, 2022, : 1928 - 1929
  • [47] Project TRANSPROSE:: Reconciling mobile-code security with execution efficiency
    Amme, W
    Housel, PS
    Dalton, N
    von Ronne, J
    Fröhlich, PH
    Stork, CH
    Haldar, V
    Zhenochin, S
    Franz, M
    DISCEX'01: DARPA INFORMATION SURVIVABILITY CONFERENCE & EXPOSITION II, VOL II, PROCEEDINGS, 2001, : 196 - 210
  • [48] Exploiting OS-level mechanisms to implement mobile code security
    Felmetsger, V
    Vigna, G
    ICECCS 2005: 10TH IEEE INTERNATIONAL CONFERENCE ON ENGINEERING OF COMPLEX COMPUTER SYSTEMS, PROCEEDINGS, 2005, : 234 - 243
  • [49] SECURITY RISKS IN JAVA']JAVA-BASED MOBILE CODE SYSTEMS
    Binder, Walter
    Roth, Volker
    SCALABLE COMPUTING-PRACTICE AND EXPERIENCE, 2006, 7 (04): : 1 - 11
  • [50] Security issues related to mobile code and agent-based systems
    Oppliger, R
    COMPUTER COMMUNICATIONS, 1999, 22 (12) : 1165 - 1170