Cart (Loading....) | Create Account
Close category search window

Dense Parity Check Based Secrecy Sharing in Wireless Communications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sheng Xiao ; Univ. of Massachusetts, Amhers, Amherst ; Pishro-Nik, H. ; Weibo Gong

It is generally believed harmful to have transmission errors in the wireless communications. The high decoding complexity of dense parity check codes is unfavorable. This paper proposes to apply these two "negative" facts to enable the secrecy sharing with the information theoretical security. We claim that the secrecy sharing is always possible if the wiretap channel is not error-free, regardless of the main channel performance. Particularly, the proposed secrecy sharing protocol can provide provable and testable security using the existing wireless technologies.

Published in:

Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE

Date of Conference:

26-30 Nov. 2007

Need Help?

IEEE Advancing Technology for Humanity 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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.