Referenced Items are not available for this document.
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 will shed some light on implementation issues of our proposed scheme.
Published in:
Global Telecommunications Conference, 2006. GLOBECOM '06. IEEE
Date of Conference: Nov. 27 2006-Dec. 1 2006
- Page(s):
- 1 - 5
- ISSN :
- 1930-529X
- E-ISBN :
- 1-4244-0357-X
- Print ISBN:
- 1-4244-0356-1
- INSPEC Accession Number:
- 10284937
- Conference Location :
- San Francisco, CA
- Digital Object Identifier :
- 10.1109/GLOCOM.2006.308
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
