영지식 증명을 활용한 복원 기능을 가진 검증 가능한 클라우드 기반의 개인 건강기록
Verifable Could-Based Personal Health Record with Recovery Functionality Using Zero-Knowledge Proof
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
최근 개인 건강기록의 활용이 증가함에 따라, 개인 건강기록의 개인정보를 보호하는 암호 프로토콜에 대한 연구가활발하게 이루어지고 있다. 현재 일반적으로 개인 건강기록은 암호화되어 클라우드에 외부 위탁되어 관리되고 있다. 하지만 이 방법은 개인 건강기록의 무결성을 검증하는데 제한적이며, 사용시 필수적으로 복호화가 필요하기 때문에데이터 가용성이 떨어지는 문제점이 있다. 본 논문에서는 이 문제를 해결하기 위해 Redactable 서명기법과 영지식증명을 사용하여 검증 가능한 클라우드 기반의 개인 건강기록 관리기법을 제안한다. 검증 가능한 클라우드 기반의개인 건강기록 관리기법은 Redactable 서명기법을 사용함으로써 민감한 정보를 삭제하여 사생활(privacy)을 보존하면서 원본문서의 무결성 검증이 가능하며, 영지식 증명을 사용함으로써 원본문서의 삭제된 부분 외에는 삭제 및수정되지 않았음을 검증 할 수 있다. 또한 Redact Recovery Authority를 통해 필요한 경우에만 삭제된 부분을복원할 수 있도록 설계함으로써 기존의 관리기법보다 데이터의 가용성이 증가하도록 설계하였다. 그리고 제안한 기법을 활용한 검증 가능한 클라우드 기반의 개인 건강기록 관리모델을 제안하고, 제안한 기법을 구현함으로써 효율성을 분석하였다.
Abstract
As the utilize of personal health records increases in recent years, research on cryptographic protocol for protecting personal information of personal health records has been actively conducted. Currently, personal health records are commonly encrypted and outsourced to the cloud. However, this method is limited in verifying the integrity of personal health records,and there is a problem with poor data availability because it is essential to use it in decryption. To solve this problem, this paper proposes a verifiable cloud-based personal health record management scheme using Redactable signature scheme and zero-knowledge proof. Verifiable cloud-based personal health record management scheme can be used to verify the integrity of the original document while preserving privacy by deleting sensitive information by using Redactable signature scheme,and to verify that the redacted document has not been deleted or modified except for the deleted part of the original document by using the zero-knowledge proof. In addition, it is designed to increase the availability of data than the existing management schemes by designing to recover deleted parts only when necessary through the Redact Recovery Authority. And we propose a verifiable cloud-based personal health record management model using the proposed scheme,and analysed its efficiency by implementing the proposed scheme.
참고문헌 (19)
- Tang, Paul C., "Personal health records: definitions, benefits, and strategies for overcoming barriers to adoption", Journal of the American Medical Informatics Association, 13(2), pp.121~126 (2006)
- SM. Li, "Authorized private keyword search over encrypted data in cloud computing", 2011 31st International Conference on Distributed Computing Systems, pp.383~392 (2011)
- Goldwasser, Shafi, "The knowledge complexity of interactive proof systems", SIAM Journal on computing, 18(1), pp.186~208 (1989)
- Gennaro, Rosario, "Non-interactive verifiable computing: Outsourcing computation to untrusted workers", Annual Cryptology Conference, pp.465~482 (2010)
- Johnson, Robert, "Homomorphic signature schemes", Cryptographers’track at the RSA conference, pp.244~262 (2002)
- Slamanig, Daniel, "Generalizations and extensions of redactable signatures with applications to electronic healthcare", IFIP International Conference on Communications and Multimedia Security, pp.201~213 (2010)
- Chabanne, Hervé, "Verifiable document redacting", European Symposium on Research in Computer Security, pp.334~351 (2017)
- Bethencourt, John, "Ciphertext-policy attribute-based encryption", 2007IEEE symposium on security and privacy (SP'07), pp.321~334 (2007)
- Wang, "Design and implementation of a secure cloud-based personal health record system using", International Journal of Intelligent Information and Database Systems, 7(5), pp.389~399 (2013)
- Gondkar, "Attribute based encryption for securing personal health record on cloud", 2014 2nd International Conference on Devices, Circuits and Systems (ICDCS), pp.1~5 (2014)
- Rao, Y. Sreenivasa, "A secure and efficient ciphertext-policy attribute-based signcryption for personal health records sharing in cloud computing", Future Generation Computer Systems, 67, pp.133~151 (2017)
- Deng, Fuhu, "Ciphertext-policy attribute-based signcryption with verifiable outsourced designcryption for sharing personal health records", IEEE Access, 6, pp.39473~39486 (2018)
- N. Bitansky, "Succinct non-interactive arguments via linear interactive proofs", Theory of Cryptography Conference, pp.315~333 (2013)
- Naveh, Assa, "PhotoProof: Cryptographic image authentication for any set of permissible transformations", 2016IEEE Symposium on Security and Privacy (SP), pp.255~271 (2016)
- "libsnark: a C++ library for zkSNARK proofs" (2019)[URL]
- "SAVER" (2019)[URL]
- Parno, Bryan, "Pinocchio:Nearly practical verifiable computation", 2013 IEEE Symposium on Security and Privacy, pp.238~252 (2013)
- J. Groth, "On the size of pairing-based non-interactive arguments", EUROCRYPT 2016, pp.305~326 (2016)
- M. Ajtai, "Generating hard instances of lattice problems (extended abstract)", ACM Symposium on Theory of Computing, pp.99~108 (1996)