Secure Data Sharing with Confidentiality,Integrity and Access Control in Cloud Environment

Cloud storage is an incipient technology in today’s world.Lack of security in cloud environment is one of the primary challenges faced these days.This scenario poses new security issues and it forms the crux of the current work.The current study proposes Secure Interactional Proof System(SIPS)to address this challenge.This methodology has a few key essential components listed herewith to strengthen the security such as authentication,confidentiality,access control,integrity and the group of components such as AVK Scheme(Access List,Verifier and Key Generator).It is challenging for every user to prove their identity to the verifier who maintains the access list.Verification is conducted by following Gulliou-Quisquater protocol which determines the security level of the user in multi-step authentication process.Here,RSA algorithm performs the key generation process while the proposed methodology provides data integrity as well as confidentiality using asymmetric encryption.Various methodological operations such as time consumption have been used as performance evaluators in the proposed SIPS protocol.The proposed solution provides a secure system for firm data sharing in cloud environment with confidentiality,authentication and access control.Stochastic Timed Petri(STPN)Net evaluation tool was used to verify and prove the formal analysis of SIPS methodology.This evidence established the effectiveness of the proposed methodology in secure data sharing in cloud environment.

New instant confirmation mechanism based on interactive incontestable signature in consortium blockchain

The blockchain is a radical innovation that has a considerable effect on payments,stock exchanges,cybersecurity,and computational law.However,its limitations in terms of the uncertainty involved in transaction confirmation are significant.In this paper,we describe the design of a decentralized voting protocol for the election of a block generator in a consortium blockchain and propose a new system framework that allows fast and exact confirmation of all transactions.In addition,to replace a transaction’s owner signature,a new interactive incontestable signature between the dealer and owner is used to confirm a transaction.By means of this signature,the dealer can assure the owner that a transaction will be permanently included in the blockchain in a non-repudiation manner.Moreover,the signatures of all transactions in a block share only one witness that provides membership proof between the block and these transactions.Finally,a security and performance analysis shows that the proposed schemes are provably secure and highly efficient.

Memorizable Interactive Proof and Zero-Knowledge Proof Systems

Interactive proof and zero-knowledge proof systems are two important concepts in cryptography and complexity theory. In the past two decades, a great number of interactive proof and zero-knowledge proof protocols have been designed and applied in practice. In this paper, a simple memorizable zero-knowledge protocol is proposed for graph non-isomorphism problem, based on the memorizable interactive proof system, which is extended from the original definition of interactive proof and is more applicable in reality. Keywords interactive proof - zero-knowledge proof - memorizable interactive proof - memorizable zero-knowledge proof This work was supported by the ministry of Science and Technology of China (Grant No.2001CCA03000), and the National Natural Science Foundation of China (Grant No.60273045).Ning Chen received his B.S. degree from Fudan University in 2001. Now he is a master candidate of Department of Computer Science, Fudan University. His research interests include computational complexity, computational cryptography, algorithm design and analysis.Jia-Wei Rong received her B.S. degree from Fudan University in 2002. Now she is a master candidate of Department of Computer Science, Fudan University. Her research interests include computational cryptography, machine learning, artificial intelligence.

Existence of 3-round zero-knowledge proof systems for NP

This paper considers the existence of 3-round zero-knowledge proof systems for NP. Whether there exist 3-round non-black-box zero-knowledge proof systems for NP language is an open problem. By introducing a new interactive proof model, we construct a 3-round zero-knowledge proof system for graph 3-coloring under standard assumptions. Our protocol is a non-black-box zero-knowledge proof because we adopt a special strategy to prove the zero-knowledge property. Consequently, our construction shows the existence of 3-round non-black-box zero-knowledge proof for all languages in NP under the DDH assumption.