• Title/Summary/Keyword: scrambled variable

Search Result 2, Processing Time 0.015 seconds

A multiplicative unrelated quantitative randomized response model (승법 무관양적속성 확률화응답모형)

  • Lee, Gi-Sung
    • The Korean Journal of Applied Statistics
    • /
    • v.29 no.5
    • /
    • pp.897-906
    • /
    • 2016
  • We augment an unrelated quantitative attribute to Bar-Lev et al.'s model (2004) which is composed of sensitive quantitative variable and scrambled one to present a multiplicative unrelated quantitative randomized response model(MUQ RRM). We also establish theoretical grounds to estimate the sensitive quantitative attribute according to circumstances irrespective of known or unknown unrelated quantitative attribute. Finally, we explore the relationship among the suggested model, Eichhorn-Hayre model, Bar-Lev et al.'s model and Gjestvang-Singh's model, and compare the efficiency of our model with Bar-Lev et al.'s model.

A Study on Secure Encoding for Visible Light Communication Without Performance Degradation (가시광 통신에서 성능 저하 없는 보안 인코딩 연구)

  • Kim, Minchul;Suh, Taeweon
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.11 no.1
    • /
    • pp.35-42
    • /
    • 2022
  • Visible light communication (VLC) is a method of transmitting data through LED blinking and is vulnerable to eavesdropping because the illumination affects the wide range of area. IEEE standard 802.15.7 defines On-Off Keying (OOK), Variable Pulse Position Modulation (VPPM), and Color Shift Keying (CSK) as modulation. In this paper, we propose an encryption method in VPPM for secure communication. The VPPM uses an encoding method called 4B6B where 16 different outputs are represented with 6-bit. This paper extends the number of outputs to 20, to add complexity while not violating the 4B6B generation conditions. Then each entry in the extended 4B6B table is scrambled using vigenère cipher. The probability of decrypting each 6-bit data is $\frac{1}{20}$. Eavesdropper should perform $\sum\limits_{k=1}^{n}20^k$ number of different trials to decrypt the message if the number of keys is n. The proposed method can be applied to OOK of PHY II and CSK of PHY III. We further discuss the secure encoding that can be used in OOK and CSK without performance degradation.