In this paper, a non-interactive zero-knowledge proof scheme is proposed for secure identification in wireless networks, and it uses a timed oblivious transfer technique to enable a single verifier to identify multiple provers. The verifier and the prover do not need to be synchronized in this scheme. This scheme also enjoys the distance-bounding property which makes the proposed scheme invulnerable to the relay attack. We propose to use the order statistic for the detection of relay attackers. We show that it is optimal in terms of minimum variance. Finally, we shed some light on implementation issues of our proposed scheme.
Secure Multiparty Computation technique plays an important role in the security research of distributed systems.This paper firstly summarizes the advances in theoretical and practical studies on SMC,and then analysis the basic protocols and its related cryptographic algorithms.Secondly,the key tools,secret share,homomorphic public key cryptography,mix network,zero knowledge proof,oblivious transfer and private comparison protocol in implementation SMC are studied deeply.Finally,some research directions in this area are also proposed.
Nov 13, 2004·Proceedings of the IEEE 6th Circuits and Systems Symposium on Emerging Technologies: Frontiers of Mobile and Wireless Communication (IEEE Cat. No.04EX710)
In this paper, we present a fair non-repudiation protocol as an early effort to achieve fairness in the wireless environment. We propose a pseudo-resilient channel to satisfy the common assumption of fair protocols. We also use the RSA-based convertible signature schemes and non-interactive zero-knowledge proofs to reduce bandwidth and computation consumptions.