[논문]소비자 프라이버시 보호에 관한 다항식 기반 연구

박연희; 김민지

doi:10.9716/kits.2020.19.1.145

소비자 프라이버시 보호에 관한 다항식 기반 연구
A Polynomial-based Study on the Protection of Consumer Privacy 원문보기

한국IT서비스학회지 = Journal of Information Technology Services, v.19 no.1, 2020년, pp.145 - 158

박연희 (Yanbian University, College of Economics and Management) , 김민지 (Seoul National University, Business School)

Abstract ▼ AI-Helper

With the development and widespread application of online shopping, the number of online consumers has increased. With one click of a mouse, people can buy anything they want without going out and have it sent right to the doors. As consumers benefit from online shopping, people are becoming more concerned about protecting their privacy. In the group buying scenario described in our paper, online shopping was regarded as intra-group communication. To protect the sensitive information of consumers, the polynomial-based encryption key sharing method (Piao et al., 2013; Piao and Kim, 2018) can be applied to online shopping communication. In this paper, we analyze security problems by using a polynomial-based scheme in the following ways : First, in Kamal's attack, they said it does not provide perfect forward and backward secrecy when the members leave or join the group because the secret key can be broken in polynomial time. Second, for simultaneous equations, the leaving node will compute the new secret key if it can be confirmed that the updated new polynomial is recomputed. Third, using Newton's method, attackers can successively find better approximations to the roots of a function. Fourth, the Berlekamp Algorithm can factor polynomials over finite fields and solve the root of the polynomial. Fifth, for a brute-force attack, if the key size is small, brute force can be used to find the root of the polynomial, we need to make a key with appropriately large size to prevent brute force attacks. According to these analyses, we finally recommend the use of a relatively reasonable hash-based mechanism that solves all of the possible security problems and is the most suitable mechanism for our application. The study of adequate and suitable protective methods of consumer security will have academic significance and provide the practical implications.

주제어

표/그림 (5)

그림 [Figure 1] Membership Group Purchase System
그림 [Figure 2] Newton’s Mthod with a Key Size of 8-bits
그림 [Figure 3] Newton’s Method with a Key Size of 16-bit
그림 [Figure 4] Newton's Method and a Brute-Force Attack with a Key Size of 16-bits
표 Comparison of the original and improved polynomial scheme

AI 본문요약
AI-Helper

* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.

제안 방법

In this paper, we mainly analyze the security problems against the mentioned polynomialbased method using Kamal's attack, simultaneous equations, Newton's method, the Berlekamp algorithm, and a brute-force attack.
, 2013). In this paper, we will analyze the polynomialbased method from a security perspective and recommend a relatively reasonable hash-based mechanism.
Taken together, it will help strengthen security for consumer data, such as payment information and logistics data for online communication when we adopt the improved method. The purpose of the current study was to make the encryption method more light weight and more secure in online shopping, and the findings of this study have a number of important implications for encryption and authentication technology in online communication.

참고문헌 (31)

Anthony, D.M. and F. Ana, "Consumer Perceptions of Privacy and Security Risks for Online Shopping", Journal of Consumer Affairs, Vol.35, No.1, 2005, 27-44.

상세보기
Berlekamp, E.R., "Factoring polynomials over large finite fields", Mathematics of Computation, Vol.24, No.111, 1970, 713-735.

상세보기
Blundo, C., F. Orciuoli, and M. Parente, "An AmI-based and privacy-preserving shopping mall model", Human-centric Computing and Information Sciences, Vol.7, No.1, 2017, 1-28.

상세보기
Cantor, D.G. and H. Zassenhaus, "A new algorithm for factoring polynomials over finite fields", Mathematics of Computation, Vol.36, No.154, 1981, 587-592.

상세보기
Chang, C.C., L. Harn, and T.F. Cheng, "Notes on 'Polynomial-based key management for secure intra-group and inter-group communication' ", International Journal of Network Security, Vol.16, No.2, 2014, 165-170.
Chen, H., C.E. Beaudoin, and T. Hong, "Securing online privacy : An empirical test on Internet scam victimization, online privacy concerns, and privacy protection behaviors", Computers in Human Behavior, Vol.70, 2017, 291-302.

상세보기
Diffie, W. and M.E. Hellman, "New directions in cryptography", IEEE Transactions on Information Theory, Vol.22, No.6, 1976, 644-654.

상세보기
Dobelt, S., M. Jung, M. Busch, and M. Tscheligi, "Consumers' privacy concerns and implications for a privacy preserving Smart Grid architecture-Results of an Austrian study", Energy Research and Social Science, Vol.9, 2015, 137-145.

상세보기
Galup, S.D., R. Dattero, J.J. Quan, and S. Conger, "An overview of it service management", Communications of the Acm, Vol.52, No.5, 2009, 124-127.

상세보기
Gurung, A. and M.K. Raja, "Online privacy and security concerns of consumers", Information and Computer Security, Vol.24, No.4, 2016, 348-371.

상세보기
Haddad, G.E., E. Aimeur, and H. Hage, "Understanding trust, privacy and financial fears in online payment", Security And Privacy In Computing and Communications/12th IEEE International Conference On Big Data Science And Engineering, 2018, 28-36.
Harney, H. and C. Muckenhirn, "Group key management protocol(GKMP) Specification", RFC 2093, 1997, Available at https://datatracker.ietf.org/doc/rfc2093/.
Hwang, Y. and J. Jeong, "Electronic Commerce and Online Consumer Behavior Research : A Literature Review", Information Development, Vol.32, No.3, 2016, 377-388.

상세보기
Janse, N., C.X. Ou, Angelopoulos, J., S., Davison, R.M., and J.W. Jia, "Do security breaches matter to consumers?", ICEB 2017 Proceedings, 2017, Available at https://aisel.aisnet.org/iceb2017/50.
Jo, H. and J.M. Lee, "A Study on Antecedents of WOM in the Context of Internet E-Commerce", Journal of Information Technology Services, Vol.12, No.2, 2013, 231-242.

원문보기 상세보기
Kahn, C.M. and J.M. Linares-Zegarra, "Identity theft and consumer payment choice : Does security really matter?", Journal of Financial Services Research, Vol.50, No.1, 2016, 121-159.

상세보기
Kamal, A.A., "Cryptanalysis of a polynomialbased key management scheme for secure group communication", International Journal of Network Security, Vol.15, No.1, 2013, 68-70.
Liu, D., P. Ning, and K. Sun, "Efficient selfhealing group key distribution with revocation capability", in Proceedings of the 10th ACM conference on computer and Communications Security, 2003, 231-240.
Liu, N., S. Tang, and L. Xu, "Attacks and comments on several recently proposed key management schemes", 2013, Available at https://eprint.iacr.org/2013/100.
Mou, J., D.H. Shin, and J.F. Cohen, "Trust and risk in consumer acceptance of e-services", Electronic Commerce Research, Vol.17, No.2, 2017, 255-288.

상세보기
Newton's Method, Available at https://en.wikipedia.org/wiki/Newton's_method.
Patsakis C. and A. Solanas, "An efficient scheme for centralized group key management in collaborative environments", 2013, Available at http://citeseerx.ist.psu.edu/viewdoc/summary?.
Piao, Y. and M.J. Kim, "A study on the protection of consumers' personal information in online shopping", Academic Society of Global Business Administration, Vol.15, No.5, 2018, 209-223.
Piao, Y., J.U. Kim, U. Tariq, and M. Hong, "Polynomial-based key management for secure intra-group and inter-group communication", Computers and Mathematics with Applications, Vol.65, No.9, 2013, 1300-1309.

상세보기
Shamir, A., "How to share a secret", Communications of the ACM, Vol.22, No.11, 1979, 612-613.

상세보기
Shoup, V., "On the deterministic complexity of factoring polynomials over finite fields", Information Processing Letters, Vol.33, No.5, 1990, 261-267.

상세보기
Staddon, J., S. Miner, M. Franklin, D. Balfanz, M. Malkin, and D. Dean, "Self-healing key distribution with revocation", IEEE Symposium on Security and Privacy, 2002.
Wang, W. and B. Bhargava, "Key distribution and update for secure inter-group multicast communication", SASN '05 Proceedings of the 3rd ACM workshop on Securityof ad hoc and sensor networks, 2005, 43-52.
Wang, W. and T. Stransky, "Stateless key distribution for secure intra and inter-group multicast in mobile wireless network", Computer Networks, Vol.51, No.15, 2007, 4303-4321.

상세보기
Wang, W. and Y. Wang, "Secure group-based information sharing in mobile ad hoc networks", IEEE International Conference on Communications, 2008, 1695-1699.
Wong, C.K., M. Gouda, and S.S. Lam, "Secure group communications using key graphs", IEEE/ACM Transactions on Networking, Vol.8, No.1, 2000, 68-79.

내보내기 구분	파일저장 인쇄 메일전송
구성항목	기본정보 상세정보 관리번호, 논문명, 저널/프로시딩명, 저자 , 발행년, 권, 호, 시작페이지, 끝페이지, 발행기관 관리번호, 논문명, 대등논문명, 저자 , 저널/프로시딩명, 발행기관, 발행년, 발행언어, 권, 호, 시작페이지, 끝페이지, ISBN, ISSN, 주제분야, 키워드, 초록(한글), 초록(영문), 저자(소속기관)
저장형식	Text(ASCII format) Excel format RefWorks Direct Export RIS format (for Reference Manager, ProCite, EndNote), Scholar's Aids, Mendeley
메일정보	받는사람 (필수) @ 보내는사람 (선택) @ 제목 내용 KISTI 검색결과 이메일 서비스
안내	총 건의 자료가 검색되었습니다. 다운받으실 자료의 인덱스를 입력하세요. (1-10,000) 검색결과의 순서대로 최대 10,000건 까지 다운로드가 가능합니다. 데이타가 많을 경우 속도가 느려질 수 있습니다.(최대 2~3분 소요) 다운로드 파일은 UTF-8 형태로 저장됩니다. 파일의 내용이 제대로 보이지 않을실 때는 웹브라우저 상단의 보기 -> 인코딩 -> 자동선택 여부를 확인하십시오. ~ Text(ASCII format) Excel format

연합인증