Advertisement

Secure RFID Application Data Management Using All-Or-Nothing Transform Encryption

  • Namje Park
  • Youjin Song
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6221)

Abstract

Ensuring the security of RFID’s large-capacity database system by depending only on existing encryption schemes is unrealistic. Therefore, data sharing for security management to supplement it is drawing attention as an extremely secure scheme. However, applying the existing secret sharing scheme to this method makes the size of the share equal to that of the original data. Thus, it is not suitable for application to large-scale database. This paper proposes secret sharing algorithms that enable efficient data sharing security management based on the characteristics of the All-Or-Nothing Transform encryption mode. The proposed algorithms enable fast sharing and reconstruction in terms of processing speed and allow the sum of shares to be equal to that of the plaintext, thereby making them suitable for large-capacity database storage.

Keywords

Secret Sharing Advance Encryption Standard Secret Sharing Scheme Encryption Mode Share Size 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Park, N., Kwak, J., Kim, S., Won, D., Kim, H.: WIPI Mobile Platform with Secure Service for Mobile RFID Network Environment. In: Shen, H.T., Li, J., Li, M., Ni, J., Wang, W. (eds.) APWeb Workshops 2006. LNCS, vol. 3842, pp. 741–748. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  2. 2.
    Shamir, A.: How to Share a Secret. Communication of the ACM 22(11), 612–613 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Rivest, R.L.: All-or-nothing encryption and the package transform. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 210–218. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  4. 4.
    Dean, J.: Handling Large Datasets at Google: Current Systems and Future Directions. In: Data-Intensive Computing Symposium (2008)Google Scholar
  5. 5.
    Park, N., Kim, S., Won, D., Kim, H.: Security Analysis and Implementation leveraging Globally Networked Mobile RFIDs. In: Cuenca, P., Orozco-Barbosa, L. (eds.) PWC 2006. LNCS, vol. 4217, pp. 494–505. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  6. 6.
    Kurihara, J., Kiyomoto, S., Fukushima, K., Tanaka, T.: A fast (3, n)-threshold secret sharing scheme using exclusive-or operations. IEICE Trans. Fundamentals E91-A(1), 127–138 (2008)Google Scholar
  7. 7.
    Fujii, Y., Tada, M., Hosaka, N., Tochikubo, K., Kato, T.: fast (2, n)-threshold scheme and its application. In: Proc. CSS 2005, pp. 631–636 (2005)Google Scholar
  8. 8.
    Tada, M., Fujii, Y., Hosaka, N., Tochikubo, K., Kato, T.: A secret sharing scheme with threshold 3. In: Proc. CSS 2005, pp. 637–642 (2005)Google Scholar
  9. 9.
    Kuwakado, H., Tanaka, H.: Strongly non-separable encryption mode for throwing a media away. Technical Report of IEICE 103(417), 15–18 (2003)Google Scholar
  10. 10.
    Kurihara, J., Kiyomoto, S., Fukushima, K., Tanaka, T.: A New (k, n)-Threshold Secret Sharing Scheme and Its Extension. In: Wu, T.-C., Lei, C.-L., Rijmen, V., Lee, D.-T. (eds.) ISC 2008. LNCS, vol. 5222, pp. 455–470. Springer, Heidelberg (2008)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Namje Park
    • 1
  • Youjin Song
    • 2
  1. 1.Computer Science and EngineeringArizona State UniversityTempe, ArizonaUSA
  2. 2.Department of Information ManagementDongguk UnivertsityGyeongju, Gyeongsangbuk-doKorea

Personalised recommendations