Software Defined Networking (SDN) is being extensively adopted by researchers and enterprise networks due to its feature of decoupling data and control planes from network device which enables them to implement new networking ideas. Communication between data and control planes faces various security issues where many users in data plane approach controller device in control plane to gain networking policies. In this paper, we proposed an efficient Zero-knowledge proof based identification scheme for securing SDN controller during data and control plane communication. This scheme ensures that only users who prove their knowledge about secrecy without revealing actual secret or any other information about it can communicate with controller. The computation cost was calculated to validate efficiency of the proposed work and compared with scheme that works in the basis of Kerberos authentication protocol.
As the Internet of Vehicle (IOV) being widely applied throughout our daily life, how to secure data privacy of each vehicle is nowadays a hot topic. Taking an aim of solving this problem, a privacy protection system on double-layered chain basis is designed to eliminate the said security risk during vehicle data communication. At the same time, the nontampering nature of the block chain is used to realize reasonable arbitration in traffic accident disputes, vehicle insurance claims, and other states of affairs. Specifically, an IOV double-layered chain model is constructed to simulate a semicentralized system that is convenient for government to supervise; also, a RSA protocol based on zero-knowledge proof (ZKP) is designed to bring safety and zero-knowledge property to the system; finally, we give the application scenario of this IOV privacy protection system based on double-layered chain that it can be widely used in vehicle-sharing industry. The communication costs, respectively, under double-layered chain and single-layered chain frameworks, are compared to prove that the double-layered structure does save cost. Thus an IOV privacy scheme that is safer and more cost-efficient is given.
Abstract Objectives: The scientific knowledge appears to grow by time. However, every scientific progress involves different kind of mistakes, which may survive for a long time. Nevertheless, the abandonment of partially true or falsified theorems, theories et cetera, for positions which approach more closely to the truth, is necessary. In a critical sense, a reduction of the myth in science demands the non-ending detection of contradictions in science and the elimination the same too. Methods: Nullity as one aspect of the trans-real arithmetic and equally as one of today’s approaches to the solution of the problem of the division of zero by zero is re-analyzed. A systematic mathematical proof is provided to prove the logical consistency of Nullity. Results: There is convincing evidence that Nullity is logically inconsistent. Furthermore, the about 2000 year old rule of the addition of zero’s (0+0+…+0 = 0) is proved as logically inconsistent and refuted. Conclusion: Nullity is self-contradictory and refuted. Keywords: Indeterminate forms, Classical logic, Zero divided by zero
Privacy problem is an emerging concern when we protect information security in cloud computing. In some application scenarios, the users may require to receive the computing results anonymously from the cloud server. However, complete anonymity brings regulatory issues to practical use. We usually need the encrypted results monitorable by superiors in case of illegal information, and once there are some disputes occurring, a trusted third-party arbitration institution is also required to trace the recipients without any need of decryption. Aiming at this problem, we propose a new cryptographic primitive named Hierarchical Identity-Based Group Encryption (HIBGE). In an HIBGE system, the recipients are organized in a tree-like structure. Recipients with the same function or belonging to the same department make up a group and they are managed by a group manager. When encrypting, the cloud can use the recipient’s identity as the public key, and others only know which group the message is sent to, but cannot know the exact recipient’s identity. Besides, the higher level can monitor the lower’s message, and group manager can trace the recipients’ identity. We then construct a concrete HIBGE scheme, and prove this scheme is semantic secure, anonymous and traceable, with a perfectly zero-knowledge proof. HIBGE scheme can be widely applied in cloud computing.
Due to the mobility of nodes, lack of infrastructure and limited computing and storage resources in mobile ad hoc networks (MANETs), this scheme uses the self-certification public key, combined with the interactive zero-knowledge proof and KEA+ key exchange method in the GPS identity authentication protocol, uses four interactions to complete the two-way identity authentication and key exchange of both parties, and which security is analyzed subsequently. The scheme effectively reduces the leakage of the claimant's secret knowledge in the identity authentication process, and enhances the reliability of the identity authentication and key exchange process.
Crowdsensing, driven by the proliferation of sensor-rich mobile devices, has emerged as a promising data sensing and aggregation paradigm. Despite useful, traditional crowdsensing systems typically rely on a centralized third-party platform for data collection and processing, which leads to concerns like single point of failure and lack of operation transparency. Such centralization hinders the wide adoption of crowdsensing by wary participants. We therefore explore an alternative design space of building crowdsensing systems atop the emerging decentralized blockchain technology. While enjoying the benefits brought by the public blockchain, we endeavor to achieve a consolidated set of desirable security properties with a proper choreography of latest techniques and our customized designs. We allow data providers to safely contribute data to the transparent blockchain with the confidentiality guarantee on individual data and differential privacy on the aggregation result. Meanwhile, we ensure the service correctness of data aggregation and sanitization by delicately employing hardware-assisted transparent enclave. Furthermore, we maintain the robustness of our system against faulty data providers that submit invalid data, with a customized zero-knowledge range proof scheme. The experiment results demonstrate the high efficiency of our designs on both mobile client and SGX-enabled server, as well as reasonable on-chain monetary cost of running our task contract on Ethereum.
Zero-knowledge proofs is a type of non-black box security technique and it is stated by the means of quadratic residuosity problem in this paper. We have used quadratic residuosity problem (QRP) for zero-knowledge proofs security system for the comparative analysis of this technique in comparison with discrete logarithm problem in cryptography. The upper bound of QRP with a prime modulus algorithm for quadratic residuosity problem is growing faster in comparison with discrete logarithm problem used by Henry. After that covariance between two different algorithms for different problems are calculated and obtained result is positive, which means random variables used for both functions are growing in same direction which reflect the fact, they are similar in behavior. Both functions are growing in same direction and our functional valued curve converge with Henry (Discrete Logarithm) functional valued curve at a point.
Performing a fair exchange without a Trusted Third Party (TTP) was considered to be impossible. With multi party computation and practices like Proof-of-Work (PoW), blockchain accomplishes a fair exchange in a trustless network. Data confidentiality is a key challenge that has to be resolved before adopting blockchain for enterprise applications where tokenized assets will be transferred. Protocols like Zcash are already providing the same for financial transactions but lacks flexibility required to apply in most of the potential use cases of blockchain. Most of the real world application work in a way where a transaction is carried out when a particular action is performed. Also, the zero knowledge proof method used in Zcash, ZKSNARK has certain weaknesses restricting its adoption. One of the major drawbacks of ZKSNARK is that it requires an initial trust setup phase which is difficult to achieve in blockchain ecosystem. ZKSTARK, an interactive zero knowledge proof does not require this phase and also provides security against post quantum attacks. We propose a system that uses two indistinguishable hash functions along with ZKSTARK to improve the flexibility of blockchain platforms. The two indistinguishable hash functions are chosen from SHA3-finalists based on their security, performance and inner designs.
Zero-knowledge and multi-prover systems are both central notions in classical and quantum complexity theory. There is, however, little research in quantum multi-prover zero-knowledge systems. This paper studies complexity-theoretical aspects of the quantum multi-prover zero-knowledge systems. This paper has two results: 1.QMIP* systems with honest zero-knowledge can be converted into general zero-knowledge systems without any assumptions. 2.QMIP* has computational quantum zero-knowledge systems if a natural computational conjecture holds. One of the main tools is a test (called the GHZ test) that uses GHZ states shared by the provers, which prevents the verifier's attack in the above two results. Another main tool is what we call the Local Hamiltonian based Interactive protocol (LHI protocol). The LHI protocol makes previous research for Local Hamiltonians applicable to check the history state of interactive proofs, and we then apply Broadbent et al.'s zero-knowledge protocol for QMA \cite{BJSW} to quantum multi-prover systems in order to obtain the second result.
ABSTRACT The Ethereum block chain as a decentralized platform is so successful that many applications deployed on it. However, for the inherent transparency properties and the lack of privacy, deploying a financial application on top of it is always a challenge. In this paper, we tackle this challenge and propose an anonymous sealed-bid auction protocol based on time-released encryption atop Consortium Block chain. We adopt a strict digital certificate-based identity mechanism of the consortium block chain to permit legitimate participants, and utilize the blind signature based on elliptic curve technology to allowing anonymous participation. Moreover, a timed release public key encryption algorithm is adopted to encrypt bids and prevent auctioneer from colluding with bidders. This is completely different from the method (zero-knowledge proof) used in other papers to prevent collusion between auctioneer and bidder. We provide a specific analysis of our protocol, which shows that our protocol meets anonymity and applicability. KEYWORDS Consortium Block chain, Smart Contract, Sealed-Bid Auction, Time-Released Encryption, Blind signature
We show that every language in QMA admits a classical-verifier, quantum-prover zero-knowledge argument system which is sound against quantum polynomial-time provers and zero-knowledge for classical (and quantum) polynomial-time verifiers. The protocol builds upon two recent results: a computational zero-knowledge proof system for languages in QMA, with a quantum verifier, introduced by Broadbent et al. (FOCS 2016), and an argument system for languages in QMA, with a classical verifier, introduced by Mahadev (FOCS 2018).
David Froelicher, Juan Ramón Troncoso-Pastoriza, João Sá Sousa, Jean‐Pierre Hubaux
Data sharing has become of primary importance in many domains such as big-data analytics, economics and medical research, but remains difficult to achieve when the data are sensitive. In fact, sharing personal information requires individuals' unconditional consent or is often simply forbidden for privacy and security reasons. In this paper, we propose Drynx, a decentralized system for privacy-conscious statistical analysis on distributed datasets. Drynx relies on a set of computing nodes to enable the computation of statistics such as standard deviation or extrema, and the training and evaluation of machine-learning models on sensitive and distributed data. To ensure data confidentiality and the privacy of the data providers, Drynx combines interactive protocols, homomorphic encryption, zero-knowledge proofs of correctness, and differential privacy. It enables an efficient and decentralized verification of the input data and of all the system's computations thus provides auditability in a strong adversarial model in which no entity has to be individually trusted. Drynx is highly modular, dynamic and parallelizable. Our evaluation shows that it enables the training of a logistic regression model on a dataset (12 features and 600,000 records) distributed among 12 data providers in less than 2 seconds. The computations are distributed among 6 computing nodes, and Drynx enables the verification of the query execution's correctness in less than 22 seconds.
David Froelicher, Juan Ramón Troncoso-Pastoriza, João M. C. Sousa, Jean‐Pierre Hubaux
Data sharing has become of primary importance in many domains such as\nbig-data analytics, economics and medical research, but remains difficult to\nachieve when the data are sensitive. In fact, sharing personal information\nrequires individuals' unconditional consent or is often simply forbidden for\nprivacy and security reasons. In this paper, we propose Drynx, a decentralized\nsystem for privacy-conscious statistical analysis on distributed datasets.\nDrynx relies on a set of computing nodes to enable the computation of\nstatistics such as standard deviation or extrema, and the training and\nevaluation of machine-learning models on sensitive and distributed data. To\nensure data confidentiality and the privacy of the data providers, Drynx\ncombines interactive protocols, homomorphic encryption, zero-knowledge proofs\nof correctness, and differential privacy. It enables an efficient and\ndecentralized verification of the input data and of all the system's\ncomputations thus provides auditability in a strong adversarial model in which\nno entity has to be individually trusted. Drynx is highly modular, dynamic and\nparallelizable. Our evaluation shows that it enables the training of a logistic\nregression model on a dataset (12 features and 600,000 records) distributed\namong 12 data providers in less than 2 seconds. The computations are\ndistributed among 6 computing nodes, and Drynx enables the verification of the\nquery execution's correctness in less than 22 seconds.\n
The Ethereum block chain as a decentralized platform is so successful that many applications deployed on it. However, for the inherent transparency properties and the lack of privacy, deploying a financial application on top of it is always a challenge. In this paper, we tackle this challenge and propose an anonymous sealed-bid auction protocol based on time-released encryption atop Consortium Block chain. We adopt a strict digital certificate-based identity mechanism of the consortium block chain to permit legitimate participants, and utilize the blind signature based on elliptic curve technology to allowing anonymous participation. Moreover, a timed release public key encryption algorithm is adopted to encrypt bids and prevent auctioneer from colluding with bidders. This is completely different from the method (zero-knowledge proof) used in other papers to prevent collusion between auctioneer and bidder. We provide a specific analysis of our protocol, which shows that our protocol meets anonymity and applicability.
A blockchain is a technology that allows transactions to be processed and committed data to be shared among participants without a central server. To implement applications among restricted parties with permission such as asset sales and trades, a special type of blockchain system called a private blockchain is used. Additionally, the demand for privacy preservation where sensitive information such as the trade amounts and balances is not disclosed is increasing. However, privacy preservation in a typical blockchain setting is difficult because it prevents parties that are not involved in the transaction from checking the correctness of the transaction being processed, which may lead to unintended or invalid transactions. To address this issue, herein we propose a protocol that allows the consistency with regard to the transaction amount and the balance to be checked without disclosing their values. Specifically, we exploit a homomorphic encryption to encrypt the transaction amount and balance. Thus, the correctness of a transaction can be publicly verified by the parties using the zero-knowledge proof without a trusted third party.
Albert Kofi Kwansah Ansah, Daniel Adu-Gyamfi, Stephen Anokye
Bitcoin ecosystem is supposed to be anonymous and untraceable. Nonetheless, Bitcoin offers weak anonymity in practice. The linkable pseudonymity of Bitcoin system raises privacy concerns for users. There are inputs and outputs of cryptocurrencies that link to Bitcoin public addresses. This is vulnerable to possible linkability and traceability of users’ identity, that can lead to information leakage. Input and output addresses of transactions miss unlinkability in Bitcoin. Several attempts to solve unlinkability and untraceability of users’ transactions found not to satisfy all requirements of a practical anonymity for users to transact business with bitcoins securely and privately. In this paper, the authors focused on preserving identity and transactional behaviour of users in bitcoin cryptocurrency transactions. A secure privacy-preserving scheme is presented. The paper incorporates bilinear pairing, elliptic curve (ECC), ring signature and Zero Knowledge Proof to curb users’ privacy breaches. The authors theoretically analysed, and evaluated proposed scheme, which is proven secure and robust to implement for preserving users’ privacy in bitcoin transactions. The proposal adds a compatible privacy-preserving layer on top of the Bitcoin blockchain, and consistent with the current Bitcoin architecture without offering any modification.
With the increasing popularity of online shopping, privacy concerns in E-commerce are attracting more and more attention. Existing E-commerce models are trapped in a dilemma between the proof of ownership and privacy protection. To address this issue, in this paper we design a privacy-preserving business protocol by employing private smart contracts in the negotiation phase. The protocol allows counterparties make deals without the disclosure of private information such as identities, addresses, and phone numbers. Moreover, we employ the zero-knowledge proof to guarantee the ownership. To understand the feasibility for implementing the proposed model, we also conduct extensive experiments to evaluate the performance of existing blockchain development platforms, Ethereum Quorum and SERO.
In vehicular cloud computing, a number of vehicle users act as nodes and communicate with each other to obtain location based services and data. Malicious users or service providers can collect the information of locations travelled and application accessed from vehicle users. Therefore, the authentication of vehicle users becomes challenge with preserving their actual identity and location privacy. In this paper we propose an efficient multi factor authentication scheme for vehicular cloud computing environment. This scheme uses zero knowledge based algorithm for user identity verification. It provides good privacy preservation, so that the adversaries are not able to succeed in tracing any vehicles. The simulation outcomes confirms that the proposed scheme achieves superior compared to existing schemes in terms of computational cost. Therefore, our scheme is appropriate for providing secure solution in vehicular cloud.
This work is an exploration of how graphs and permutations can be applied in the context of quantum information processing. In Chapter 2 we consider problems about the permutations of the subsystems of a quantum system. Explicitly, we attempt to understand the problem of determining if two quantum states of N qubits are isomorphic: if one can be obtained from the other by permuting its subsystems. We show that the well known graph isomorphism problem is a special case of state isomorphism. We also show that the complement of state isomorphism, the problem of determining if two states are not isomorphic, can be verified by a quantum interactive proof system, and that this proof system can be made statistical zero knowledge. We also consider the complexity of isomorphism problems for stabilizer states, and mixed states. In Chapter 3 we work with a special class of quantum states called grid states, in an effort to develop a toy model for mixed state entanglement. The key idea with grid states is that they can be represented by what we call a grid-labelled graph, literally, a graph forced to have vertices on a two dimensional grid. We show that whether or not a grid state is entangled can sometimes be determined solely from the structural properties of its corresponding grid-labelled graph. We use the grid state framework to build families of bound entangled states, suggesting that even in this restricted setting detecting entanglement is non-trivial and will require more than a single entanglement criterion.