• Title/Summary/Keyword: Anonymous

Search Result 435, Processing Time 0.029 seconds

IRB review points for studies utilizing paraffin blocks archived in the pathology laboratory

  • Kim, Yong-Jin;Jeong, Chang Rok;Park, Jeong Sik
    • Journal of Yeungnam Medical Science
    • /
    • v.35 no.1
    • /
    • pp.36-39
    • /
    • 2018
  • In the personalized medicine era, utilizing paraffin blocks in pathology archives for investigating human diseases has come into the limelight. This archived material with clinical data will reduce the research time and could prevent new patient recruitment to obtain tissue for research. However, the clause indicating the necessity of consent from human material providers in the Korean Bioethics and Safety Act has made the Institutional Review Board (IRB) deny permission to use paraffin blocks for research without consent, and alternatively to get the same before starting an experiment. Written consent may be waived off in studies using paraffin blocks with anonymous status or conditions not linked to personal information by applying the paragraph 3, article 16 of the current Bioethics and Safety Act. Also, the IRB should recommend researchers to preserve the blocks as medical records of patients in long-term archives.

Integration System of Opinion Mining with Anonymous Data (익명 사용자의 데이터를 포함하는 통합 오피니언 마이닝 시스템)

  • Kim, Iee-Joon;Yoon, Jae-Yeol;Lim, Ji-Yeon;Kim, Ung-Mo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.04a
    • /
    • pp.1097-1100
    • /
    • 2012
  • 지금 이 시대를 살아가는 현대인들은 엄청나게 방대한 양의 디지털 정보 속에서 살아가고 있다. 하지만 사람들은 이런 자료들에 노출되어 있다는 것을 망각하고, 많은 유용한 정보들을 자기의 것으로 만들지 못하고 스쳐 지나가고 있다. 가장 큰 문제는 그 정보를 우리는 믿을 수 있는가 이다. 그래서 본 논문에서는 어떠한 정보가 유용하고 필요한 정보인지 고를 수 있게 도울 수 있는 통합 오피니언 마이닝 시스템 흐름도를 제시하고자 한다. 또한 익명의 사용자들이 만들어내는 의견도 포함하여 자료의 풍부함을 도모한다.

Applied Practices on Blockchain based Business Application

  • Park, Bo Kyung
    • International journal of advanced smart convergence
    • /
    • v.10 no.4
    • /
    • pp.198-205
    • /
    • 2021
  • With the development of blockchain technology, the scope of blockchain applications has expanded rapidly. Blockchain decentralization allows transaction participants to make transparent and safe transactions without a third trust agency. A distributed ledger-based system enables transparent and trusted business for anonymous users. For this reason, many companies apply blockchain to various fields such as logistics, electronic voting, and real estate. Despite this interest, there are still not enough case studies confirming the potential of blockchain as a concrete business model. Therefore, it is necessary to study how blockchain technology can change the existing business model and connect it to a new business model. In this paper, we propose blockchain-based business models and workflow types in various fields such as healthcare, logistics, and energy. We also present application cases. We expect to help companies apply blockchain to their business.

Target and Swear Word Detection Using Sentence Analysis in Real-Time Chatting (실시간 채팅 환경에서 문장 분석을 이용한 대상자 및 비속어 검출)

  • Yeom, Choongseok;Jang, Junyoung;Jang, Yuhwan;Kim, Hyun-chul;Park, Heemin
    • Journal of the Semiconductor & Display Technology
    • /
    • v.20 no.1
    • /
    • pp.83-87
    • /
    • 2021
  • By the increase of internet usage, communicating online became an everyday thing. Thereby various people have experienced profanity by anonymous users. Nowadays lots of studies tried to solve this problem using artificial intelligence, but most of the solutions were for non-real time situations. In this paper, we propose a Telegram plugin that detects swear words using word2vec, and an algorithm to find the target of the sentence. We vectorized the input sentence to find connections with other similar words, then inputted the value to the pre-trained CNN (Convolutional Neural Network) model to detect any swears. For target recognition we proposed a sequential algorithm based on KoNLPY.

Implementation of an Integrated Access Control Rule Script Language and Graphical User Interface for Hybrid Firewalls (익명 통신로를 이용한 Escrow 전자화폐)

  • 김춘수;박춘식;전희종
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.9 no.1
    • /
    • pp.29-46
    • /
    • 1999
  • Most of the previous researches for the electronic cash system guarantee unconditional untraceability for the purpose of individual privacy. Such untraceable electronic cash system that only focuses on untraceability, however, has side effect such as money laundering, criminal activities. We present a escrow cash model using anonymous channel that supports not only untaceability but also crime prevention, and prove the efficiency of our scheme relative to previous escrow cash systems.

Double-Blind Compact E-cash from Bilinear Map

  • Chen, Jiyang;Lian, Bin;Li, Yongjie;Cui, Jialin;Yu, Ping;Shu, Zhenyu;Tao, Jili
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.4
    • /
    • pp.1266-1285
    • /
    • 2022
  • Compact E-cash is the first scheme which can withdraw 2l coins within 𝒪(1) operations and then store them in 𝒪(𝑙) bits. Because of its high efficiency, a lot of research has been carried out on its basis, but no previous research pay attention to the privacy of payees and in some cases, payees have the same privacy requirement as payers. We propose a double-blind compact E-cash scheme, which means that both the payer and the payee can keep anonymous while spending. In our scheme, the payer and the bank cannot determine whether the payees of two different transactions are the same one and connect the payee with transactions related to him, in this way, the privacy of the payee is protected. And our protocols disconnect the received coin from previous transaction, then, the coin can be transferred into an unspent coin which belongs to the payee. The proposed e-cash scheme is secure within y-DDHI and LRSW assumption.

Guessing Job of Anonymous user in Blog/SNS by using the Opinion Mining (오피니언 마이닝을 이용한 블로그/SNS 에서 익명 사용자의 직업 예측)

  • Yu, Jeun Kuk;Yoon, Jae Yeol;Kim, Ung-mo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.11a
    • /
    • pp.1215-1217
    • /
    • 2011
  • 최근 Blog/SNS가 새로운 커뮤니케이션 도구로 정착이 되면서 지위 고하를 막론하고 많은 사람들이 자신의 의견을 인터넷 상에 표현을 하고 있다. 이러한 많은 의견들은 다른 사람들과 의견을 교환하는 역할도 하고 있으나 여기에 신뢰할 수 없는 부정확한 정보 또한 다수 포함 되어 있다. 본 논문에서는 Blog/SNS의 익명의 사용자 직업을 추측하여 이용자로 하여금 이러한 부정확한 정보를 판단할 수 있는 하나의 수단과 이용의 판단에 근거를 제시한다. 이러한 방법을 통해 사용자는 무수한 정보들 속에서 신뢰성 있는 정보와 신뢰성이 없는 정보를 보다 정확하게 판단 할 수 있을 것이다.

Efficient Anonymous On-Demand Routing Protocol in MANET (익명성을 지원하는 효율적인 MANET On-Demand 라우팅 프로토콜)

  • Sung-Yun Lee;Hee-Kuck Oh
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.1465-1468
    • /
    • 2008
  • 모바일 에드혹 네트워크(MANET)에서 익명 라우팅을 위해 각 노드가 익명ID를 이용하여 MAC 단에서 익명으로 서로를 인증하고 네트워크 단에서 익명 라우팅 수행하는 AODV 기반의 라우팅 기법이 제안된바 있다[4]. 하지만 기존의 제안된 방법은 익명ID가 변경될 때마다 페어링 연산을 통해 재인증을 해야 하며, 라우팅 경로 중간의 노드들은 메시지의 연결성을 없에게 위해 매홉마다 암·복호화를 반복하여 상당히 비효율적이다. 본 논문은 기존논문의 노드 인증 기법을 확장하여 실제 메시지의 교환과정에서 일어나는 홉 간 암호화 횟수를 줄이고, 임시 인증값을 이용한 노드 상호간의 빠른 인증 기법을 사용하여 노드간의 인증과 익명성을 보장하는 보다 효율적인 프로토콜을 제안한다.

Network Security Practices through Anonymity

  • Smitha, G R;Suprith C Shekar;Ujwal Mirji
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.4
    • /
    • pp.155-162
    • /
    • 2024
  • Anonymity online has been an ever so fundamental topic among journalists, experts, cybersecurity professionals, corporate whistleblowers. Highest degree of anonymity online can be obtained by mimicking a normal everyday user of the internet. Without raising any flags of suspicion and perfectly merging with the masses of public users. Online Security is a very diverse topic, with new exploits, malwares, ransomwares, zero-day attacks, breaches occurring every day, staying updated with the latest security measures against them is quite expensive and resource intensive. Network security through anonymity focuses on being unidentifiable by disguising or blending into the public to become invisible to the targeted attacks. By following strict digital discipline, we can avoid all the malicious attacks as a whole. In this paper we have demonstrated a proof of concept and feasibility of securing yourself on a network by being anonymous.

Simplified ANonymous Dynamic Source Routing Scheme for Ad-hoc Networks (SANDSR) (애드혹 네트워크에서의 간소화된 익명성 DSR 기법)

  • Kong, Chun-Um;Choo, Hyun-Seung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.05a
    • /
    • pp.1102-1103
    • /
    • 2007
  • 적대적이고 급변하는 애드혹 네트워크에서 각 노드들은 항상 적대적인 공격자들로부터 위조나 변조의 공격을 받을 수 있어서 통신 내용과 경로의 보안성이 필요하다. AnonDSR 기법은 보안성을 유지하면서 익명성을 효율적으로 보장하는 것으로 알려져 있지만 기존 기법에 비해 암호키를 설립하는 추가적인 절차를 수행하므로 통신 수행시간이 길어지는 문제가 발생한다. 제안 기법에서는 암호키 설립 단계와 통신경로를 설정하는 단계를 동시 수행하고 데이터 전송시에는 공유키로 암호화를 추가적으로 수행해서 보안 강도를 높인다. 결과적으로 제안기법은 AnonDSR 에 비해 매번 통신 수행시간이 최대 31% 향상되고 보안성도 강화된다.