• Title/Summary/Keyword: keys

Search Result 1,083, Processing Time 0.031 seconds

ON MULTI-AUTHORITY CIPHERTEXT-POLICY ATTRIBUTE-BASED ENCRYPTION

  • Muller, Sascha;Katzenbeisser, Stefan;Eckert, Claudia
    • Bulletin of the Korean Mathematical Society
    • /
    • v.46 no.4
    • /
    • pp.803-819
    • /
    • 2009
  • In classical encryption schemes, data is encrypted under a single key that is associated with a user or group. In Ciphertext-Policy Attribute-Based Encryption(CP-ABE) keys are associated with attributes of users, given to them by a central trusted authority, and data is encrypted under a logical formula over these attributes. We extend this idea to the case where an arbitrary number of independent parties can be present to maintain attributes and their corresponding secret keys. We present a scheme for multi-authority CP-ABE, propose the first two constructions that fully implement the scheme, and prove their security against chosen plaintext attacks.

Visual Cryptography based on Optical Interference (광학적 간섭현상을 이용한 시각 암호화 기법)

  • 이상수;김종윤;박세준;김수중;김정우
    • Proceedings of the IEEK Conference
    • /
    • 2000.11b
    • /
    • pp.321-324
    • /
    • 2000
  • In this paper, we proposed a new visual cryptography scheme based on optical interference which improves the contrast and SNR of reconstructed images comparing with conventional visual cryptography method. We divided an binary image to be encrypted into n slides. To encrypt them, (n-1) random independent keys and one another random key by XOR process between four random keys were prepared. XOR between each divided image and each random key makes encrypted n encrypted images. From these images, encrypted binary phase masks can be made. For decryption all of phase masks should be placed together in the interferometer such as Mach-Zehnder interferometer.

  • PDF

Optimal Watermark Coefficient Extraction by Statistical Analysis of DCT Coefficients (DCT 계수의 통계적 분석을 통한 최적의 워터마크 계수 추출)

  • 최병철;김용철
    • Proceedings of the IEEK Conference
    • /
    • 2000.11c
    • /
    • pp.69-72
    • /
    • 2000
  • In this paper, a novel algorithm for digital watermarking is proposed. We use two pattern keys from BCH (15, 7) code and one randomizing key. In the embedding process, optimal watermark coefficients are determined by statistical analysis of the DCT coefficients from the standpoint of HVS. In the detection, watermark coefficients are restored by correlation matching of the possible pattern keys and minimizing the estimation errors. Attacks tested in the experiments ate image enhancement and image compression (JPEG). Performance is evaluated by BER of the logo images and SNR/PSNR of the restored images. Our method has higher performance against JPEG attacks. Analysis for the performance is included.

  • PDF

A taxonomic review of Korean Polygonatum (Ruscaceae) (한국산 둥굴레속(Polygonatum, Ruscaceae)의 분류학적 재검토)

  • Jang, Chang-Gee
    • Korean Journal of Plant Taxonomy
    • /
    • v.32 no.4
    • /
    • pp.417-447
    • /
    • 2002
  • Polygonatum taxa of Korea were classified as two sections, three series and 14 species and 2 varieties and reviewed taxonomically. Among the examined taxa, endemics in Korea were recorded as two species; P. grandicaule Y. S. Kim, B. U. Oh & C. G. Jang and P. infundiflorum Y. S. Kim, B. U. Oh & C. G. Jang. The habitat of Korean unrecorded species, P. acuminatifolium Kom. and P. odoratum var. odoratum were confirmed in this study. Keys to the sections, series and species including description of each taxon were provided here.

IP Prefix Update of Routing Protocol in the Multi-way Search Tree (멀티웨이 트리에서의 IP Prefix 업데이트 방안)

  • 이상연;이강복;이형섭
    • Proceedings of the IEEK Conference
    • /
    • 2001.06a
    • /
    • pp.269-272
    • /
    • 2001
  • Since Multi-way Search Tree reduces the number of the memory access by increasing the branch factor, it is considered a method to archive the high-speed IP address lookup. Using the combination of initial 16 bit may and Multi-way Search Tree, it also reduces the search time of If address lookup. Multi-way Search Tree consists of K keys and K+1 key pointers. This paper shows how the E update of Multi-way Search Tree which consists of the one pointer within a node can be performed. Using the one pointer within a node, it increases the number of keys within a node and reduces the search time of IP lookup. We also describes IP updating methods such as modification, Insertion and Deletion of address entries. Our update scheme performs better than the method which rebuilds the entire IP routing table when IP update processes.

  • PDF

Design of a Voltage Synthesizer Using.Microprocessor for Television Channel Selection (마이크로프로세서를 이용한 전압합성방식의 텔리비젼 채널 선국회로 설계)

  • 조진호;이건일
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.17 no.2
    • /
    • pp.1-9
    • /
    • 1980
  • A voltage synthesizing channel selection circuit was designed to improve on the conventional vol tape synthesizer which has been memorized each charnel's tuning vol cage itself. In the course of this study, tuning voltage was calculated by channel number entered from 10 keys. Then this circuit has tie function of direct access channel selection and rear display of channel number for the whole range of UHF and VHF, Attention was also given to realize the fine tuning by searching each commended channel, and the sequential selection by using 2keys, and the flash of channel indicator in case of inactive station.

  • PDF

A Mode for Block Ciphers, with Untraceable Dynamic Keys (블록 암호알고리즘을 위한, 추적불가능한 동적 키를 갖는 연산모드)

  • 김윤정;조유근
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10c
    • /
    • pp.285-287
    • /
    • 1999
  • 블록 암호알고리즘에 대한 기존의 연산 모드들(ECB 또는 CBC 등)은, 각 블록에 대하여 동일한 키로 암호화를 수행한다. 이것은 침입자가 한번의 암호 요청만을 수행하여 많은 수의 평문/암호문 쌍을 얻을 수 있게 함으로써 차분해독법 등의 공격에는 안전성을 제공하지 않는다. 본 논문에서는 블록 암호 알고리즘을 위한 새로운 모드를 제안하는데, 이 모드에서는 암호화되는 각각의 블록이 서로 다른 키로 암호화되도록 함으로써 블록의 개수가 많아짐에 따라 안전성 면에서 상당한 이득을 얻게 된다. 각 블록을 위한 서로 다른 키를 생성하는 것이 추가 연산을 필요로 하지만, 제안하는 모드를 DES에 적용한 TDK(a mode for DEA with unTraceable Dynamic Keys)의 수행 시간을 pentium과 sun sparc 상에서 측정해 본 결과 ECB 모드와 거의 유사함을 알 수 있었다.

  • PDF

Two Species of Chloroperlidae (Insecta: Plecoptera) New to Korea, with Adult Keys to Species of the Family in Korea

  • Ham, Soon-Ah
    • Animal Systematics, Evolution and Diversity
    • /
    • v.24 no.2
    • /
    • pp.185-189
    • /
    • 2008
  • Two species of the chloroperlid stonefly, Alloperla medlata and Sweltsa illiesi, are reported for the first time in Korea. Alloperla mediata can be distinguished by the smaller epiproct and the presence of a median sclerite under epiproct in male, and by the modified subgenital plate in female. Sweltsa illiesi can be distinguished by the presence of a pair of ridges on tergum 9 in male and upward V-shaped pattern on the center of head in adults. The line drawings of diagnostic characters and taxonomic remarks of the two species are provided with keys and comparative characters for adults of Korean Chloroperlidae.

Quorum based Peer to Peer Key Sharing Protocol over Wireless Sensor Networks

  • Yang, Soong-Yeal;Won, Nam-Sik;Kim, Hyun-Sung;Lee, Sung-Woon
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2008.10b
    • /
    • pp.445-448
    • /
    • 2008
  • The key establishment between nodes is one of the most important issues to secure the communication in wireless sensor networks. Some researcher used the probabilistic key sharing scheme with a pre-shared key pool to reduce the number of keys and the key disclosure possibility. However, there is a potential possibility that some nodes do not have a common share in the key pool. The purpose of this paper is to devise a peer to peer key sharing protocol (PPKP) based on Quorum system and Diffie-Hellman key exchange scheme (DHS). The PPKP establishes a session key by creating a shared key using the DHS and then scrambles it based on Quorum system to secure that. The protocol reduces the number of necessary keys than the previous schemes and could solve the non-common key sharing possibility problem in the probabilistic schemes.

  • PDF

Dynamic analysis on the scroll expander for Stirling engine (스털링 엔진용 스크롤 팽창기의 동적 거동해석)

  • Kim, Seong-Jun;Kim, Woo-Young;Kim, Hyun-Jin
    • Proceedings of the SAREK Conference
    • /
    • 2008.06a
    • /
    • pp.177-183
    • /
    • 2008
  • For 10 kW-class Stirling engine using scroll expander and scroll compressor, considerations on thermal expansion of the fixed and orbiting scroll members of the scroll expander due to high gas temperature at the expander inlet has resulted in adopting of the keys between the fixed scroll and main frame for the fixed scroll side and spring type insertion between the orbiting scroll base plate and supporting holders for orbiting scroll side. Dynamic analysis on the fixed and orbiting scroll members and the shafts of the scroll expander showed that using of these devices for complying thermal expansion caused large variations of the forces acting on the fixed scroll keys and on the power transmitting shafts and also on the shaft bearings.

  • PDF