Information Security and Computer Fraud: Latest Articles  More >>

Article

Simplified Verifiable Re-encryption Mix-nets

1Graduate School of Engineering, University of Fukui, Fukui, Japan


Information Security and Computer Fraud. 2013, 1(1), 1-7
DOI: 10.12691/iscf-1-1-1
Copyright © 2013 Science and Education Publishing

Cite this paper:
Shinsuke Tamura, Shuji Taniguchi. Simplified Verifiable Re-encryption Mix-nets. Information Security and Computer Fraud. 2013; 1(1):1-7. doi: 10.12691/iscf-1-1-1.

Correspondence to: Shinsuke Tamura, Graduate School of Engineering, University of Fukui, Fukui, Japan. Email: tamura@u-fukui.ac.jp

Abstract

Under the assumption that numbers of data that are encrypted and decrypted are sufficiently large and final decryption results of individual data can be publicly disclosed, a simplified mechanism for implementing re-encryption type verifiable mix-nets is proposed. Different from already proposed mechanisms, in which mix-servers prove their honest encryptions while concealing their encryption parameters, mix-servers in the proposed scheme simply disclose their aggregate encryption parameter values. As a consequence anyone can verify encryption results without interacting with mix-servers. Also, its primary verification procedures examine only aggregate behavior of mix-servers, in other words, it does not examine correct encryptions of individual data. Therefore computation volumes required for mix-servers to prove their correct behaviors are reduced substantially. In addition, the proposed scheme can cope with various attacks from malicious entities more effectively than optimistic verifiable mix-nets that also examine only aggregate behaviors of mix-nets.

Keywords

References

[1]  Diffie and M. E. Hellman, “New Directions in Cryptography,” IEEE Trans. On Information Theory, IT-22(6), 644-654, 1976.
 
[2]  M. Blum, P. Feldman and S. Micali, “Non-interactive Zero-knowledge and Its Applications,” Proc. of the 20th Annual ACM Symposium on Theory of Computing, 103-112, 1988.
 
[3]  S. Goldwasser, S. Micali and C. Rackoff, “The Knowledge Complexity of Interactive Proof System,” SIAM Journal on Computing, 18(1), 291-304, 1989.
 
[4]  B. Pfitzmann, “Breaking an Efficient Anonymous Channel,” Eurocrypt’95, LNCS 950, 332-340, 1995.
 
[5]  M. Abe, “Universally Verifiable Mix-Net with Verification Work Independent of the Number of Mix-Servers,” IEICE Trans. Fundamentals, E83-A(7), 1431-1440, 2000.
 
Show More References
[6]  D. Boneh and P. Golle, “Almost Entirely Correct Mixing with Applications to Voting,” ACM Conference on Computer and Communication Security, 68-77, 2002.
 
[7]  P. Golle, S. Zhong, D. Boneh, M. Jakobsson and A. Juels, “Optimistic Mixing for Exit-Polls,” Asiacrypt 2002, 451-465, 2002.
 
[8]  M. Jakobson, A. Juels and R. Rivest, “Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking,” USENIX Security ’02, 339-353, 2002.
 
[9]  L. Nguen, R. Dafavi-Naini and K. Kurosawa, “Verifiable Shuffles: A Formal Model and a Paillier-based Efficient Construction with Provable Security,” PKC 2004, LNCS 2248, 61-75, 2004.2002.
 
[10]  J. Furukawa, “Efficient, Verifiable Shuffle Decryption and Its Requirement of Unlinkability,” PKC 2004, LNCS 2248, 319-332, 2004.
 
[11]  D. Wikstrom, “Five Practical Attacks for Optimistic Mixing for Exit-Polls,” Proceedings of SAC 2003, 160-175, 2004.
 
[12]  K. Sampigethaya and R. Poovendran, “A Framework and Taxonomy for Comparison of Electronic Voting Schemes,” Elsevier Computers and Security, 25, 137-153, 2006.
 
[13]  S. Weber, “A Coercion-Resistant Cryptographic Voting Protocol -Evaluation and Prototype Implementation,” Diploma thesis, Darmstadt University of Technology; 2006.
 
[14]  K. A. Md Rokibul, S. Tamura, S. Taniguchi and T. Yanase, “An Anonymous Voting Scheme based on Confirmation Numbers,” IEEJ Trans. EIS. 130(11), 2065-2073, 2010.
 
[15]  S. Tamura, “Anonymous Security Systems and Applications: Requirements and Solutions,” Information Science Reference, 2012.
 
Show Less References

Article

Comparing Massive Multiplayer Online Role-Playing Games and Voice-Over-IP with SCALD

1Department of Computer Science and Engineering, MIT Mandsaur, Mandsaur, India

2Department of Computer Science and Engineering, ITM Universe, Vadodra, India


Information Security and Computer Fraud. 2014, 2(1), 1-4
DOI: 10.12691/iscf-2-1-1
Copyright © 2014 Science and Education Publishing

Cite this paper:
A.M. Mansuri, Manish Verma, Pradeep Laxkar. Comparing Massive Multiplayer Online Role-Playing Games and Voice-Over-IP with SCALD. Information Security and Computer Fraud. 2014; 2(1):1-4. doi: 10.12691/iscf-2-1-1.

Correspondence to: A.M.  Mansuri, Department of Computer Science and Engineering, MIT Mandsaur, Mandsaur, India. Email: anwardkn@gmail.com

Abstract

In recent years, many researches has been devoted to the development of neural networks; contrarily, few have synthesized the emulation of SMPs. Given the current status of low-energy symmetries, security experts daringly desire the understanding of systems, which embodies the confusing principles of robotics. This research work focus in this paper is not on whether the infamous distributed algorithm for the investigation of simulated annealing by Zhou et al. runs in Θ (N!) time, but rather on proposing a novel heuristic for the analysis of superblocks (SCALD).

Keywords

References

[1]  Sutherland, and Z. Thompson, “Bito: A methodology for the deployment of the partition table,” in Proceedings of PODC, Apr. 2004.
 
[2]  R. Tarjan, Z. Harris, H. Simon, J. Ullman, P. Williams, and B. Lampson, “Deploying vac-uum tubes using permutable archetypes,” in Proceedings of PODS, Sept. 2004.
 
[3]  S. Shenker, “Analyzing linked lists and Byzan-tine fault tolerance,” in Proceedings of OOP-SLA, Feb. 2002.
 
[4]  D. Knuth, “Hierarchical databases considered harmful,” in Proceedings of HPCA, May 2004.
 
[5]  J. Backus, “Deconstructing evolutionary pro-gramming with TONG,” in Proceedings of SIG-METRICS, Oct. 2004.
 
Show More References
[6]  D. Knuth and a. Gupta, “On the emulation of a* search,” in Proceedings of the Symposium on Semantic Models, Mar. 2005.
 
[7]  S. Cook, E. Schroedinger, and K. Miller, “De-veloping telephony and symmetric encryption,”.
 
[8]  Jthisnal of Pervasive, Highly-Available Algo-rithms, vol. 441, pp. 1-13, Nov. 1994.
 
[9]  L. Adleman, “Decoupling active networks from lambda calculus in extreme programming,” in Proceedings of VLDB, May 2004.
 
[10]  P. White, “The UNIVAC computer consid-ered harmful,” in Proceedings of the Conference on Amphibious, Probabilistic Symmetries, Nov. 2005.
 
[11]  A. Takahashi and R. Thompson, “Analysis of IPv4,” in Proceedings of the Conference on Self-Learning, Scalable Technology, June 2004.
 
[12]  A. Nehru, “AphidRip: Game-theoretic, exten-sible symmetries,” in Proceedings of ECOOP, Aug. 1996.
 
[13]  Anderson, P. Robinson, and M. Blum, “Loss-less algorithms for Byzantine fault tolerance,” in Proceedings of the Symposium on Signed, Coop-erative Configurations, Mar. 1997.
 
[14]  R. Tarjan and D. Clark, “A methodology for the simulation of SCSI disks,” in Proceedings of JAIR, Mar. 1996.
 
[15]  K. Lakshminarayanan, “Consistent hashing con-sidered harmful,” in Proceedings of FOCS, Oct. 1997.
 
[16]  M. I. Watanabe and M. Qian, “Emulating the memory bus using psychoacoustic models,” in Proceedings of the Symposium on Virtual, Mul-timodal Information, Mar. 1980.
 
[17]  B. Moore, F. Garcia, J. Fredrick P. Brooks, and Kelkar, “The impact of wireless modalities on cryptoanalysis,” Jthisnal of Adaptive, Mobile Algorithms, vol. 7, pp. 59-64, Mar. 1990.
 
Show Less References

Article

Benefit of Cloud Computing for Educational Institutions and Online Marketing

1Department of Computer Science and Engineering, MIT Mandsaur, Mandsaur, India

2Department of Computer Science and Engineering, ITM Universe, Vadodra, India


Information Security and Computer Fraud. 2014, 2(1), 5-9
DOI: 10.12691/iscf-2-1-2
Copyright © 2014 Science and Education Publishing

Cite this paper:
A.M. Mansuri, Manish Verma, Pradeep Laxkar. Benefit of Cloud Computing for Educational Institutions and Online Marketing. Information Security and Computer Fraud. 2014; 2(1):5-9. doi: 10.12691/iscf-2-1-2.

Correspondence to: A.M.  Mansuri, Department of Computer Science and Engineering, MIT Mandsaur, Mandsaur, India. Email: anwardkn@gmail.com

Abstract

Cloud computing as an exciting development in a educational Institute and online marketing perspective. Students and administrative personnel have the opportunity to quickly and economically access various application platforms and resources through the web pages on-demand. Application of storage technology can significantly reduce the amount of cloud storage servers, thereby reducing system development costs; reduce the system caused by the server a single point of failure. Cloud storage services meet this demand by providing transparent and reliable storage solutions In this paper shows that the cloud computing plays an important role in the fields of Educational and online Marketing and it is helpful to provide the data to the Students and online customer respectively. The results show the beneficial of the cloud computing in Educational and online marketing for customers.

Keywords

References

[1]  Aymerich, F. M., Fenu, G., Surcis, S., & IEEE. (2008). An Approach to a Cloud Computing Network. 1st International Conference on theApplications of Digital Information and Web Technologies, Ostrava, CZECH REPUBLIC, 120-125.
 
[2]  Banerjee, P. (2009). An intelligent IT infrastructure for the future. 15th International Symposium on High-Performance Computer Architecture, Proceedings, Feb 14-18, 3.
 
[3]  Delic, K. A., & Riley, J. A. (2009). Enterprise Knowledge Clouds: Next Generation KM Systems? International Conference on Information, Process, and Knowledge Management, Cancun, MEXICO. 49-53.
 
[4]  Dodda, R. T., Smith, C., & van Moorsel, A. (2009). Architecture for Cross-Cloud System Management. 2nd International Conference on Contemporary Computing, Nioda, INDIA. 40, 556-567.
 
[5]  Erickson, J. S., Spence, S., Rhodes, M., Banks, D., Rutherford, J., Simpson, E., et al. (2009). Content-Centered Collaboration Spaces in the Cloud. IEEE Internet Computing, 13(5), 34-42.
 
Show More References
[6]  Klein, C., & Kaefer, G. (2008). From smart homes to smart cities: Opportunities and challenges from an industrial perspective, Next Generation Teletraff c and Wired/Wireless Advanced Networking, Proceedings, Lecture Notes in Computer Science, 5174, 260.
 
[7]  Lijun, M., Chan, W.K., & Tse, T.H. (2008). A tale of clouds: Paradigm comparisons and some thoughts on research issues. IEEE Asia-Pasific Services Computing Conference, APSCC’ 08, 464-469.
 
[8]  Mitchell, P. (2008). Learning architecture: issues in indexing Australian education in a Web 2.0 world. Indexer, 26(4), 163-169.
 
[9]  Dawei Sun, Guiran Chang, Qiang Guo, Chuan Wang, Xingwei Wang., “A Dependability Model to Enhance Security of Cloud Environment Using System-Level Virtualization Techniques”, First International Conference on Pervasive Computing, Signal Processing and Applications pcspa; 2010, pp. 305-310.
 
[10]  Qian Liu, Chuliang Weng, Minglu Li, Yuan Luo, “An In-VM Measuring Framework for Increasing Virtual Machine Security in Clouds”, IEEE Security and Privacy, vol. 8, no. 6, pp. 56-62, Nov./Dec. 2010.
 
[11]  M. Sharif et al, “Secure In-VM Monitoring Using Hardware Virtualization”, Proc. 16th ACM Conf. Computer andCommunications Security; ACM Press, 2009, pp. 477-487.
 
[12]  Jia Xu, Jia Yan, Liang He, Purui Su, Dengguo Feng. “CloudSEC: A Cloud Architecture for Composing Collaborative Security Services”, 2nd IEEE International Conference on Cloud Computing Technology and Science cloudcom; 2010, pp. 703-711.
 
[13]  Cloud Security Alliance. Security Guidance for Critical Areas of Focus in Cloud Computing V2.1; 2009, https://cloudsecurityalliance.org/csaguide.pdf.
 
[14]  Catteddu and G. Hogben. Cloud Computing: Benefits, Risks and Recommendations for Information Security. ENISA; 2009, http://www.enisa.europa.eu/.
 
[15]  G. Balabanis, N. Reynolds, A. Simintiras: Bases of e-store loalty: Perceived switching barriers and satisfaction.2005.
 
[16]  Z. Yang and R.T. Peterson: Customer Perceived Value, Satisfaction, and Loyalty: The Role of Switching Costs.
 
[17]  In: Psychology & Marketing, Vol. 21(10): 799-822 (October 2004). Wiley Periodicals. 2004.
 
[18]  S. Goldschmidt, S. Junghagen, U. Harris: Strategic affiliate marketing. Edward Elgar Publishing. 2004.
 
[19]  http://mobiledevices.about.com/od/additionalresources/a/Cloud-Computing-Is-It-Really-All-That-Beneficial.htm
 
Show Less References

Article

Enhanced Anonymous Tag Based Credentials

1Graduate School of Engineering, University of Fukui, Fukui, Japan


Information Security and Computer Fraud. 2014, 2(1), 10-20
DOI: 10.12691/iscf-2-1-3
Copyright © 2014 Science and Education Publishing

Cite this paper:
Shinsuke Tamura, Shuji Taniguchi. Enhanced Anonymous Tag Based Credentials. Information Security and Computer Fraud. 2014; 2(1):10-20. doi: 10.12691/iscf-2-1-3.

Correspondence to: Shinsuke  Tamura, Graduate School of Engineering, University of Fukui, Fukui, Japan. Email: tamura@dance.plala.or.jp

Abstract

A scheme for anonymous tag based anonymous credentials is enhanced. Different from zero knowledge proof based anonymous credential schemes that require numbers of challenges and responses between verifiers and credential holders, the anonymous tag based scheme requires only small number of challenges and responses. However, the original scheme has probabilistic features, i.e. verifiers must generate dummy fake challenges; therefore overheads for managing anonymous systems cannot be reduced to the minimum. The enhanced scheme proposed in this paper excludes these probabilistic features from interactions between verifiers and credential holders. The scheme also corrects several design errors included in the original scheme.

Keywords

References

[1]  Chaum, D., “Untraceable electronic mail, return address and digital pseudonyms,” Communications of the ACM, 24 (2), 84-88. 1981.
 
[2]  Blum, M., Feldman, P. and Micali, S., “Non-interactive zero-knowledge and its applications,” in 20th Annual ACM Symposium on Theory of Computing, 103-112. 1988.
 
[3]  Goldwasser, S., Micali, S. and Rackoff, C., “The knowledge complexity of interactive proof system,” SIAM Journal on Computing, 18 (1), 291-304. 1989.
 
[4]  Damgard, I. B., “Payment systems and credential mechanism with provable security against abuse by individuals,” in CRYPTO'88, 328-335. 1990.
 
[5]  Camenisch, J. and Lysyanskaya, A., “An efficient system for non-transferable anonymous credential with optimal anonymity revocation,” in EUROCRYPT01, 93-118. 2001.
 
Show More References
[6]  Camenisch, J. and Lysyanskaya, A., “Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation,” in EUROCRYPT 2001, 93-118. 2001.
 
[7]  Camenisch, J. and Lysyanskaya, A., “Dynamic accumulators and application to efficient revocation of anonymous credentials,” in CRYPTO 2002, 61-76. 2002.
 
[8]  Camenisch, J. and Lysyanskaya, A., “Signature schemes and anonymous credentials from bilinear maps,” in CRYPTO 2004, 56-72. 2004.
 
[9]  Belenkiy, M., Chase, M., Kohlweiss, M. and Lysyanskaya, A., “P-signatures and noninteractive anonymous credentials,” in Theory of Cryptography Conference, 356-374. 2008.
 
[10]  Belenkiy, M., Camenisch, J., Chase, M., Kohlweiss, M., Lysyanskaya, A. and Shacham, H., “Randomizable proofs and delegatable anonymous credentials,” in 29th Annual International Cryptology Conference on Advances in Cryptology, 108-125. 2009.
 
[11]  Shahandashti, S. F. and Safavi-Naini, R., “Threshold attribute-based signatures and their application to anonymous credential systems,” in 2nd International Conference on Cryptology in Africa: Progress in Cryptology, 198-216. 2009.
 
[12]  Sudarsono, A., Nakanishi, T. and Funabiki, N., “Efficient proofs of attributes in pairing-based anonymous credential system,” Springer Lecture Notes in Computer Science 6794/2011, 246-263. 2011.
 
[13]  Tamura, S., Anonymous security systems and applications: requirements and solutions, Information Science Reference, 2012.
 
[14]  Tamura, S., Haddad, H. A., Kouro, K., Tsurugi, H., Md. Rokibul Alam, K., Yanase, T. and Taniguchi, S., “An information system platform for anonymous product recycling,” Journal of Software, 3 (3), 46-56. 2008.
 
[15]  Diffie, W. and Hellman, M. E., “New directions in cryptography,” IEEE Trans. on Information Theory, IT-22 (6), 644-654. 1976.
 
[16]  Chaum, D., Fiat, A. and Naor, M., “Untraceable electronic cash,” in CRYPTO88, 319-327. 1988.
 
[17]  Tamura, S. and Taniguchi, S., “A scheme for collecting anonymous data,” in IEEE-ICIT, 1210-1215. 2013.
 
Show Less References

Article

A Scheme for Delegating Program Executions without Disclosing Secret Values

1School of Engineering, University of Fukui, Fukui, Japan


Information Security and Computer Fraud. 2014, 2(2), 21-27
DOI: 10.12691/iscf-2-2-1
Copyright © 2014 Science and Education Publishing

Cite this paper:
Shinsuke Tamura, Shuji Taniguchi. A Scheme for Delegating Program Executions without Disclosing Secret Values. Information Security and Computer Fraud. 2014; 2(2):21-27. doi: 10.12691/iscf-2-2-1.

Correspondence to: Shinsuke  Tamura, School of Engineering, University of Fukui, Fukui, Japan. Email: tamura@dance.plala.or.jp

Abstract

A scheme that enables entities to delegate accomplishments of their secret tasks to others under complicated conditions is proposed. The proposed scheme exploits multidimensional array based encryption functions, and different from schemes that exploit public key based fully homomorphic encryption functions, it can handle real numbers in the same way as integers. Also, it enables entities to define complicated calculation algorithms as computer programs that are easy to develop and efficient to execute. In addition, together with data encryption, data redundancy and test data insertion principles it disables relevant entities to accomplish tasks dishonestly.

Keywords

References

[1]  Chaum, D., “Untraceable electronic mail, return address and digital pseudonyms,” Communications of the ACM, 24 (2). 84-88. 1981.
 
[2]  Yao, A. C., How to generate and exchange secrets,” Proc. of the 27th IEEE Symposium on Foundations of Computer Science, 162-167. 1986.
 
[3]  Goldreich, O., Micali, M. and Wigderson, A., “How to play any mental game,” Proc. of 19th ACM Symposium on Theory of Computing, 218-229. 1987.
 
[4]  Naor, M., Pinkas, B. and Sumner, R., “Privacy preserving auctions and mechanism design,” 1st ACM Conference on Electronic Commerse, 129-139. 1999.
 
[5]  Ogiso, T., Sakabe, Y., Soshi, M. and Miyaji, A., “Software obfuscation on a theoretical basis and its implementation,” IEICE Trans. Fundamentals, E86-A, (1), 176-186. 2003.
 
Show More References
[6]  Golle, P. and Jakobsson, M., “Reusable anonymous return channels,” Proc. of the 2003 ACM Workshop on Privacy in the Electronic Society, 94-100. 2003.
 
[7]  Gentry, C. “Fully homomorphic encryption using ideal lattices,” Proc. of Symposium on theory of computing –STOC 2009, 169-178. 2009.
 
[8]  Chung, K., Kalai, Y. and Vadhan, S., “Improved Delegation of Computation Using Fully Homomorphic Encryption,” CRYPT 2010, LNCS 6223, 483-501. 2010.
 
[9]  Haddad, H, Tamura, S., Taniguchi, S. and Yanase, T., “Development of anonymous networks based on symmetric key encryptions,” Journal of Networks, 6 (11), 1533-1542. 2011.
 
[10]  Tamura, S., Anonymous Security Systems and Applications: Requirements and Solutions, Information Science Reference, 2012.
 
[11]  Tamura, S. and Taniguchi, S., “Enhanced Anonymous Tag Based Credentials,” Information Security and Computer Fraud, 2 (1), 10-20, 2014.
 
Show Less References

Article

Web 2.0 and Social Media: Applications for Academic Libraries

1Department of Business Administration, Fitchburg State University, Fitchburg,MA USA


Information Security and Computer Fraud. 2014, 2(2), 28-32
DOI: 10.12691/iscf-2-2-2
Copyright © 2014 Science and Education Publishing

Cite this paper:
Linda LeBlanc, Kay (Kwahng) Kim. Web 2.0 and Social Media: Applications for Academic Libraries. Information Security and Computer Fraud. 2014; 2(2):28-32. doi: 10.12691/iscf-2-2-2.

Correspondence to: Kay  (Kwahng) Kim, Department of Business Administration, Fitchburg State University, Fitchburg,MA USA. Email: kkim@fitchburgstate.edu

Abstract

The purpose of this paper is to examine the applications of using Web 2.0 technologies and social media tools to “bring” the academic library to its students and implications for the Amelia V. Gallucci-Cirio Library, Fitchburg State University. A review of the literature finds varying levels of Web 2.0 implementations as well as various uses for the different tools in academic libraries. A further analysis of the Amelia V. Gallucci-Cirio Library’s implementation documents what they are doing and suggestions for improvement. It is undeniable that the digital life styles of people today are rapidly changing the way business of all kinds conduct business and academic libraries are not exempt. Academic libraries must develop ways to meet their patrons if they want to remain viable. Web 2.0 tools are the first step on that journey.

Keywords

References

[1]  Baro, E. E., Idiodi, E. O., & Godfrey, V. (2013). Awareness and use of Web 2.0 tools by librarians in university libraries in Nigeria. OCLC Systems & Services, 29, 170-188.
 
[2]  Bosque, D., Leif, S. A., & Skarl, S. (2012). Libraries atwitter: trends in academic library tweeting. Reference Services Review, 40, 199-213.
 
[3]  Coelho, H. (2011). Web 2.0 in academic libraries in Portuguese public universities: A longitudinal study.Libri: International Journal of Libraries & Information Services, 61, 249-257.
 
[4]  Dictionary.com. (2014). Retrieved from http://dictionary.reference.com/.
 
[5]  Dudenhoffer, C. (2012). Pin it!. College & Research Libraries News, 73, 328-332.
 
Show More References
[6]  Han, Z., &Liu, Y. Q. (2010). Web 2.0 applications in top Chinese university libraries. Library Hi Tech, 28, 41-62.
 
[7]  Jennings, S. (2012). To tweet, or not to tweet?. Reference Services Review, 40, 214-216.
 
[8]  Mahmood, K., & Richardson Jr., J. V. (2011). Adoption of Web 2.0 in US academic libraries: A survey of ARL library websites. Program, 45, 365-375.
 
[9]  Mahmood, K., & Richardson Jr, J. V. (2013). Impact of Web 2.0 technologies on academic libraries: a survey of ARL libraries. Electronic Library, 31, 508-520.
 
[10]  Sodt, J. M., & Summey, T. P. (2009). Beyond the library's walls: Using library 2.0 tools to reach out to all users. Journal of Library Administration, 49, 97-109.
 
[11]  Thornton, E. (2012). Is your academic library pinning? Academic libraries and Pinterest. Journal of Web Librarianship, 6, 164-175.
 
[12]  Tripathi, M., & Kumar, S. (2010). Use of Web 2.0 tools in academic libraries: A reconnaissance of the international landscape. International Information & Library Review, 42, 195-207.
 
Show Less References

Article

The DISTANCE Model for Collaborative Research: Distributing Analytic Effort Using Scrambled Data Sets

1Division of Research, Kaiser Permanente Northern California, 2000 Broadway, Oakland, CA 94612

2Center for Vulnerable Populations, University of California San Francisco, 1001 Potrero Ave., San Francisco, CA 94110


Information Security and Computer Fraud. 2014, 2(3), 33-38
DOI: 10.12691/iscf-2-3-1
Copyright © 2014 Science and Education Publishing

Cite this paper:
Howard H. Moffet, E. Margaret Warton, Melissa M. Parker, Jennifer Y. Liu, Courtney R. Lyles, Andrew J. Karter. The DISTANCE Model for Collaborative Research: Distributing Analytic Effort Using Scrambled Data Sets. Information Security and Computer Fraud. 2014; 2(3):33-38. doi: 10.12691/iscf-2-3-1.

Correspondence to: Howard  H. Moffet, Division of Research, Kaiser Permanente Northern California, 2000 Broadway, Oakland, CA 94612. Email: Howard.H.Moffet@kp.org

Abstract

Background: Data-sharing is encouraged to fulfill the ethical responsibility to transform research data into public health knowledge, but data sharing carries risks of improper disclosure and potential harm from release of individually identifiable data. Methods: The study objective was to develop and implement a novel method for scientific collaboration and data sharing which distributes the analytic burden while protecting patient privacy. A procedure was developed where in an investigator who is external to an analytic coordinating center (ACC) can conduct original research following a protocol governed by a Publications and Presentations (P&P) Committee. The collaborating investigator submits a study proposal and, if approved, develops the analytic specifications using existing data dictionaries and templates. An original data set is prepared according to the specifications and the external investigator is provided with a complete but de-identified and shuffled data set which retains all key data fields but which obfuscates individually identifiable data and patterns; this “scrambled data set” provides a “sandbox” for the external investigator to develop and test analytic code for analyses. The analytic code is then run against the original data at the ACC to generate output which is used by the external investigator in preparing a manuscript for journal submission. Results: The method has been successfully used with collaborators to produce many published papers and conference reports. Conclusion: By distributing the analytic burden, this method can facilitate collaboration and expand analytic capacity, resulting in more science for less money.

Keywords

References

[1]  NIH Statement on Sharing Research Data. http://grants.nih.gov/grants/policy/data_sharing/data_sharing_guidance.htm accessed March 21, 2013.
 
[2]  FINAL NIH STATEMENT ON SHARING RESEARCH DATA, NOTICE: NOT-OD-03-032. 2003. http://grants.nih.gov/grants/guide/notice-files/NOT-OD-03-032.html accessed March 21, 2013.
 
[3]  U.S. Department of Health and Human Services: Standards for Privacy of Individually Identifiable Health Information. 45 C.F.R. Parts 160 and 164.
 
[4]  Guidance Regarding Methods for De-identification of Protected Health Information in Accordance with the Health Insurance Portability and Accountability Act (HIPAA) Privacy Rule. http://www.hhs.gov/ocr/privacy/hipaa/understanding/coveredentities/De-identification/guidance.html Accessed Mar 21, 2013.
 
[5]  Miller JD: Sharing clinical research data in the United States under the Health Insurance Portability and Accountability Act and the Privacy Rule. Trials 2010, 11:112.
 
Show More References
[6]  Moffet HH, Adler N, Schillinger D, Ahmed AT, Laraia B, Selby JV, Neugebauer R, Liu JY, Parker MM, Warton M et al: Cohort Profile: The Diabetes Study of Northern California (DISTANCE)--objectives and design of a survey follow-up study of social health disparities in a managed care population. Int J Epidemiol 2009, 38 (1): 38-47.
 
[7]  Karter AJ, Schillinger D, Adams AS, Moffet HH, Liu J, Adler NE, Kanaya AM: Elevated Rates of Diabetes in Pacific Islanders and Asian Subgroups: The Diabetes Study of Northern California (DISTANCE). Diabetes Care 2012, 36 (3): 574-579.
 
[8]  Greenland S, Pearl J, Robins JM: Causal diagrams for epidemiologic research. Epidemiology 1999, 10 (1): 37-48.
 
[9]  Hernan MA, Hernandez-Diaz S, Werler MM, Mitchell AA: Causal knowledge as a prerequisite for confounding evaluation: an application to birth defects epidemiology. American journal of epidemiology 2002, 155 (2): 176-184.
 
[10]  Flegal KM, Ezzati TM, Harris MI, Haynes SG, Juarez RZ, Knowler WC, Perez-Stable EJ, Stern MP: Prevalence of diabetes in Mexican Americans, Cubans, and Puerto Ricans from the Hispanic Health and Nutrition Examination Survey, 1982-1984. Diabetes Care 1991, 14 (7): 628-638.
 
[11]  Muralidhar K SR: Data Shuffling—A New Masking Approach for Numerical Data. Management Science 2006, 52 (5): 658-670.
 
[12]  Laiteerapong N, Karter AJ, Liu JY, Moffet HH, Sudore R, Schillinger D, John PM, Huang ES: Correlates of quality of life in older adults with diabetes: the diabetes & aging study. Diabetes Care 2011, 34 (8): 1749-1753.
 
[13]  Lyles CR, Karter AJ, Young BA, Spigner C, Grembowski D, Schillinger D, Adler N: Patient-reported racial/ethnic healthcare provider discrimination and medication intensification in the Diabetes Study of Northern California (DISTANCE). J Gen Intern Med 2011, 26 (10): 1138-1144.
 
[14]  Lyles CR, Karter AJ, Young BA, Spigner C, Grembowski D, Schillinger D, Adler N: Provider factors and patient-reported healthcare discrimination in the Diabetes Study of California (DISTANCE). Patient Educ Couns 2011, 85 (3):e216-224.
 
[15]  Lyles CR, Karter AJ, Young BA, Spigner C, Grembowski D, Schillinger D, Adler NE: Correlates of patient-reported racial/ethnic health care discrimination in the Diabetes Study of Northern California (DISTANCE). J Health Care Poor Underserved 2011, 22 (1): 211-225.
 
[16]  Stoddard PJ, Laraia BA, Warton EM, Moffet HH, Adler NE, Schillinger D, Karter AJ: Neighborhood Deprivation and Change in BMI Among Adults With Type 2 Diabetes: The Diabetes Study of Northern California (DISTANCE). Diabetes Care 2012, 36 (5): 1200-1208.
 
[17]  Sudore RL, Karter AJ, Huang ES, Moffet HH, Laiteerapong N, Schenker Y, Adams A, Whitmer RA, Liu JY, Miao Y et al: Symptom Burden of Adults with Type 2 Diabetes Across the Disease Course: Diabetes & Aging Study. Journal of General Internal Medicine 2012, 27 (12): 1674-1681.
 
[18]  Moskowitz D, Lyles CR, Karter AJ, Adler N, Moffet HH, Schillinger D: Patient reported interpersonal processes of care and perceived social position: The Diabetes Study of Northern California (DISTANCE). Patient Educ Couns 2013, 90 (3): 392-398.
 
[19]  Lee SJ, Karter AJ, Thai JN, Van Den Eeden SK, Huang ES: Glycemic Control and Urinary Incontinence in Women with Diabetes Mellitus. J Womens Health (Larchmt) 2013, 22 (12): 1049-1055.
 
[20]  Jones-Smith JC, Karter AJ, Warton EM, Kelly M, Kersten E, Moffet HH, Adler N, Schillinger D, Laraia BA: Obesity and the food environment: income and ethnicity differences among people with diabetes: the Diabetes Study of Northern California (DISTANCE). Diabetes Care 2013, 36 (9): 2697-2705.
 
[21]  Rees CA KA, Young BA, Spigner C, Grembowski D, Schillinger D, Adler N Correlates of Self-Reported Discrimination in the Diabetes Study of Northern California (DISTANCE). In 31st Annual Meeting & Scientific Sessions of the Society of Behavioral Medicine. Seattle, WA.
 
[22]  Moskowitz D RC, Adler N, Karter AJ, Moffet HH, Schillinger D. : Effect of the social hierarchy on patient-physician communication: results from the DISTANCE study. In UCSF Disparities Symposium. San Francisco, CA.
 
[23]  Lee SJ K, Van den Eeden SK, Cenzer IS, Liu JY, Moffet HH, Huang ES: Glycemic Control and Incontinence in Older Women. In Amer Diabetes Assn meeting. San Diego, CA.
 
[24]  Hrynaszkiewicz I, Norton ML, Vickers AJ, Altman DG: Preparing raw clinical data for publication: guidance for journal editors, authors, and peer reviewers. Trials 2010, 11: 9.
 
[25]  Loukides G, Denny JC, Malin B: The disclosure of diagnosis codes can breach research participants' privacy. J Am Med Inform Assoc 2010, 17 (3): 322-327.
 
Show Less References

Article

Linear Mix-net and a Scheme for Collecting Data from Anonymous Data Holders

1School of Engineering, University of Fukui, Fukui, Japan


Information Security and Computer Fraud. 2014, 2(3), 39-47
DOI: 10.12691/iscf-2-3-2
Copyright © 2014 Science and Education Publishing

Cite this paper:
Shinsuke Tamura, Shuji Taniguchi. Linear Mix-net and a Scheme for Collecting Data from Anonymous Data Holders. Information Security and Computer Fraud. 2014; 2(3):39-47. doi: 10.12691/iscf-2-3-2.

Correspondence to: Shinsuke  Tamura, School of Engineering, University of Fukui, Fukui, Japan. Email: tamura@dance.plala.or.jp

Abstract

To make e-society, e-governance and cloud computing systems be utilized more widely, this paper proposes a scheme to collect attribute values belong to same data holders and calculate functions of them without knowing correspondences between the attribute values and their holders or links among attribute values of same holders. Different from most of other schemes the proposed scheme is based on linear Mix-net that exploits secret key encryption functions such as linear equation based (LE-based) and multidimensional array based (MA-based) ones, therefore it can handle real numbers that appear in many important business and engineering applications efficiently in the same way as integers. In addition, anonymous tag based credentials used in the scheme ensure the correctness of calculation results. Although the scheme can calculate only linear combinations of attribute values when LE-based encryption functions are used, if they are replaced with MA-based ones, it can calculate also general polynomial functions of attribute values.

Keywords

References

[1]  Diffie, W. and Hellman, M. E., “New directions in cryptography,” IEEE Trans. On Information Theory, IT-22 (6). 644-654. 1976.
 
[2]  Chaum, D., “Untraceable electronic mail, return address and digital pseudonyms,” Communications of the ACM, 24 (2). 84-88. 1981.
 
[3]  Cormen, T., Leiserson, C., Rivest, R. and Stein, C., Introduction to algorithms, MIT Press and McGraw-Hill, 2001.
 
[4]  Lee, B., Boyd, C., Dawson, E., Kim, K., Yang, J., and Yoo, S., “Providing receipt-freeness in Mixnet-based voting protocols,” Proc. of the ICISC ’03, 261-274. 2003.
 
[5]  Golle, P. and Jakobsson, M., “Reusable anonymous return channels,” Proc. of the 2003 ACM Workshop on Privacy in the Electronic Society, 94-100. 2003.
 
Show More References
[6]  Belenkiy, M., Camenisch, J., Chase, M., Kohlweiss, M., Lysyanskaya, A. and Shacham, H., “Randomizable proofs and delegatable anonymous credentials,” Proc. of the 29th Annual International Cryptology Conference on Advances in Cryptology, 108-125. 2009.
 
[7]  Shahandashti, S. F. and Safavi-Naini, R., “Threshold attribute-based signatures and their application to anonymous credential systems,” Proc. of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology, 198-216. 2009.
 
[8]  Gentry, C., “Fully homomorphic encryption using ideal lattices,” Proc. of Symposium on theory of computing –STOC 2009, 169-178. 2009.
 
[9]  Chung, K., Kalai, Y. and Vadhan, S., “Improved Delegation of Computation Using Fully Homomorphic Encryption,” CRYPT 2010, LNCS 6223, 483-501. 2010.
 
[10]  Tamura, S., Anonymous Security Systems and Applications: Requirements and Solutions, Information Science Reference, 2012.
 
[11]  Tamura, S. and Taniguchi, S., “A scheme for collecting anonymous data,” Proc. of IEEE-ICIT2013, 1210-1215. 2013.
 
[12]  Tamura, S. and Taniguchi, S., “Enhanced Anonymous Tag Based Credentials,” Information Security and Computer Fraud, 2 (1). 10-20. 2014.
 
Show Less References