摘要: Mobile code technology has become a driving force for recent advances in distributed systems. The concept of the mobility executable raises major security problems. In this paper, we deal with protection mobile from possibly malicious hosts. We conceptualize specific cryptographic problems posed by code, and are able to provide solution some these present techniques achieve "non-interactive evaluation encrypted functions" certain cases give complete problem important instances. further way which an agent might securely perform primitive-digital signing-in untrusted execution environment. Our results based on use homomorphic encryption schemes function composition techniques.
sci-hub.se 参考文章(17)
Ronald L Rivest, Len Adleman, Michael L Dertouzos, ON DATA BANKS AND PRIVACY HOMOMORPHISMS ,(1978)
Josh Benaloh, Dense Probabilistic Encryption ,(1999)
Ingo Wegener, The Complexity of Boolean Functions ,(1991)
Mobile Object Systems Towards the Programmable Internet Springer Berlin Heidelberg. ,(1997) , 10.1007/3-540-62852-5
Martín Abadi, Joan Feigenbaum, Secure circuit evaluation Journal of Cryptology. ,vol. 2, pp. 1- 12 ,(1990) , 10.1007/BF02252866
Tomas Sander, Christian F. Tschudin, Protecting Mobile Agents Against Malicious Hosts Mobile Agents and Security. pp. 44- 60 ,(1998) , 10.1007/3-540-68671-1_4
Radu Popescu-Zeletin, Kurt Rothermel, Mobile Agents: First International Workshop, MA '97, Berlin, Germany, April, 7-8, 1997, Proceedings ,(1997)
Alfred J Menezes, Paul C van Oorschot, Scott A Vanstone, Handbook of Applied Cryptography ,(1996)
Richard Zippel, Rational function decomposition international symposium on symbolic and algebraic computation. pp. 1- 6 ,(1991) , 10.1145/120694.120695
Adi Shamir, Efficient Signature Schemes Based on Birational Permutations international cryptology conference. pp. 1- 12 ,(1993) , 10.1007/3-540-48329-2_1