In this paper, we propose BAN-GZKP that optimizes the best to date secure lightweight and energy efficient authentication scheme, BANZKP, designed for WBAN networks. BANZKP is vulnerable to several security attacks such as the replay attack, DDoS attacks at sink and redundancy information crack. Also BANZKP needs an end-to-end authentication which is not compliant with the human body postural mobility. Our scheme, BAN-GZKP, improves both the security and postural mobility resilience of BANZKP. In order to fix the security vulnerabilities of BANZKP, BAN-GZKP uses a novel random key allocation. Moreover, BAN-GZKP uses a hop-by-hop authentication scheme which makes it tolerant to postural mobility. We further prove the reliability of our scheme to various attacks including those to which BANZKP is vulnerable. Furthermore, via extensive simulations we prove that our scheme, BAN-GZKP, outperforms BANZKP in terms of reliability to human body postural mobility for various network parameters (end-to-end delay, number of packets exchanged in the network, number of transmissions). We compared both schemes using representative convergecast strategies with various transmission rates and human postural mobility. When our BAN-GZKP scheme is used the percentage of packets received increases by 34.06%, the end-to-end-delay reduces by 36.02% and the number of transmissions reduces by 8.75% with respect to the case when BANZKP is used. Moreover, BAN-GZKP uses only a three-phase authentication which is optimal in the class of ZKP protocols. Finally, it is important to mention that BAN-GZKP has no additional cost in terms memory, computational complexity or energy consumption compared to BANZKP.
We show how to adapt the Bitcoin BIP32 proposal for deterministic key generation for the Ed25519 curve which has non-linear key space. We also demonstrate that the alternative proposal by Chain.com is insecure and deviates from the EdDSA standard.
Recently, by changing security requirements of computer networks, many public key schemes are introduced. One major shortcoming of identity-based cryptosystems is key screw. Certificateless public key cryptosystems were introduced to solve this problem. In this paper, a certificateless, public-key, multiple-key-agreement scheme will be offered which has some significant security properties such as perfect forward secrecy, strong security, and zero-knowledge proof. This scheme produces far more shared hidden keys per session in comparison with many existing schemes. In this paper, the security and the efficiency of the proposed scheme will be compared with some well-known current schemes.
Internet of Things (IoT) is considered as an advanced version of machine - to-machine technology where the communication between intelligent things is possible with internet connectivity. Security and privacy issues of these things are more prominent since it is widely used in IoT related applications. Even though several authentication schemes which are based on password, hash function and other cryptographic primitives are existing, studies showing that it is vulnerable to different kinds of attacks. This paper proposes an Elliptic Curve Cryptography (ECC) based Self-Certified Key Management (SCKM) scheme for mutual authentication scheme relying on self-certified public key management of IoT systems. In this scheme, the public key of the more resource constrained nodes in the IoT system is generated by the less constrained systems. The private key of the more constrained nodes is generated jointly by the nodes. This concept satisfies the zero knowledge Proof. A security analysis shows that of proposed scheme is effective in defending against various attacks.
In this paper, we propose a joint random secret sharing scheme with public verifiability. It is practical in distributed environment. Utilizing additive homomorphism, a random secret will be corporately constructed by some participants, which avoids the need for a mutually trusted dealer. In addition, we explore the technique of homomorphic verification and that of bilinear pairing to allow each participant to publicly verify whether the received shares are consistent. The verification process in our scheme is unconditionally secure and non-interactive without using Fiat-Shamir technique or any additional zero knowledge proof, which is simple and higher efficient compared with previously known. Lastly, as an applied example of our work, we present how our techniques can be applied to handle dynamic node-join in mobile ad hoc network.
Nesrine Khernane, Maria Potop-Butucaru, Claude Chaudet
Advances in wearable and implementable of wireless sensors have enable the development of tiny and intelligent sensors called body sensors. Monitoring the vital body parameters in real-time using wireless body area network (WBAN) has shown great potential in improving healthcare quality not only for patients but also for medical staff. However, security and privacy are still an important issue in WBANs especially in multi-hop architectures. Considering the constraints of the body sensors (namely energy, memory, computational power, etc.). In this paper, we propose and present the design and the evaluation of a secure lightweight and energy efficient authentication scheme BANZKP based on an efficient cryptographic protocol, Zero Knowledge Proof (ZKP) and a commitment scheme. ZKP is used to confirm the identify of the sensor nodes, with small computational requirement, which is favorable for body sensors given their limited resources, while the commitment scheme is used to deal with replay attacks and hence the injection attacks by committing a message and revealing the key later. BANZKP reduces the memory requirement by 56,13% compared to TinyZKP [10], the comparable alternative so far for Body Area Networks. Also, the simulation results demonstrate that our proposed scheme is 17 and 5 times more efficient in term of execution time, and uses 94.11% and 80% less energy compared to TinyZKP and W-ECDSA [16], respectively.
Nesrine Khernane, Maria Potop-Butucaru, Claude Chaudet
-Wireless body area network(WBAN) has shown great potential in improving\nhealthcare quality not only for patients but also for medical staff. However,\nsecurity and privacy are still an important issue in WBANs especially in\nmulti-hop architectures. In this paper, we propose and present the design and\nthe evaluation of a secure lightweight and energy efficient authentication\nscheme BANZKP based on an efficient cryptographic protocol, Zero Knowledge\nProof (ZKP) and a commitment scheme. ZKP is used to confirm the identify of the\nsensor nodes, with small computational requirement, which is favorable for body\nsensors given their limited resources, while the commitment scheme is used to\ndeal with replay attacks and hence the injection attacks by committing a\nmessage and revealing the key later. Our scheme reduces the memory requirement\nby 56.13 % compared to TinyZKP [13], the comparable alternative so far for Body\nArea Networks, and uses 10 % less energy.\n
Francisco Martín-Fernández, Pino Caballero‐Gil, Cándido Caballero‐Gil
This paper describes the design and analysis of a new scheme for the authenticated exchange of confidential information in insecure environments within the Internet of Things, which allows a receiver of a message to authenticate the sender and compute a secret key shared with it. The proposal is based on the concept of a non-interactive zero-knowledge proof, so that in a single communication, relevant data may be inferred to verify the legitimacy of the sender. Besides, the new scheme uses the idea under the Diffie-Hellman protocol for the establishment of a shared secret key. The proposal has been fully developed for platforms built on the Android Open Source Project, so it can be used in any device or sensor with this operating system. This work provides a performance study of the implementation and a comparison between its promising results and others obtained with similar schemes.
Group signatures are a class of digital signatures with enhanced privacy. By using this type of signature, a user can sign a message on behalf of a specific group without revealing his identity, but in the case of a dispute, an authority can expose the identity of the signer. However, it is not always the case that we need to know the specific identity of a signature. In this paper, we propose the notion of deniable group signatures, where the authority can issue a proof showing that the specified user is NOT the signer of a signature, without revealing the actual signer. We point out that existing efficient non-interactive zero-knowledge proof systems cannot be straightforwardly applied to prove such a statement. We circumvent this problem by giving a fairly practical construction through extending the Groth group signature scheme (ASIACRYPT 2007). In particular, a denial proof in our scheme consists of 96 group elements, which is about twice the size of a signature in the Groth scheme. The proposed scheme is provably secure under the same assumptions as those of the Groth scheme.
Succinct non-interactive zero-knowledge arguments of knowledge (Zk-SNARKs) are needed in many applications. Unfortunately, all previous zk-SNARKs for interesting languages are either inefficient for the prover, or are non-adaptive and based on a commitment scheme that depends both on the prover's input and on the language, i.e., they are not commit-and-prove (CaP) SNARKs. We propose a proof-friendly extractable commitment scheme, and use it to construct prover-efficient adaptive CaP succinct zk-SNARKs for different languages, that can all reuse committed data. In new zk-SNARKs, the prover computation is dominated by a linear number of cryptographic operations. We use batch-verification to decrease the verifier's computation; importantly, batch-verification can be used also in QAP-based zk-SNARKs.
본 논문에서는 미리 알려진 임의의 다항식과 암호화된 다항식의 곱셈을 수행한 후, 해당 곱셈이 정당하게 수행되었음을 보이기 위해 증명자 (Prover)와 검증자 (Verifier)간의 다항식 상등성 영지식증명 (Zero-knowledge Proof) 프로토콜을 일반화할 수 있는 방법을 다룬다. 이를 위하여 다항식의 상등성을 증명하는 일반화된 프로토콜을 제시하고 랜덤오라클 (Random Oracle) 모델에서 안전성을 증명한다. 이러한 기법은 안전한 집합연산 기법을 포함하여 다항식에 기반한 다자간 연산기법 (Secure Multi-party Computation)에 적용될 수 있다. In this paper, we are interested in a generalization of zero-knowledge interactive protocols between prover and verifier, especially to show that the product of an encrypted polynomial and a random polynomial, but published by a secure commitment scheme was correctly computed by the prover. To this end, we provide a generalized protocol for proving that the resulting polynomial is correctly computed by an encrypted polynomial and another committed polynomial. Further we show that the protocol is also secure in the random oracle model. We expect that our generalized protocol can play a role of building blocks in implementing secure multi-party computation including private set operations.
Chinyang Henry Tseng, Shiau-Huey Wang, Woei-Jiunn Tsaur
As our aging population significantly grows, personal health monitoring is becoming an emerging service and can be accomplished by large-scale, low-power sensor networks, such as Zigbee networks. However, collected medical data may reveal patient privacy, and should be well protected. We propose a Hierarchical and Dynamic Elliptic Curve Cryptosystem based self-certified public key scheme (HiDE) for medical data protection. To serve a large amount of sensors, HiDE provides a hierarchical cluster-based framework consisting of a Backbone Cluster and several Area Clusters. In an Area Cluster, a Secure Access Point (SAP) collects medical data from Secure Sensors (SSs) in the sensor network, and transmits the aggregated data to a Root SAP located in the Backbone Cluster. Therefore, the Root SAP can serve a considerable number of SSs without establishing separate secure sessions with each SS individually. To provide dynamic secure sessions for mobile SSs connecting SAP, HiDE introduces the Elliptic Curve Cryptosystem based Self-certified Public key scheme (ESP) for establishing secure sessions between each pair of Cluster Head (CH) and Cluster Member (CM). In ESP, the CH can issue a public key to a CM, and computes a Shared Session Key (SSK) with that CM without knowing the CM's secrete key. This concept satisfies the Zero Knowledge Proof so CHs can dynamically build secure sessions with CMs without managing a CM's secrete keys. Our experiments in realistic implementations and Network Simulation demonstrate that ESP requires less computation and network overhead than the Rivest-Shamir-Adleman (RSA)-based public key scheme. In addition, security analysis shows keys in ESP are well protected. Thus, HiDE can protect the confidentiality of sensitive medical data with low computation overhead, and keep appropriate network performance for wireless sensor networks.
Today's Internet is full of applications by which users share potentially private information with each other. Recently, the privacy concerns of users are rising and users gradually become more suspicious with respect to the use of their (personal) information. In this thesis, we aim at bringing secure multi-party computation closer to common Internet users. The main goal is to design and implement privacy-preserving reconciliation-based applications for multiple users which are secure against passive and active attackers. Additionally, our solutions should be efficient enough to be practical and usable enough even for non-technical users.As a main contribution in theory, we present different privacy-preserving multi-party reconciliation protocols based on an additively homomorphic cryptosystem that are secure against passive attackers (semi-honest model). We also propose reconciliation protocols that are secure against active attackers (malicious model) by applying zero-knowledge proof techniques. The stronger security model comes at the price of efficiency. As a prerequisite, we develop several novel cryptographic tools in the areas of privacy-preserving set operations and zero-knowledge proofs of knowledge. We also analyze to what extent fully homomorphic cryptosystems can be used for multi-party privacy-preserving reconciliation protocols. As a main contribution in practice, we introduce SMC-MuSe, a framework for Secure Multi-Party Computation on MultiSets. SMC-MuSe is a carefully designed framework for secure multi-party computation including an implementation of different cryptographic components, a support infrastructure, multi-party privacy-preserving reconciliation protocols, and two user-friendly applications for the desktop and mobile environment. We also evaluate the efficiency of the SMC-MuSe framework. In particular, we measure the computation and communication overhead of all implemented components within the SMC-MuSe framework. As a third line of work, we propose different application scenarios in the areas of event scheduling, e-voting, and electronic auctions for reconciliation protocols. We examine the practicability of one particular user-friendly application of SMC-MuSe by conducting a user study on our Android application Prefer. The user study shows that Prefer is a useful and very interesting application for today's smartphone users. Finally, we show the potential of reconciliation protocols for common Internet users by conducting a user study on privacy-preserving reconciliation in the Internet. The user study shows that our reconciliation protocols are useful in different application scenarios for common Internet users.
For the cheating problem in group signature,With the discrete logarithm problem and zero-knowledge proof protocol,and combined with the participants'identity,agroup signature scheme without trusted center is presented.In the scheme,there is no trusted key distribution center,and the dealer is also a participant,each participant's secret shadow is composed of participants through the shadow of their own secret calculation to get,the group public key recovery is invisible recovery.The analysis shows that the scheme is safe and efficient.
Abstract : Authentication is deemed to be a critical function in the operation of tactical wireless ad hoc networks. The dynamic nature and unpredictability of these self - organizing networks requires that new security protocols be deployed that allow users to efficiently gain access to network resources without the burden of a centralized security infrastructure. Authentication protocols based on Zero - Knowledge Proof (ZKP) of identity schemes provide a means for establishing mutual trust between network entities. While many papers have looked at the virtues of ZKP - based authentication protocols from an academic perspective, little work has been carried out to actually deploy and test the protocols in fielded wireless networks. In this paper we present lessons - learned regarding the installation of ZKP - based authentication protocol on processing hardware designed for deployment on AFRL's small unmanned aerial vehicle (UAV) test bed.
This paper presents a concept for a new method to provide the authentication and confidentiality using zero knowledge protocol and key exchange. Zero knowledge proof protocol is a essential component of cryptography, which in recent years has increasingly popular amongst scholars. Its applications have widened and it has made inroads in several areas including mathematics and network safety and so on. This simple protocol based on zero knowledge proof by which user can prove to the authentication server that he has the password without having to send the password to the server either clear text or in encrypted format. This is a protocol in which the data learned by one party (i.e., The inspector) allow him/her to verify that a statement is true but does not reveal any additional information. In this paper we first discuss about zero-knowledge protocol proof system of knowledge and also key exchange between users and which then is modified into an authentication scheme with secret key exchange for confidentiality. The whole protocol involves mutual identification of two users, exchange of a random common secret key or session key for the verification of public keys.
A Mobile Ad-hoc Network (MANET) is a group of wireless mobile nodes that dynamically form a network without any pre-established infrastructure or centralized administration, Soewito (2014). Some network hops may be needed to send a packet from one node to another node in the MANET. To do the communication between the nodes, a route has to be selected in the network, therefore it need a routing protocol that manage selection of the route. Selection route in mobile ad-hoc network is not easy because nodes always move so that the topology of network always changed every time. This is a big issue in selection route in mobile ad-hoc network because the route can be broken anytime. Moreover, MANET is more vulnerable than other wireless communication types because every mobile node serves as both the host and the router and forwards packets on behalf of each other. This study presents the analyzing and evaluation several routing algorithms and a novel scheme to build an authentication system by adding the modified zero knowledge proof algorithm to each mobile node in MANET.