• Digital Contents
• /
• no.4 s.71
• /
• pp.40-43
• /
• 1999

디렉토리, 포틀(portals), 게이트웨이, 네비게이션 서비스, 이러한 명칭처럼 웹사이트에는 매주 새로운 것이 등장하고 있다. 모든 대형 회사들은 자신의 사이트를 직접 개설하거나 사이트의 한 구획을 사용하고 있다. 왜많은 기업들이 자신의 사이트를 가지려고 하겠는가? 1994년 스탠포드 대학 전자공학부에서 박사과정을 공부하던 두 사람이 인터넷상에서 자신들이 개인적으로 관심을 가졌던 것들의 경로를 기록하기 시작했기 때문이다. 이들의 목록은 Yahoo!(야후, Yet Another Hierarchical Officious Oracle)로 성장했다.

• Sim-seong Yeon-gu
• /
• v.38 no.2
• /
• pp.305-307
• /
• 2023

• Sim-seong Yeon-gu
• /
• v.38 no.2
• /
• pp.308-310
• /
• 2023

• Journal of the Korean Association of Geographic Information Studies
• /
• v.13 no.4
• /
• pp.1-11
• /
• 2010

This study proposed the method for the SWMM data generation connected with the spatial database and designed the data model in order to display flooding information such as the runoff sewer system, flooding areas and depth. A variety of data, including UIS, documents related to the disasters, and rainfall data are used to generate the attributes for flooding analysis areas. The spatial data is constructed by the ArcSDE and Oracle DB. The prototype system is also developed to display the runoff areas based on the GIS using the ArcGIS ArcObjects and spatial DB. The results will be applied to the flooding analysis based on the SWMM.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.1246-1259
• /
• 2015

Certificate-based signature (CBS) combines the advantages of both public key-based signature and identity-based signature, while saving from the disadvantages of drawbacks in both PKS and IBS. The insecure deployment of CBS under the hostile circumstances usually causes the exposure of signing key to be inescapable. To resist the threat of key leakage, we present a pairing-free key insulated CBS scheme by incorporating the idea of key insulated mechanism and CBS. Our scheme eliminates the costly pairing operations and as a matter of fact outperforms the existing key insulated CBS schemes. It is more suitable for low-power devices. Furthermore, the unforgeability of our scheme has been formally proven to rest on the discrete logarithm assumption in the random oracle model.

• Journal of Convergence for Information Technology
• /
• v.7 no.1
• /
• pp.35-42
• /
• 2017

In this paper, we propose to implement an integrated monitoring system using log data to reduce the load of analysis task of information security officer and to detect information leak in advance. To do this, we developed a transmission module between different model DBMS that transmits large amount of log data generated by the individual security system (MSSQL) to the integrated monitoring system (ORACLE), and the transmitted log data is digitized by individual and individual and researches about the continuous inspection and measures against malicious users when the information leakage symptom is detected by using the numerical data.

• Journal of applied mathematics & informatics
• /
• v.31 no.3_4
• /
• pp.425-441
• /
• 2013

In literature, several strong designated verifier signature (SDVS) schemes have been devised using elliptic curve bilinear pairing and map-topoint (MTP) hash function. The bilinear pairing requires a super-singular elliptic curve group having large number of elements and the relative computation cost of it is approximately two to three times higher than that of elliptic curve point multiplication, which indicates that bilinear pairing is an expensive operation. Moreover, the MTP function, which maps a user identity into an elliptic curve point, is more expensive than an elliptic curve scalar point multiplication. Hence, the SDVS schemes from bilinear pairing and MTP hash function are not efficient in real environments. Thus, a cost-efficient SDVS scheme using elliptic curve cryptography with pairingfree operation is proposed in this paper that instead of MTP hash function uses a general cryptographic hash function. The security analysis shows that our scheme is secure in the random oracle model with the hardness assumption of CDH problem. In addition, the formal security validation of the proposed scheme is done using AVISPA tool (Automated Validation of Internet Security Protocols and Applications) that demonstrated that our scheme is unforgeable against passive and active attacks. Our scheme also satisfies the different properties of an SDVS scheme including strongness, source hiding, non-transferability and unforgeability. The comparison of our scheme with others are given, which shows that it outperforms in terms of security, computation cost and bandwidth requirement.

• Journal of Internet Computing and Services
• /
• v.2 no.5
• /
• pp.81-91
• /
• 2001

XML is a standard markup language for exchange and storage of formed or well-formed information in World Wide Web, Because the source data of XML message for exchange of information in World Woo Web Is stored in legacy database systems. it is necessary the easier connection between XML application and database systems, In Oracle8i. 9i. informix and SQL2000. DBMS vendors extend their DBMSs for XML. This approach for the connection between XML application and database system is Platform-dependent and DBMS-dependent. Therefore it is necessary the platform- and DBMS-independent approach for the connection between XML application and database system, In this paper. we modeled a set of middleware components for relational database design based on XML DTD is modeled, Those components are modeled on object-based algorithm for connection between XML application and database system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.1
• /
• pp.414-430
• /
• 2016

Verifier-local revocation (VLR) seems to be the most flexible revocation approaches for any group signature scheme, because it just only requires the verifiers to possess some up-to-date revocation information, but not the signers. Langlois et al. (PKC 2014) proposed the first VLR group signature based on lattice assumptions in the random oracle model. Their scheme has at least Õ(n²) ⋅ log N bit group public key and Õ(n) ⋅ log N bit signature, respectively. Here, n is the security parameter and N is the maximum number of group members. In this paper, we present a simpler lattice-based VLR group signature, which is more efficient by a O(log N) factor in both the group public key and the signature size. The security of our VLR group signature can be reduced to the hardness of learning with errors (LWE) and small integer solution (SIS) in the random oracle model.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.3
• /
• pp.265-274
• /
• 2001

In this paper, we propose a content-based face retrieval system which can retrieve a face based on a facial feature region. Instead of using keyword such as a resident registration number or name for a query, the our system uses a facial image as a visual query. That is, we recognize a face based on a specific feature region including eyes, nose, and mouth. For this, we extract the feature region using the color information based on HSI color model and the edge information from wavelet transformed image, and then recognize the feature region using neural network. The proposed system is implemented on client/server environment based on Oracle DBMS for a large facial image database. In the experiment with 150 various facial images, the proposed method showed about 88.3% recognition rate.