-
[show abstract]
[hide abstract]
ABSTRACT: We present the design of an apparatus that creates a protected personal communication channel over computer-embedded devices. The prototype implementation of the apparatus demonstrates that it can securely and intuitively link devices with no contact with an online server while imposing low overhead.
IEEE Transactions on Consumer Electronics 03/2011; · 0.94 Impact Factor
-
[show abstract]
[hide abstract]
ABSTRACT: We present the design of an apparatus that creates a personal private communication channel over computer-embedded devices. The prototype implementation of the apparatus demonstrated that it can securely and intuitively link devices with no contact with an online server while imposing low overhead.
Consumer Electronics (ICCE), 2011 IEEE International Conference on; 02/2011
-
[show abstract]
[hide abstract]
ABSTRACT: This paper proposes a formal model of the Android permission scheme. We describe the scheme specifying entities and relationships, and provide a state-based model which includes the behavior specification of permission authorization and the interactions between application components. We also show how we can logically confirm the security of the specified system. Utilizing a theorem prover, we can verify security with given security requirements based on mechanically checked proofs. The proposed model can be used as a reference model when the scheme is implemented in a different embedded platform, or when we extend the current scheme with additional constraints or elements. We demonstrate the use of the verifiable specification through finding a security vulnerability in the Android system. To our knowledge, this is the first formalization of the permission scheme enforced by the Android framework.
Social Computing (SocialCom), 2010 IEEE Second International Conference on; 09/2010
-
[show abstract]
[hide abstract]
ABSTRACT: This paper proposes a software obfuscation mechanism in conjunction with a tamper-proof module. The proposed mechanism overcomes the limitation of software-based obfuscation techniques where an obfuscated program contains critical parameters in itself. We divide a program into two parts: an obfuscated program and secret parameters. The obfuscated program is executed on a mobile phone or a computer, and it cannot be solely analyzed. An applet in the tamper-proof module securely stores the secret parameters and assists the execution of the obfuscation program. We implemented the proposed mechanism on a mobile phone and user identify module.The experiment results provide criteria for leveraging our obfuscation mechanism to protect both small-sized and large-sized programs.
Computational Science and Engineering, 2009. CSE '09. International Conference on; 10/2009
-
[show abstract]
[hide abstract]
ABSTRACT: Since the source code of Android was released to the public, people have concerned about the security of the Android system. Whereas the insecurity of a system can be easily exaggerated even with few minor vulnerabilities, the security is not easily demonstrated. Formal methods have been favorably applied for the purpose of ensuring security in different contexts to attest whether the system meets the security goals or not by relying on mathematical proofs. In order to commence the security analysis of Android, we specify the permission mechanism for the system. We represent the system in terms of a state machine, elucidate the security needs, and show that the specified system is secure over the specified states and transitions. We expect that this work will provide the basis for assuring the security of the Android system. The specification and verification were carried out using the Coq proof assistant.
Wireless and Mobile Communications, 2009. ICWMC '09. Fifth International Conference on; 09/2009
-
[show abstract]
[hide abstract]
ABSTRACT: Copyright protection is a major issue in online content distribution services and many key-management schemes have been proposed for protecting content. Tree-based schemes aim at reducing the load on the server, and do not give consideration to that on clients. This scheme is not fully suitable for devices with low computational capacity. On the other hand, the load on clients is low in a star-based scheme. However, the load on the server becomes large in proportion to the number of clients. This structure is far from scalable. We propose a key-management scheme that is the intermediate scheme of a star-based scheme and a tree-based scheme. Then, we evaluate both the load on the server and clients in key-management scheme using the three structures. We find that the load on server and that on clients in our scheme have a relation of trade-off. We can construct optimal key-management structure satisfying system requirements using our scheme. Furthermore, the loads on both the server and clients in our scheme are lower than tree-based structure scheme under a certain condition.
Mobile Data Management, 2006. MDM 2006. 7th International Conference on; 06/2006
