Virtual leashing: Internet-based software piracy protection

被引:2
作者
Dvir, O [1 ]
Herlihy, M [1 ]
Shavit, NN [1 ]
机构
[1] Tel Aviv Univ, Dept Comp Sci, IL-69978 Ramat Aviv, Israel
来源
25TH IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS | 2005年
关键词
D O I
10.1109/ICDCS.2005.85
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Software-splitting is a technique for protecting software from piracy by removing code fragments from an application and placing them on a remote trusted server The server provides the missing functionality but never the missing code. As long as the missing functionality is hard to reverse-engineer the application cannot run without validating itself to the server Current software-splitting techniques scale poorly to the Internet because interactions with the remote server are synchronous: the application must frequently block waiting for a response from the server Perceptible delays due to network latency are unacceptable for many kinds of highly-reactive applications, such as games or graphics applications. This paper introduces virtual leashing, the first non-blocking software-splitting technique. Virtual leashing ensures that the application and the server communicate asynchronously, so the application's performance is independent (within reason) of large or variable network latencies. Experiments show that virtual leashing makes only modest demands on communication bandwidth, space, and computation.
引用
收藏
页码:283 / 292
页数:10
相关论文
共 8 条
[1]  
ALLIANCE BS, 2001, 7 ANN BSA GLOB SOFTW
[2]  
[Anonymous], 1989, WORKSH ALG DAT STRUC
[3]  
DETLEFS D, 1992, C C, P37
[4]  
KPALAN M, 2003, IBM CRYPTOLOPES SUPE
[5]  
Lie D, 2000, ACM SIGPLAN NOTICES, V35, P168, DOI 10.1145/384264.379237
[6]  
Sibert O, 1995, PROCEEDINGS OF THE FIRST USENIX WORKSHOP OF ELECTRONIC COMMERCE, P171
[7]  
Suh G E., 2003, AEGIS: Architecture for Tamper-Evident and Tamper-Resistant Processing
[8]   Hiding program slices for software security [J].
Zhang, XY ;
Gupta, R .
CGO 2003: INTERNATIONAL SYMPOSIUM ON CODE GENERATION AND OPTIMIZATION, 2003, :325-336