International Conferences: Information Networking (ICOIN), 2015, Cambodia

	International Conferences: Information Networking (ICOIN), 2015, Cambodia

The 29th edition of the International Conference on Information Networking (ICOIN) was originally started under the name of Joint Workshop on Computer Communication in 1986. ICOIN 2015 took place in Siem Reap, Cambodia, under the organization of Korea Institute of Information Scientists and Engineers (KIISE) on 12-14 Jan. 2015.  Conference topics included computer communications, wireless/mobile networks, and converged networks in both theoretical and applied aspects.  

Lima, D.S.; Paula, M.R.P.; Roberto, F.M.; Ribeiro Cardoso, A.; Celestino Junior, J., "ProbT: A Temporal Probabilistic Protocol To Mitigate The Broadcast Storm Problem In Vanets," Information Networking (ICOIN), 2015 International Conference on, pp. 7, 12, 12-14 Jan. 2015. doi: 10.1109/ICOIN.2015.7057848
Abstract: VANETs are self-organized networks in which their constituent nodes are vehicles. They can be classified as a subcategory of MANETs. Due to their special characteristics, they demand protocols designed specifically for their scenario of action. Different types of applications can be created for VANETs such as security protocols, traffic management, systems maintenance, comfort for drivers and passengers, and others. In general, applications developed for VANETs make use of broadcast information. However, there are many issues to be considered. One of the central problems is the broadcast storm. In this paper we propose a temporal probabilistic protocol, named ProbT, to mitigate the broadcast storm problem. The ProbT performance was measured and compared to the protocols Blind Flooding, Weighted p-Persistence, AutoCast and Irresponsible Forwarding. Based on the results, the ProbT shows a good performance when compared to the mentioned protocols.
Keywords: broadcast communication; probability; protocols; vehicular ad hoc networks; MANET; ProbT protocol; VANET; autocast forwarding; blind flooding; broadcast storm problem; irresponsible forwarding; maintenance system; security protocol; self-organized network; temporal probabilistic protocol; traffic management; weighted p-persistence; Packet loss; Probabilistic logic; Protocols; Receivers; Storms; Vehicles (ID#: 15-5108)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7057848&isnumber=7057846

Chun-Ta Li; Chin-Wen Lee; Jau-Ji Shen, "A Secure Three-Party Authenticated Key Exchange Protocol Based On Extended Chaotic Maps In Cloud Storage Service," Information Networking (ICOIN), 2015 International Conference on, pp. 31, 36, 12-14 Jan. 2015. doi: 10.1109/ICOIN.2015.7057852
Abstract: In order to guarantee secure communications in cloud storage service, we integrated the concept of session key establishment and extended chaotic maps into our proposed method which aims to allow data senders and data receivers to establish a secure common session key through a trusted cloud server over an insecure channel when they wish to share the sensitive data in cloud storage service. Moreover, due to the characteristics of extended chaotic maps and session key establishment, the agreed session key is only known by the communication participants. Therefore, we propose a secure three-party authenticated key exchange protocol (3PAKE) based on extended chaotic maps in cloud storage service without using smart card and timestamp, which requires neither long-term secret keys nor symmetric cryptosystems. According to our security analysis, our proposed protocol not only can achieve many general requirements that 3PAKE protocols should fulfill but also can against various known attacks. In this paper, comparing with other 3PAKE protocols, our proposed protocol is more secure and practical for real environments.
Keywords: chaos; cloud computing; cryptographic protocols; storage management; 3PAKE protocols; cloud storage service; extended chaotic maps; secure three-party authenticated key exchange protocol; security analysis; session key establishment; trusted cloud server; Chaotic communication; Cloud computing; Cryptography; Protocols; Receivers; Servers; Cloud storage service; Extended chaotic maps; Network security; Session key; Three-party authenticated key exchange (ID#: 15-5109)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7057852&isnumber=7057846

Mesit, J.; Brust, M.R., "Secured Node-To-Node Key Agreement For Wireless Sensor Networks," Information Networking (ICOIN), 2015 International Conference on, pp. 37, 39, 12-14 Jan. 2015. doi: 10.1109/ICOIN.2015.7057853
Abstract: Sensor networks are mostly deployed in unsecured environments, thus protecting a sensor network from any attack is critical in order to maintain the health of the network. Recently, many researchers have focused on making security for sensor networks available and reliable. In this paper, a secured node-to-node key agreement protocol is proposed to generate secured communication among principle nodes A and B, a ticket granting server, and a key server. Since a sensor network is usually a resource-constrained infrastructure, it is not suitable for computationally expensive asymmetric key protocols such as public-private key cryptography. Therefore, setting up a shared key in our proposed protocol is based on a symmetric key protocol processed by two trusted agents, which are the ticket granting server and the key server. The data confidentiality, authentication, and freshness of the network security are also considered in the design of the proposed protocol.
Keywords: cryptographic protocols; private key cryptography; public key cryptography; telecommunication security; wireless sensor networks; asymmetric key protocols; data authentication; data confidentiality; key server; network security; principle nodes; public-private key cryptography; resource-constrained infrastructure; secured node-to-node key agreement protocol; symmetric key protocol; ticket granting server; wireless sensor networks; Authentication; Cryptography; Protocols; Servers; Wireless communication; Wireless sensor networks;Authentication;Confidential;Freshness;Security;Wireless sensor networks (ID#: 15-5110)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7057853&isnumber=7057846

Nagrath, P.; Aneja, S.; Purohit, G.N., "Defending Flooding Attack In Delay Tolerant Networks," Information Networking (ICOIN), 2015 International Conference on pp. 40, 45, 12-14 Jan. 2015. doi: 10.1109/ICOIN.2015.7057854
Abstract: In Delay Tolerant Networks (DTNs), routing protocols work in an environment where there is no guarantee of end to end path between source and destination. Mobility of nodes is an important factor that helps to deliver packets in DTN. Intermediate nodes receive, store and forward packets to other intermediate nodes or destination. The packets are stored in entirety at intermediate nodes even if intermediate nodes may not have path to destination. Since mobile nodes have limited buffer space and are connected intermittently, therefore, finding a node that is a good forwarder is important for delivery of messages. Probabilistic routing protocols suggest predictability measure on information stored to know which node in contact is potential forwarder in terms to deliver message to destined node. However, any malicious node in network may inject other nodes with bogus messages in order to degrade network performance. This paper presents updated metric called reputation of node which captures predictability as well as enables node in network to decide whether to accept messages from node in contact or not. When node transfers genuine messages it gains reputation as well as predictability with respect to destined node. Simulation results show that algorithm prevents flow of bogus messages in the network and thereby increases message delivery and reduces overhead in presence of malicious nodes.
Keywords: delay tolerant networks; routing protocols; telecommunication security; DTN; delay tolerant networks; flooding attack; intermediate nodes; malicious nodes; routing protocols; Delays; Floods; Logic gates; Probabilistic logic; Routing; Routing protocols; Bogus Messages; Buffer Resource; Flooding Attack; Malicious Node (ID#: 15-5111)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7057854&isnumber=7057846

Dahal, S.; Junghee Lee; Jungmin Kang; Seokjoo Shin, "Analysis On End-To-End Node Selection Probability In Tor Network," Information Networking (ICOIN), 2015 International Conference on, pp. 46, 50, 12-14 Jan. 2015. doi: 10.1109/ICOIN.2015.7057855
Abstract: Tor is an open network that helps to defend against traffic analysis and thus achieves anonymity and resisting censorship online. Nowadays many researches have been carried out to attack Tor and to break the anonymity. To deanonymize the Tor, the attacker must be able to control both the guard node and exit node of a circuit. In this paper, we present an analysis on end-to-end node selection probability when an attacker adds different types of compromised nodes in the existing Tor network. For accurate Tor simulation, we used Shadow simulator for our experiment. By extensive performance evaluation, we conclude that when guard + exit flagged compromised nodes are added to Tor network, the selection probability of compromised nodes gets higher.
Keywords: computer network security; probability; telecommunication network routing; Shadow simulator; Tor network; Tor simulation; compromised nodes ;end-to-end node selection probability; online anonymity; online censorship resistance; open network; selection probability; traffic analysis; Bandwidth; Peer-to-peer computing; Privacy; Relays; Routing; Security; Servers; Shadow; Tor; nodes; selection probability (ID#: 15-5112)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7057855&isnumber=7057846

Soonhwa Sung; Cheong Youn; Eunbae Kong; Jaecheol Ryou, "User Authentication Using Mobile Phones For Mobile Payment," Information Networking (ICOIN), 2015 International Conference on, pp. 51, 56, 12-14 Jan. 2015. doi: 10.1109/ICOIN.2015.7057856
Abstract: Mobile authentication systems for mobile payment often use either the Web or mobile channel individually to confirm the identity request of a remote user. Most common activity in mobile commerce is done through mobile phones. The mobile phones are vulnerable to numerous security threats due to involvement of valuable financial and personal information.To provide secure Web transactions using mobile phones, multifactorial authentication techniques are preferred. In former study, user authentication software technology using mobile phones, one of the multifactorial authentication techniques, can potentially be copied to another device. For the solution of the problem, this paper proposes Transaction Certificate Mode (TCM), a software token, which supports mutual authentication considering stolen, borrowed, and infected mobile phones for mobile payments. It uses a novel approach based on TCM to enforce a lightweight mobile security and provides a highly secure environment that is simple to use and deploy.
Keywords: authorisation; mobile commerce; mobile computing; mobile handsets; security of data; TCM; financial information; lightweight mobile security; mobile authentication systems; mobile commerce; mobile payment; mobile payments; mobile phones; multifactorial authentication techniques; personal information; remote user identity request; secure Web transactions; security threats; software token; transaction certificate mode; user authentication software technology; Authentication; Mobile communication; Mobile handsets; Protocols; Servers; Software; mobile payment protocol; mobile phone; mutual authentication; software token; transaction certificate (ID#: 15-5113)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7057856&isnumber=7057846

Nirmala, M.B.; Manjunath, A.S., "Mobile Agent Based Secure Code Update In Wireless Sensor Networks," Information Networking (ICOIN), 2015 International Conference on, pp. 75, 80, 12-14 Jan. 2015. doi: 10.1109/ICOIN.2015.7057860
Abstract: Most of the sensor nodes are battery powered and energy utilization is one of the important criteria. At the same time Securing code update is very much essential for military, health care and environmental applications. But to send the code updates in a distributed, multihop sensor networks, most of the energy will be consumed in forwarding the packets to next hop sensor nodes. In order to avoid this and save energy consumption at sensor nodes, a small number of mobile agents are used to distribute the code. Mobile agents traverse along the desired path to disseminate the code. Sensor nodes have to authenticate the mobile agent and at the same time they have to check the integrity of the packets. Mobile agents are more vulnerable for adversaries, hence measures are taken to detect the attacks and rectify them. Secure code update using mobile agents provides confidentiality and immediate authentication. This protocol is implemented on Tiny OS platform, tested using Tossim simulator and evaluated the Performance.
Keywords: mobile agents; telecommunication computing; telecommunication security; wireless sensor networks; Tiny OS platform; Tossim simulator; mobile agent based secure code update; multihop sensor networks; wireless sensor networks; Authentication; Base stations; Cryptography; Energy consumption; Mobile agents; Protocols; Wireless sensor networks; Code update; Mobile Agent; Security; TinyOS; Wireless Sensor Networks (ID#: 15-5114)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7057860&isnumber=7057846

Win-Bin Huang; Wei-Tsung Su, "Identity-Based Access Control For Digital Content Based On Ciphertext-Policy Attribute-Based Encryption," Information Networking (ICOIN), 2015 International Conference on, pp. 87, 91, 12-14 Jan. 2015. doi: 10.1109/ICOIN.2015.7057862
Abstract: Digital content is easily spread out in the era of cloud computing. However, the challenge is providing an identity-based access control mechanism to carry out the rating system for preventing specific digital content from being obtained by inappropriate users. In this paper, we proposed a novel identity-based access control approach for digital content based on ciphertext-policy attribute-based encryption (iDAC). In iDAC, the access control still works even the digital content is duplicated to another content server. Moreover, only one copy of encrypted digital content is required to share with multiple users. This could efficiently reduce the overhead of content servers. As shown in our performance analysis with respect of security, space complexity, and time complexity, iDAC outperforms the traditional access control list based and encryption-based access control approaches.
Keywords: authorisation; cloud computing; computational complexity; cryptography; ciphertext-policy attribute-based encryption; cloud computing; content server; digital content encryption; iDAC; identity-based access control mechanism; performance analysis; security; space complexity; time complexity; Access control; Encryption; Servers; Time complexity; access control ;ciphertext-policy attribute-based encryption; identity-based; rating system (ID#: 15-5115)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7057862&isnumber=7057846

Mowla, N.I.; Inshil Doh; Kijoon Chae, "An Efficient Defense Mechanism For Spoofed IP Attack In SDN Based CDNi," Information Networking (ICOIN), 2015 International Conference on, pp. 92, 97, 12-14 Jan. 2015. doi: 10.1109/ICOIN.2015.7057863
Abstract: In recent years enhancing the capability of network services automatically and dynamically through SDN and CDN/CDNi networks has become a new field of research. These future network architectures pose both a blessing and a threat in the network field. Such network architectures can optimize the overall network services by analyzing the topology, traffic paths, packet handling and so on and also can create a potential target for spoofed IP attacks. We, therefore, propose an architecture for an SDN based CDNi network to detect spoofed ip and create a defense against attacks created by them. We also propose ALTO like servers in our architecture which enable mapping a very big network to provide a summarized view. In the ALTO server we propose an additional map named the mark map as a mechanism to detect spoofed IP addresses. SDN switches are utilized to extract rules associated with the ALTO server mark map and follow a mechanism of spoofed IP detection fed to them by the SDN controller application layer.
Keywords: IP networks; telecommunication network topology; telecommunication security; ALTO server mark map; SDN based CDNi network; SDN controller application layer;SDN switches; efficient defense mechanism; network architectures; overall network services; packet handling; spoofed IP addresses; spoofed IP attacks; spoofed IP detection; topology; traffic paths; Computer architecture; Control systems; Encryption; IP networks; Servers; Topology; ALTO; Attack; CDN; CDNi; SDN; defense (ID#: 15-5116)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7057863&isnumber=7057846

Jin-Hyeok Park; Pham Ngoc Giao; Teak-Young Seung; Ki-Ryong Kwon; Kwang-Seok Moon; Gi-Chang Kwon; Suk-Hwan Lee, "Selective-Encrypted GIS Vector Map With Low Complexity," Information Networking (ICOIN), 2015 International Conference on, pp. 98, 103, 12-14 Jan. 2015. doi: 10.1109/ICOIN.2015.7057864
Abstract: Recently years, vector map has many advantages than raster map when it is used in many domains as research, education, military or digital map services. And in most cases vector map data contains confidential information which must be kept away from unauthorized users. Moreover, the producing process of a vector map is considerably complex, and the maintenance of a digital map requires substantial monetary, human resources. With the rapid development of vector map contents, a large volume of valuable vector map dataset has been illegal distributed by pirates, hackers or unauthorized users. Therefore the problem focuses on how to protect the vector map data for multimedia applications, storage and transmission. This paper presents the selective encryption algorithm for vector map protection for storage, transmission, distribution to authorized users. In proposed algorithm, we just select some values of polylines and polygons in DCT domain to encrypt by random algorithms and cryptography. Experimental results verified that proposed algorithm is effectively and security. Maps are changed whole after encryption process, and unauthorized users cannot access to copy or use them. Encrypted maps do not alter the size of file and it does not have loss accuracy. The error between original map and decrypted map is approximate zero.
Keywords: cryptography; geographic information systems; DCT domain; approximate zero; cryptography; decrypted map; digital map; encryption process; hackers; human resources; multimedia applications; multimedia storage; multimedia transmission; original map; pirates; polygons; polylines; raster map; selective encrypted GIS vector map; selective encryption algorithm; substantial monetary; unauthorized users; valuable vector map; vector map data; vector map protection; Algorithm design and analysis; Discrete cosine transforms; Encryption; Geographic information systems; Vectors; DCT; GIS vector map; digital vector map; random algorithm; selective encryption (ID#: 15-5117)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7057864&isnumber=7057846

Shi Li; Inshil Doh; Kijoon Chae, "Key Management Mechanism in ALTO/SDN based CDNi Architecture," Information Networking (ICOIN), 2015 International Conference on, pp. 110, 115, 12-14 Jan. 2015. doi: 10.1109/ICOIN.2015.7057866
Abstract: Content delivery network interconnection (CDNi) as a new interactive network which inherits all of the advantages of single CDN. Moreover, CDNs supported by different network operators can communicate with each other directly through the interfaces between them. Meanwhile, the interactivity also brings some security issues. In this paper, we propose a new CDNi communication architecture which combined with another two efficient technologies, ALTO and SDN. Based on this architecture, a key generation and distribution mechanism is also proposed to ensure the security communication of content in CDNi. From the analysis result, we can proof that it is scarcely possible for attackers to break our security system.
Keywords: computer network security; optimisation; software defined networking; telecommunication traffic; ALTO-SDN based CDNi communication architecture; application-layer traffic optimization; content communication security; content delivery network interconnection; interactive network; key distribution mechanism; key management mechanism; software defined networking; Computer architecture; Equations; Routing; Security; Servers; Symmetric matrices; Vectors; ALTO service; CDNi; Key management; SDN; Security (ID#: 15-5118)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7057866&isnumber=7057846

Techapanupreeda, C.; Chokngamwong, R.; Thammarat, C.; Kungpisdan, S., "An Accountability Model For Internet Transactions," Information Networking (ICOIN), 2015 International Conference on, pp. 127,132, 12-14 Jan. 2015. doi: 10.1109/ICOIN.2015.7057869
Abstract: Internet transaction is increasing significantly due to very fast grown of mobile devices, electronic commerce, and electronic records. Many researchers proposed several protocols to analyze the accountability in Internet transaction. In this paper we propose accountability model and protocol in Internet transaction that have advantages over existing protocols and satisfies essential security properties: Confidentiality, Integrity, Authorization, Authentication, Non-repudiation, Liability and Responsiveness. The protocol is designed using asymmetric cryptography and hash function to ensure that it meets all above accountability properties. The proposed protocol is also analyzed and compared with existing accountability protocols.
Keywords: Internet; cryptographic protocols; electronic commerce; mobile computing; mobile handsets; Internet transactions; accountability model; accountability properties; accountability protocols; asymmetric cryptography; electronic commerce; electronic records; hash function; mobile devices security properties; Authentication; Authorization; Electronic commerce; Internet; Protocols; Public key; Accountability; Liability; Network Security; Payment Protocol; Responsiveness; Security Protocols (ID#: 15-5119)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7057869&isnumber=7057846

Thammarat, C.; Chokngamwong, R.; Techapanupreeda, C.; Kungpisdan, S., "A Secure Lightweight Protocol For NFC Communications With Mutual Authentication Based On Limited-Use Of Session Keys," Information Networking (ICOIN), 2015 International Conference on, pp. 133, 138, 12-14 Jan. 2015. doi: 10.1109/ICOIN.2015.7057870
Abstract: Nowadays, mobile phones are equipped with enhanced short-range communication functionality called Near Field Communication (or NFC for short). NFC requires no pairing between devices and suitable for transferring small amount of data in very limited area. A number of researchers proposed authentication techniques for NFC communications but they still lack some necessary security properties, especially mutual authentication.. This paper introduces new authentication protocols for NFC communication that provides mutual authentication between connecting devices. Mutual authentication is a security property that prevents replay and man-in-the-middle attack. The proposed protocols deploy limited-use offline session key generation and distribution technique to enhance security and importantly make our protocol lightweight.
Keywords: computer network security; cryptographic protocols; mobile radio; near-field communication; NFC communication authentication technique; data transfer; enhanced short-range communication functionality; man-in-the-middle attack; mobile phone; mutual authentication protocol; near field communication security enhancement; offline session key distribution technique limited-use; offline session key generation limited-use; secure lightweight protocol; Authentication; Encryption; Mobile handsets; Protocols; Servers; Cryptographic protocols; Mutual Authentication; NFC; Near Field Communications; Network Security; Security Protocols (ID#: 15-5120)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7057870&isnumber=7057846

Nhu-Ngoc Dao; Junho Park; Minho Park; Sungrae Cho, "A Feasible Method To Combat Against DDoS Attack In SDN Network," Information Networking (ICOIN), 2015 International Conference on, pp. 309, 311, 12-14 Jan. 2015. doi: 10.1109/ICOIN.2015.7057902
Abstract: In Software Defined Network, the controller is so vulnerable to flooding attack. By injecting spoofed request packets continuously, attackers make a burdensome process to the controller, cause bandwidth occupation in the controller-switch channel, and overload the flow table in switch. The final target of attackers is to downgrade or even shutdown the stability and quality of service of the network. In this paper, we introduce a feasible method to protect the network against Distributed Denial of Service attacks more effectively.
Keywords: computer network security; quality of service; software defined networking; telecommunication switching; DDoS attack; SDN network; bandwidth occupation; controller-switch channel; distributed denial of service attacks; flooding attack; flow table; network stability; quality of service; software defined network; spoofed request packet injection; Bandwidth; Computer crime; IP networks; Radiation detectors; Switches; DDoS; DoS; Openflow; SDN (ID#: 15-5121)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7057902&isnumber=7057846

SunWook Nam; Dohyung Kim; Ikjun Yeom, "Content Verification in Named Data Networking," Information Networking (ICOIN), 2015 International Conference on, pp. 414, 415, 12-14 Jan. 2015. doi: 10.1109/ICOIN.2015.7057931
Abstract: It is crucial to guarantee content integrity in Named Data Networking(NDN), where copies of the contents are distributed over the network. NDN adopts digital signatures, and contents are verified whenever they are stored in caches. However, the current scheme is not practical in practice since its operations incur too much overhead. In this paper, we suggest a simple but effective solution for content verification in NDN.
Keywords: Internet; digital signatures; NDN; content verification; digital signatures; named data networking; Bandwidth; Computational modeling; Delays; Educational institutions; Electronic mail; Security; Topology (ID#: 15-5122)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7057931&isnumber=7057846

Nguyen Tri, H.T.; Kyungbaek Kim, "Assessing the Impact Of Resource Attack in Software Defined Network," Information Networking (ICOIN), 2015 International Conference on, pp. 420, 425, 12-14 Jan. 2015. doi: 10.1109/ICOIN.2015.7057934
Abstract: Software Defined Network (SDN) empowers network operators with more flexibility to program their networks. In SDN, dummy switches on the data plane dynamically forward packets based on the rules which are managed by a centralized controller. To apply the rules, switches need to write the rules in its flow table. However, because the size of the flow table is limited, a scalability problem can be an issue. Also, this scalability problem becomes a security issue related to Distributed Denial of Service (DDoS) attacks, especially the resource attack which consumes all flow tables of switches. In this paper, we explore the impact of the resource attack to a SDN network. The resource attack is emulated on the SDN with mininet and OpenDaylight, and the effect of resource attack to the SDN is deeply analyzed in the aspects of delay and bandwidth. Through the evaluation, we highlight the importance of managing the flow tables with the awareness of their size limitation. Also, we discuss solutions which can address the resource attack and their challenges.
Keywords: computer network security; resource allocation; software defined networking; Distributed Denial of Service attack; SDN network; mininet; open daylight; packet forwarding; resource attack; software defined network; Bandwidth; Control systems; Delays; Ports (Computers); Process control; Security; Servers (ID#: 15-5123)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7057934&isnumber=7057846

Yuchae Jung; Yongik Yoon, "Behavior Tracking Model In Dynamic Situation Using The Risk Ratio EM," Information Networking (ICOIN), 2015 International Conference on,  pp.  444,  448, 12-14 Jan. 2015. doi: 10.1109/ICOIN.2015.7057942
Abstract: Closed Circuit Television (CCTV) system has been popular in daily life such as traffic, airport, street and public place. The common goal of CCTV system is the prevention of crime and disorder by observing objects. In the future, smart CCTV camera combined with mobile phone will be used to protect human from crime and dangerous situations. Intelligent CCTV system in public place will monitor human behavior in real-time and transfer image data to control tower for the security purpose. In this paper, we propose an abnormal behavioral tracking model for prediction of abnormal situation by using Expectation Maximization (EM) algorithm combined with Viterbi algorithm. The tracking model will detect objects from CCTV image in dynamic environment for the prediction of dangerous situation. This tracking system has five main steps. (1) The detection of object and their environment, (2) Feature extraction from objects and situations such as human body posture, weather, and time (3) Location information such as object trajectory and area safety level (4) knowledge update and decision making (5) prediction of abnormal situation and maximized risk rates.
Keywords: behavioural sciences computing; closed circuit television; expectation-maximisation algorithm; feature extraction; object detection; object recognition; object tracking; CCTV system; Viterbi algorithm; abnormal behavioral tracking model; abnormal situation prediction; closed circuit television; decision making; expectation maximization algorithm; feature extraction; knowledge update; location information; object detection; risk rate maximisation; risk ratio EM algorithm; Computational modeling; Decision making; Event detection; Meteorology; Safety; Trajectory; Videos; CCTV; Expectation Maximization (EM); Tracking Abnormal behavior (ID#: 15-5124)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7057942&isnumber=7057846

JongWon Kim, "Designing Multi-Level Connectivity for IoT-enabled SmartX Boxes," Information Networking (ICOIN), 2015 International Conference on, pp. 462, 463, 12-14 Jan. 2015.  doi: 10.1109/ICOIN.2015.7057946
Abstract: In this paper, we discuss about a futuristic design for multi-level connectivity that plays the pivotal role in enabling IoT services employing the hyper-convergent SmartX Boxes.
Keywords: Internet of Things; ubiquitous computing; IoT services; IoT-enabled SmartX boxes; futuristic design; hyper-convergent SmartX boxes; multilevel connectivity design; Cloud computing; Computer architecture; Mobile communication; Real-time systems; Safety; Security; Internet of Things; Software-Defined Infrastructue; inter-connected box; multi-level connectivity (ID#: 15-5125)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7057946&isnumber=7057846

Louk, M.; Hyotaek Lim, "Homomorphic Encryption In Mobile Multi Cloud Computing," Information Networking (ICOIN), 2015 International Conference on, pp. 493,  497, 12-14 Jan. 2015.   doi: 10.1109/ICOIN.2015.7057954
Abstract: Multi cloud computing has become a new trend for complementing existing cloud computing today. Multi cloud computing is considered safer and more efficient in maintaining data regulation of user(s). The paper discusses the security of mobile multi cloud computing (MMC) and the advantages for mobile user(s), beside that for the data security itself cover with homomorphic encryption which predictable by many researchers as the optimum method for cloud computing environment. The implementation and evaluation of homomorphic encryption in mobile cloud computing are discussed in this paper.
Keywords: cloud computing; cryptography; mobile computing; MMC; cloud computing environment; data regulation; data security; homomorphic encryption; mobile multicloud computing; optimum method; Cloud computing; Clouds; Encryption; Mobile communication; Homomorphic Encryption; Mobile; Multi Cloud Computing; Security (ID#: 15-5126)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7057954&isnumber=7057846

Chun-Ta Li; Cheng-Chi Lee; Hua-Hsuan Chen; Min-Jie Syu; Chun-Cheng Wang, "Cryptanalysis Of An Anonymous Multi-Server Authenticated Key Agreement Scheme Using Smart Cards And Biometrics," Information Networking (ICOIN), 2015 International Conference on, pp. 498, 502, 12-14 Jan. 2015. doi: 10.1109/ICOIN.2015.7057955
Abstract: With the growing popularity of network applications, multi-server architectures are becoming an essential part of heterogeneous networks and numerous security mechanisms have been widely studied in recent years. To protect sensitive information and restrict the access of precious services for legal privileged users only, smart card and biometrics based password authentication schemes have been widely utilized for various transaction-oriented environments. In 2014, Chuang and Chen proposed an anonymous multi-server authenticated key agreement scheme based on trust computing using smart cards, password, and biometrics. They claimed that their three-factor scheme achieves better efficiency and security as compared to those for other existing biometrics-based and multi-server schemes. Unfortunately, in this paper, we found that the user anonymity of Chuang-Chen's authentication scheme cannot be protected from an eavesdropping attack during authentication phase. Moreover, their scheme is vulnerable to smart card lost problems, many logged-in users' attacks and denial-of-service attacks and is not easily reparable.
Keywords: biometrics (access control); cryptography; message authentication; smart cards; trusted computing; anonymous multiserver authenticated key agreement scheme; biometrics; cryptanalysis; denial-of-service attacks; eavesdropping attack; password authentication; smart card loss problems; trusted computing; user anonymity; Authentication; Biometrics (access control);Computer crime; Cryptography; Servers; Smart cards; Anonymity; Authentication; Biometrics; Cryptanalysis; Multi-server; Password; Smart cards (ID#: 15-5127)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7057955&isnumber=7057846

Wooguil Pak; Youngrok Cha; Sunki Yeo, "Detecting And Tracing Leaked Private Phone Number Data In Android Smartphones," Information Networking (ICOIN), 2015 International Conference on, pp. 503, 508, 12-14 Jan. 2015. doi: 10.1109/ICOIN.2015.7057956
Abstract: Easy and open development environments of Android make itself not only as the most famous platform in the world but also as the most preferred platform for malicious users. In this paper, we propose a new approach to protect the private phone number data in smartphones from leaking and stealing through malicious applications. Our approach differently deals with trusted and suspicious applications and avoids the malfunctions of applications caused by security policy. Most of outstanding feature of our approach is that it can detect the leakage of the private phone number data, trace the leaked data and finally identify which application leaked them. Furthermore, it can minimize the damage owing to the data even though it is abused for cyber-crimes.
Keywords: Android (operating system);data privacy; invasive software; smart phones; trusted computing; Android smartphones; cyber-crimes; leaked private phone number data detection; leaked private phone number data tracing; malicious applications; malicious users; security policy; suspicious applications; trusted applications; Computer crime; Computers; Databases; Educational institutions; Relays; Servers; Smart phones; Android; Detection; Private data leaks; Tracing (ID#: 15-5128)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7057956&isnumber=7057846

Note:

Articles listed on these pages have been found on publicly available internet pages and are cited with links to those pages. Some of the information included herein has been reprinted with permission from the authors or data repositories. Direct any requests via Email to news@scienceofsecurity.net for removal of the links or modifications to specific citations. Please include the ID# of the specific citation in your correspondence.