ݺߣ

ݺߣShare a Scribd company logo
Performance Improvement and Analysis for Data
       Privacy of Cloud Computing Documents
                                  ָڣ~
                                     ߣֿY
                                   ߣТ
Outline
?   wՓ
?   īI̽ӑ
?   о
?   hc
?   YՓδչ
wՓ - Cloud Computing
?   Cloud Computing Technologies, use virtualization and
    automation technologies to create and popularize
    computer in a variety of computing resources
?   Cloud Computing Services, obtaining services from a
    remote network connection

                      Software-as-a-Service (SaaS)
                                          SaaS


                      Platform-as-a-Service (PaaS)
                                          PaaS


                    Infrastructure-as-a-Service (IaaS)
                                           IaaS
Cloud computing - Definition
Cloud Collaboration
Data Outsourcing
?   Security issues
    ?   Confidentiality, (data encryption and access control)
    ?   Integrity, (hashing and CRC)
о
оĿ
?   The document which is large scale but needs to edit few
    parts

?   When modified, it does not have to encrypt the whole
    document but only the modified parts
īI̽ӑ (1/2)
?   Cong Wang (2010), Privacy-Preserving Public Auditing for
    Data Storage Security in Cloud Computing, INFOCOM, pp. 1-9.
īI̽ӑ (2/2)
?   J. Hur and D. Noh, "Attribute-Based Access Control with Efficient Revocation in Data
    Outsourcing Systems," IEEE Transactions on Parallel and Distributed Systems, 2010.
?   Q. Liu, et al., "Efficient Sharing of Secure Cloud Storage Services," , IEEE
    International Conference on Computer and Information Technology, 2010, pp. 922-
    929.
?   S. Ning, et al., "A privacy-preserving approach to policy-based content dissemination,"
    in Data Engineering (ICDE), 2010, pp. 944-955.
Red-Black tree
?   Red-Black tree was invented in 1972 by Rudolf Bayer. It
    is a type of self-balancing binary search tree
                                    Operation   Time complexity in worse case

                                     Search               O(log n)

                                      Insert              O(log n)

                                     Delete               O(log n)
?   Properties
    ?   Every node is either red or black
    ?   The root is black
    ?   Every leaf is black
    ?   If a node is red, both its children are black
    ?   Each path from the root to a leaf contains the same number of
        black nodes
о
Distribution




Access
Rebuilding
                        (p,{align:center};si:1;ei:9),(b;si:1;ei:4),

              Content                                       Stylesheet
 Encryption
Update TreeMap ~Insertion~




                             Tree Node {
                               int : key
                               StringBuilder : content
                             }
Update TreeMap ~Insertion~
cont.
   Step. 1




   Step. 2




   Step. 3



   Step. 4
Update TreeMap ~ Remove~




                           Tree Node {
                             int : key
                             StringBuilder : content
                           }
Update TreeMap ~ Remove~
cont.
   Step. 1




   Step. 2




   Step. 3



   Step. 4
Environment
?   Windows 7 64bit
    ?   Intel Core 2 Quad CPU Q8200 @2.33Ghz
    ?   4.00 RAM

?   Windows XP 32bit (Run on VM)
    ?   Core 2 @2.33Ghz
    ?   2.00GB RAM

?   Programming language : Java (JDK 1.6)
3DES & AES Encryption/Decryption time
Document size   1MB     4MB 8MB 12MB
                       3DES Encrypt    187.4   618.6 1131.4 1721.8
Random Insert/Remove   AES Encrypt     112.8   327.8 628     915.8
Processing time
Processing time
Future work
?   In this study, although it pays the extra cost of establish and
    maintain the red-black tree, our method is more efficient if a
    large document was modified a small part
?   Improve the efficiency
    ?   3DES is 31.04%
    ?   AES is 23.94%

?   In the future, I want to improve this study and develop a
    collaboration service

More Related Content

  • 1. Performance Improvement and Analysis for Data Privacy of Cloud Computing Documents ָڣ~ ߣֿY ߣТ
  • 2. Outline ? wՓ ? īI̽ӑ ? о ? hc ? YՓδչ
  • 3. wՓ - Cloud Computing ? Cloud Computing Technologies, use virtualization and automation technologies to create and popularize computer in a variety of computing resources ? Cloud Computing Services, obtaining services from a remote network connection Software-as-a-Service (SaaS) SaaS Platform-as-a-Service (PaaS) PaaS Infrastructure-as-a-Service (IaaS) IaaS
  • 4. Cloud computing - Definition
  • 6. Data Outsourcing ? Security issues ? Confidentiality, (data encryption and access control) ? Integrity, (hashing and CRC)
  • 7. о
  • 8. оĿ ? The document which is large scale but needs to edit few parts ? When modified, it does not have to encrypt the whole document but only the modified parts
  • 9. īI̽ӑ (1/2) ? Cong Wang (2010), Privacy-Preserving Public Auditing for Data Storage Security in Cloud Computing, INFOCOM, pp. 1-9.
  • 10. īI̽ӑ (2/2) ? J. Hur and D. Noh, "Attribute-Based Access Control with Efficient Revocation in Data Outsourcing Systems," IEEE Transactions on Parallel and Distributed Systems, 2010. ? Q. Liu, et al., "Efficient Sharing of Secure Cloud Storage Services," , IEEE International Conference on Computer and Information Technology, 2010, pp. 922- 929. ? S. Ning, et al., "A privacy-preserving approach to policy-based content dissemination," in Data Engineering (ICDE), 2010, pp. 944-955.
  • 11. Red-Black tree ? Red-Black tree was invented in 1972 by Rudolf Bayer. It is a type of self-balancing binary search tree Operation Time complexity in worse case Search O(log n) Insert O(log n) Delete O(log n) ? Properties ? Every node is either red or black ? The root is black ? Every leaf is black ? If a node is red, both its children are black ? Each path from the root to a leaf contains the same number of black nodes
  • 12. о
  • 14. Rebuilding (p,{align:center};si:1;ei:9),(b;si:1;ei:4), Content Stylesheet Encryption
  • 15. Update TreeMap ~Insertion~ Tree Node { int : key StringBuilder : content }
  • 16. Update TreeMap ~Insertion~ cont. Step. 1 Step. 2 Step. 3 Step. 4
  • 17. Update TreeMap ~ Remove~ Tree Node { int : key StringBuilder : content }
  • 18. Update TreeMap ~ Remove~ cont. Step. 1 Step. 2 Step. 3 Step. 4
  • 19. Environment ? Windows 7 64bit ? Intel Core 2 Quad CPU Q8200 @2.33Ghz ? 4.00 RAM ? Windows XP 32bit (Run on VM) ? Core 2 @2.33Ghz ? 2.00GB RAM ? Programming language : Java (JDK 1.6)
  • 20. 3DES & AES Encryption/Decryption time
  • 21. Document size 1MB 4MB 8MB 12MB 3DES Encrypt 187.4 618.6 1131.4 1721.8 Random Insert/Remove AES Encrypt 112.8 327.8 628 915.8
  • 24. Future work ? In this study, although it pays the extra cost of establish and maintain the red-black tree, our method is more efficient if a large document was modified a small part ? Improve the efficiency ? 3DES is 31.04% ? AES is 23.94% ? In the future, I want to improve this study and develop a collaboration service