Information Security and Computer Fraud»Articles

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

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

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

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

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