Virtual IDs Research Articles

Virtual IDS as a New Paradigm for Securing the Next Generation of Vehicle Networks

Virtual IDS as a New Paradigm for Securing the Next Generation of Vehicle Networks

E-Voting System: Applied Blockchain Concept for Implementation

One framework that lowers the proportion of abstention and guarantees security against vote tampering is the electronic voting system. Blockchain is a distributed, decentralized ledger that is used to efficiently and verifiably record transactions. Voter fraud is prevented by integrating Aadhar into the electronic voting system. With the use of voter’s VIDs (virtual IDs) that are gathered from the Aadhar database and biometric information, the proposed scheme offers a secure electronic voting method. The digital signature is used as the key to encrypt the votes within the block. Due to the present surge in interest in the use of blockchain technology for several applications, including identity, money, and healthcare, more attention has been paid to the legal ramifications of this technology than to its usefulness in administration. Thus, to eliminate the drawbacks of the current Indian voting system, and provide a better, more dependable, safe, and transparent form of public governance, we can create an application utilizing blockchain as an effective option for public voting. Blockchain technology is a means of governance, not only an object of regulation and governance. The powerful cryptography used by these technological elements offers a security level that is on par with or higher than any database that has ever been known

SAPWSN: A Secure Authentication Protocol for Wireless Sensor Networks

With the advancement of RFID systems, there is a need for secure RFID authentication that can provide security against a variety of attacks, so designing a perfectly safe protocol has become a security challenge. The most remarkable security challenges may be information leakage, traceability, and tag impersonation. Several researchers have attempted to address this security demand by proposing ultra-lightweight solutions that use only very low-cost operations such as bit-wise operations. However, approximately all of the presented previous ultra-lightweight authentication schemes are vulnerable to a variety of attacks. For this purpose, Chiou and Chang recently proposed an EPC Class 1 Gen-2-based RFID authentication protocol and claimed it is resistant against replay attacks and also other known active and passive attacks. They also stated that their proposed protocol does not require features such as a secure channel, time parameters, or virtual IDs. In this paper, we will investigate the security of the Chiou and Chang authentication scheme and demonstrate that it is completely insecure. Specifically, we will present the security faults of this scheme. In addition, we will present an enhanced protocol called SAPWSN. The proposed protocol presents precise authentication and highly secure transfers. We demonstrate the proposed protocol’s security in the formal and informal methods. In the formal method, we use the Compromise version of Scyther tool.

An enhanced authentication scheme in mobile RFID system

The popularization of wireless networks and mobile applications has increased the importance of RFID technologies. However, since wireless networks does not guarantee transmission channel security, putting private user information at risk for unintentional disclosure. Previous research has introduced a security mechanism to provide privacy and authentication. This mechanism is based on quadratic residue, does not require a secure channel and fits EPC Class-1 Gen-2 specifications. However, this mechanism cannot resist replay attacks, and lacks an efficient means of its server is not able to find determining validating values, making it difficult to implement. This paper proposes an improvement scheme that uses virtual IDs and time parameters. It does not need a secure channel, fits EPC Class-1 Gen-2 specifications, is resistant to replay attacks, and can efficiently find validation information. The proposed scheme is applied to mobile devices as a proof of concept for use in wireless/mobile RFID systems.

Eagle+: A fast incremental approach to automaton and table online updates for cloud services

Automaton or table-based multi-pattern matching methods have been widely used in cloud services, i.e., virtual Firewall service, virtual IDS service, etc. In cloud, a large scale of patterns in such services are frequently updated causing by users’ joining or quitting and adjustment of security and management policies. Therefore, how to quickly and accurately update the Automaton and Table becomes an important issue. In this paper, we propose Eagle+, an incremental approach for updating the matching Automaton and Table whilst avoiding recalculating the whole patterns after each change. In Eagle+, we attain efficiency by computing only the latest update set of patterns when updating the Automaton and Table. Moreover, Eagle+ achieves accurately local updating based on three atomic operations, adding, updating and deleting, each of which modifies values on classical Aho–Corasick (AC) automaton, Set Backward Oracle Matching (SBOM) automaton and Wu–Manber (WM) table. Compared with existing pattern updating methods, Eagle+ reduces the computation complexity from O(n2) to O(n). The experimental results show that Eagle+ can save nearly 72%–92% of the time consumption in updating automatons and perform 100X faster in WM table.

A small and power efficient checkpoint core architecture for manycore processors

This article describes and evaluates a small, out-of-order, simultaneous multithreaded SMT core architecture suitable for power constrained microprocessors, such as manycore microprocessors for high performance computing. The architecture does not require a reorder buffer ROB or physical registers for register renaming and instruction retirement. Instead, it uses a large number of virtual register IDs for register renaming, and a logical register file with multiple contexts. The architecture improves total thread execution throughput using two register contexts to support SMT execution of parallel workloads. Moreover, the architecture improves instruction level parallelism ILP and execution performance when running single-thread applications. In addition to eliminating the reorder buffer and the physical renaming register file, the architecture minimises the logical register file hardware by using the two SMT register contexts and in-cell register file context fusion mechanism for recovering from branch mispredictions. We present results from Spec 2006 benchmarks running on a SimpleScalar performance simulator of our architecture. Our simulation measurements show 5% single-thread performance improvement and 9.6% 2-thread SMT performance improvement over a conventional SMT core architecture with reorder buffer.

익명 게시판 환경에서 가상 아이디를 이용한 개인정보보호에 관한 연구

최근 인터넷 게시판의 실명 및 익명 사용에 대한 논쟁은 주요 이슈가 되고 있다. 실명을 사용할 경우 자유로운 토론 및 프라이버시 침해할 우려가 있는 반면에, 익명을 사용하는 경우에 있어서는 악성 댓글 폭력이라든지, 존재하지 않는 허위 사실 유포 등의 인터넷의 역기능이 나타날 수 있다. 따라서 본 논문에서는 SSO의 기술 중 하나인 XML 토큰 방식을 사용하여 개인정보의 분산을 막고 단일 로그인이 가능하게 하였고 토큰 발급 시 가상 아이디와 경로구성을 통해 익명성 및 조건부 추적이 가능한 익명 게시판을 제안 하였다. 성능분석 결과 접속자 수에 따른 인증시간에서 그룹 서명 방식을 사용한 익명 게시판은 평균 응답 속도가 0.72초, 제안하는 방식은 0.18초를 나타내었다. 즉 인증시간에서 4~5배 정도 빠른 응답 속도를 보였다. 또한 제안하는 시스템은 단일 인증을 제공하고 사용자가 서명을 하지 않아도 되기 때문에 사용자 편의성에서 월등히 뛰어나며, 익명 게시판 환경에서의 사용자 편의성은 제안하는 시스템이 더 적합함을 알 수가 있었다. The argument related to the use of real and anonymous names on the Internet bulletin board has recently become a main issue. When using real names, it is possible to violate free discussion and privacy. Also, when using anonymous names, it is possible to have the reverse function of the Internet in regard to the use of malicious replies or the distribution of false ideas. Therefore, this paper has made it possible to prevent the spread of the user's personal information and execute the single log-in process by using the XML-token method which is one of the SSO technologies. Also, by issuing virtual IDs and forming the path when establishing tokens, the anonymous bulletin board which provides anonymity with a conditional tracing process has been suggested. After analyzing the performance of visitor numbers at authentication time, the anonymous bulletin board based on the group signature method showed the average response rate of 0.72 seconds, 0.18 seconds, which was suggested scheme. In the authentication time 4-5 times faster response speed, respectively. Also, since the suggested system does not have to provide a single authentication process or make the user provide his or her signature, the level of user's convenience seems to be much higher. Such a result shows that the system suggested on the anonymous bulletin board has a more appropriate level of user's convenience.

DISTRIBUTED AND BIG DATA STORAGE MANAGEMENT IN GRID COMPUTING

Big data storage management is one of the most challenging issues for Grid computing environments, since large amount of data intensive applications frequently involve a high degree of data access locality. Grid applications typically deal with large amounts of data. In traditional approaches high-performance computing consists dedicated servers that are used to data storage and data replication. In this paper we present a new mechanism for distributed and big data storage and resource discovery services. Here we proposed an architecture named Dynamic and Scalable Storage Management (DSSM) architecture in grid environments. This allows in grid computing not only sharing the computational cycles, but also share the storage space. The storage can be transparently accessed from any grid machine, allowing easy data sharing among grid users and applications. The concept of virtual ids that, allows the creation of virtual spaces has been introduced and used. The DSSM divides all Grid Oriented Storage devices (nodes) into multiple geographically distributed domains and to facilitate the locality and simplify the intra-domain storage management. Grid service based storage resources are adopted to stack simple modular service piece by piece as demand grows. To this end, we propose four axes that define: DSSM architecture and algorithms description, Storage resources and resource discovery into Grid service, Evaluate purpose prototype system, dynamically, scalability, and bandwidth, and Discuss results. Algorithms at bottom and upper level for standardization dynamic and scalable storage management, along with higher bandwidths have been designed.

Distributed and Big Data Storage Management in Grid Computing

Big data storage management is one of the most challenging issues for Grid computing environments, since large amount of data intensive applications frequently involve a high degree of data access locality. Grid applications typically deal with large amounts of data. In traditional approaches high-performance computing consists dedicated servers that are used to data storage and data replication. In this paper we present a new mechanism for distributed and big data storage and resource discovery services. Here we proposed an architecture named Dynamic and Scalable Storage Management (DSSM) architecture in grid environments. This allows in grid computing not only sharing the computational cycles, but also share the storage space. The storage can be transparently accessed from any grid machine, allowing easy data sharing among grid users and applications. The concept of virtual ids that, allows the creation of virtual spaces has been introduced and used. The DSSM divides all Grid Oriented Storage devices (nodes) into multiple geographically distributed domains and to facilitate the locality and simplify the intra-domain storage management. Grid service based storage resources are adopted to stack simple modular service piece by piece as demand grows. To this end, we propose four axes that define: DSSM architecture and algorithms description, Storage resources and resource discovery into Grid service, Evaluate purpose prototype system, dynamically, scalability, and bandwidth, and Discuss results. Algorithms at bottom and upper level for standardization dynamic and scalable storage management, along with higher bandwidths have been designed.

Security Improvement of Authentication Method Using Transfer Agent in USN

USN is a technology to detect human external environment. It is an important factor in buildinga ubiquitous computing environment. In this thesis, an authentication method was proposed to allow the sensor nodes, which have weak computing operation capability, to safely communicate with each other in USN and guarantee the anonymity of users for their privacy. In the proposed authentication method that takes into account the characteristics of sensor network, sensor nodes based on a symmetric key algorithm do not transfer keys directly, instead, they mix the random numbers received from AS to generate keys necessary for communications, having a master key and a pseudo-random number generator.In addition, in this thesis, TA was adopted to minimize the leakage of users' information, and a scheme through which virtual IDs received from AS are delivered to sensor nodes was applied to improve anonymity.

Fault-tolerant semifast implementations of atomic read/write registers

This paper investigates time-efficient implementations of atomic read–write registers in message-passing systems where the number of readers can be unbounded. In particular we study the case of a single writer, multiple readers, and S servers, such that the writer, any subset of the readers, and up to t servers may crash. A recent result of Dutta et al. [P. Dutta, R. Guerraoui, R.R. Levy, A. Chakraborty, How fast can a distributed atomic read be? In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing, 2004, pp. 236–245] shows how to obtain fast implementations in which both reads and writes complete in one communication round-trip, under the constraint that the number of readers is less than S t − 2 , where t < S 2 . In that same paper the authors pose a question of whether it is possible to relax the bound on readers, and at what cost, if semifast implementations are considered, i.e., implementations that have fast reads or fast writes. This paper provides an answer to this question. It is shown that one can obtain implementations where all writes are fast, i.e., involving a single communication round-trip, and where reads complete in one to two communication round-trips under the assumption that no more than t < S 2 servers crash. Simulated scenarios included in this paper indicate that only a small fraction of reads require a second communication round-trip. Interestingly the correctness of the implementation does not depend on the number of concurrent readers in the system. The solution is obtained with the help of non-unique virtual ids assigned to each reader, where the readers sharing a virtual id form a virtual node. For the proposed definition of semifast implementations it is shown that implementations satisfying certain assumptions are semifast if and only if the number of virtual ids in the system is less than S t − 2 . This result is proved to be tight in terms of the required communication. It is shown that only a single complete two communication round-trip read operation may be necessary for each write operation. It is furthermore shown that no semifast implementation exists for the multi-reader, multi-writer model.